./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0a05a45e59c4449e0f919ee265abbb6a4949f64a9be713d749d79d0baffd63df --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:10:13,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:10:13,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:10:13,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:10:13,301 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:10:13,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:10:13,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:10:13,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:10:13,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:10:13,316 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:10:13,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:10:13,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:10:13,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:10:13,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:10:13,316 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:10:13,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:10:13,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:10:13,316 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:10:13,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:10:13,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:10:13,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:10:13,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:10:13,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:10:13,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:10:13,317 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:10:13,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:10:13,317 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:10:13,317 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:10:13,317 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:10:13,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:10:13,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:10:13,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:10:13,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:10:13,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:10:13,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:10:13,317 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:10:13,317 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:10:13,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:10:13,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:10:13,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:10:13,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:10:13,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:10:13,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:10:13,318 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0a05a45e59c4449e0f919ee265abbb6a4949f64a9be713d749d79d0baffd63df [2025-02-05 16:10:13,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:10:13,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:10:13,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:10:13,519 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:10:13,519 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:10:13,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c [2025-02-05 16:10:14,753 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54c7fbd62/157454ef729c47988ac7ec94e7c2939d/FLAGe1c105489 [2025-02-05 16:10:15,042 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:10:15,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c [2025-02-05 16:10:15,056 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54c7fbd62/157454ef729c47988ac7ec94e7c2939d/FLAGe1c105489 [2025-02-05 16:10:15,320 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54c7fbd62/157454ef729c47988ac7ec94e7c2939d [2025-02-05 16:10:15,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:10:15,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:10:15,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:10:15,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:10:15,327 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:10:15,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:10:15" (1/1) ... [2025-02-05 16:10:15,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d912b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:15, skipping insertion in model container [2025-02-05 16:10:15,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:10:15" (1/1) ... [2025-02-05 16:10:15,349 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:10:15,498 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c[14577,14590] [2025-02-05 16:10:15,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:10:15,512 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:10:15,546 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c[14577,14590] [2025-02-05 16:10:15,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:10:15,559 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:10:15,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:15 WrapperNode [2025-02-05 16:10:15,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:10:15,560 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:10:15,560 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:10:15,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:10:15,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:15" (1/1) ... [2025-02-05 16:10:15,572 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:15" (1/1) ... [2025-02-05 16:10:15,594 INFO L138 Inliner]: procedures = 32, calls = 47, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 505 [2025-02-05 16:10:15,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:10:15,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:10:15,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:10:15,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:10:15,601 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:15" (1/1) ... [2025-02-05 16:10:15,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:15" (1/1) ... [2025-02-05 16:10:15,605 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:15" (1/1) ... [2025-02-05 16:10:15,615 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 16:10:15,615 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:15" (1/1) ... [2025-02-05 16:10:15,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:15" (1/1) ... [2025-02-05 16:10:15,626 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:15" (1/1) ... [2025-02-05 16:10:15,631 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:15" (1/1) ... [2025-02-05 16:10:15,632 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:15" (1/1) ... [2025-02-05 16:10:15,641 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:15" (1/1) ... [2025-02-05 16:10:15,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:10:15,644 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:10:15,645 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:10:15,645 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:10:15,645 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:15" (1/1) ... [2025-02-05 16:10:15,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:10:15,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:15,668 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:10:15,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:10:15,689 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2025-02-05 16:10:15,689 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2025-02-05 16:10:15,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:10:15,689 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2025-02-05 16:10:15,689 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2025-02-05 16:10:15,689 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-02-05 16:10:15,689 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-02-05 16:10:15,689 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 16:10:15,689 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 16:10:15,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:10:15,689 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2025-02-05 16:10:15,689 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2025-02-05 16:10:15,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:10:15,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:10:15,689 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2025-02-05 16:10:15,689 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2025-02-05 16:10:15,781 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:10:15,782 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:10:16,312 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-02-05 16:10:16,316 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:10:16,329 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:10:16,332 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:10:16,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:10:16 BoogieIcfgContainer [2025-02-05 16:10:16,333 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:10:16,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:10:16,336 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:10:16,339 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:10:16,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:10:15" (1/3) ... [2025-02-05 16:10:16,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77953d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:10:16, skipping insertion in model container [2025-02-05 16:10:16,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:15" (2/3) ... [2025-02-05 16:10:16,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77953d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:10:16, skipping insertion in model container [2025-02-05 16:10:16,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:10:16" (3/3) ... [2025-02-05 16:10:16,343 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c [2025-02-05 16:10:16,355 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:10:16,356 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c that has 7 procedures, 172 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 16:10:16,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:10:16,437 INFO L333 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=PETRI_NET, 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;@252bdaff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:10:16,437 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:10:16,444 INFO L276 IsEmpty]: Start isEmpty. Operand has 172 states, 135 states have (on average 1.5629629629629629) internal successors, (211), 137 states have internal predecessors, (211), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-05 16:10:16,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 16:10:16,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:16,456 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:10:16,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:16,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:16,460 INFO L85 PathProgramCache]: Analyzing trace with hash -203772679, now seen corresponding path program 1 times [2025-02-05 16:10:16,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:16,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115713931] [2025-02-05 16:10:16,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:16,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:16,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 16:10:16,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 16:10:16,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:16,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:16,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:10:16,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:16,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115713931] [2025-02-05 16:10:16,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115713931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:16,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:16,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 16:10:16,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065471169] [2025-02-05 16:10:16,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:16,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 16:10:16,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:16,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 16:10:16,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:10:16,674 INFO L87 Difference]: Start difference. First operand has 172 states, 135 states have (on average 1.5629629629629629) internal successors, (211), 137 states have internal predecessors, (211), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 16:10:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:16,711 INFO L93 Difference]: Finished difference Result 325 states and 536 transitions. [2025-02-05 16:10:16,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 16:10:16,712 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-02-05 16:10:16,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:16,721 INFO L225 Difference]: With dead ends: 325 [2025-02-05 16:10:16,721 INFO L226 Difference]: Without dead ends: 169 [2025-02-05 16:10:16,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:10:16,729 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:16,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:16,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-02-05 16:10:16,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-02-05 16:10:16,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 133 states have (on average 1.5488721804511278) internal successors, (206), 134 states have internal predecessors, (206), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-05 16:10:16,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 264 transitions. [2025-02-05 16:10:16,781 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 264 transitions. Word has length 28 [2025-02-05 16:10:16,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:16,782 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 264 transitions. [2025-02-05 16:10:16,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 16:10:16,782 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 264 transitions. [2025-02-05 16:10:16,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 16:10:16,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:16,783 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:10:16,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:10:16,783 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:16,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:16,784 INFO L85 PathProgramCache]: Analyzing trace with hash 2053138328, now seen corresponding path program 1 times [2025-02-05 16:10:16,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:16,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677073539] [2025-02-05 16:10:16,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:16,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:16,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 16:10:16,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 16:10:16,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:16,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:10:17,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:17,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677073539] [2025-02-05 16:10:17,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677073539] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:17,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:17,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:10:17,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316331004] [2025-02-05 16:10:17,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:17,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:10:17,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:17,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:10:17,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:10:17,017 INFO L87 Difference]: Start difference. First operand 169 states and 264 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 16:10:17,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:17,111 INFO L93 Difference]: Finished difference Result 324 states and 502 transitions. [2025-02-05 16:10:17,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:10:17,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-02-05 16:10:17,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:17,114 INFO L225 Difference]: With dead ends: 324 [2025-02-05 16:10:17,116 INFO L226 Difference]: Without dead ends: 169 [2025-02-05 16:10:17,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:10:17,118 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 0 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:17,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1278 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:10:17,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-02-05 16:10:17,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-02-05 16:10:17,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 133 states have (on average 1.4586466165413534) internal successors, (194), 134 states have internal predecessors, (194), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-05 16:10:17,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 252 transitions. [2025-02-05 16:10:17,142 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 252 transitions. Word has length 28 [2025-02-05 16:10:17,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:17,142 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 252 transitions. [2025-02-05 16:10:17,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 16:10:17,142 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 252 transitions. [2025-02-05 16:10:17,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 16:10:17,144 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:17,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:10:17,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:10:17,144 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:17,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:17,145 INFO L85 PathProgramCache]: Analyzing trace with hash 615521875, now seen corresponding path program 1 times [2025-02-05 16:10:17,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:17,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670966262] [2025-02-05 16:10:17,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:17,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:17,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 16:10:17,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 16:10:17,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:17,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:10:17,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:17,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670966262] [2025-02-05 16:10:17,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670966262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:17,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:17,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:17,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139711943] [2025-02-05 16:10:17,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:17,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:17,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:17,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:17,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:17,405 INFO L87 Difference]: Start difference. First operand 169 states and 252 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 16:10:17,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:17,446 INFO L93 Difference]: Finished difference Result 325 states and 494 transitions. [2025-02-05 16:10:17,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:17,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2025-02-05 16:10:17,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:17,448 INFO L225 Difference]: With dead ends: 325 [2025-02-05 16:10:17,448 INFO L226 Difference]: Without dead ends: 173 [2025-02-05 16:10:17,449 INFO L434 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-02-05 16:10:17,449 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 3 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:17,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 728 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:17,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-05 16:10:17,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-02-05 16:10:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 136 states have (on average 1.4485294117647058) internal successors, (197), 137 states have internal predecessors, (197), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-05 16:10:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 255 transitions. [2025-02-05 16:10:17,460 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 255 transitions. Word has length 39 [2025-02-05 16:10:17,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:17,460 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 255 transitions. [2025-02-05 16:10:17,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 16:10:17,460 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 255 transitions. [2025-02-05 16:10:17,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 16:10:17,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:17,461 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:10:17,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:10:17,461 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:17,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:17,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1651365689, now seen corresponding path program 1 times [2025-02-05 16:10:17,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:17,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676794491] [2025-02-05 16:10:17,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:17,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:17,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 16:10:17,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 16:10:17,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:17,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:17,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:10:17,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:17,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676794491] [2025-02-05 16:10:17,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676794491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:17,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:17,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:10:17,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385397141] [2025-02-05 16:10:17,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:17,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:10:17,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:17,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:10:17,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:10:17,564 INFO L87 Difference]: Start difference. First operand 173 states and 255 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 16:10:17,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:17,590 INFO L93 Difference]: Finished difference Result 476 states and 713 transitions. [2025-02-05 16:10:17,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:10:17,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 55 [2025-02-05 16:10:17,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:17,593 INFO L225 Difference]: With dead ends: 476 [2025-02-05 16:10:17,593 INFO L226 Difference]: Without dead ends: 320 [2025-02-05 16:10:17,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:10:17,594 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 208 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:17,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 500 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:17,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-02-05 16:10:17,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 315. [2025-02-05 16:10:17,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 243 states have (on average 1.4691358024691359) internal successors, (357), 245 states have internal predecessors, (357), 57 states have call successors, (57), 14 states have call predecessors, (57), 14 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-02-05 16:10:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 471 transitions. [2025-02-05 16:10:17,614 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 471 transitions. Word has length 55 [2025-02-05 16:10:17,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:17,614 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 471 transitions. [2025-02-05 16:10:17,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 16:10:17,614 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 471 transitions. [2025-02-05 16:10:17,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 16:10:17,615 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:17,616 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:10:17,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:10:17,616 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:17,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:17,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1398481475, now seen corresponding path program 1 times [2025-02-05 16:10:17,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:17,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221329925] [2025-02-05 16:10:17,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:17,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:17,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 16:10:17,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 16:10:17,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:17,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:17,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:10:17,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:17,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221329925] [2025-02-05 16:10:17,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221329925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:17,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:17,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:10:17,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50585236] [2025-02-05 16:10:17,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:17,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:10:17,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:17,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:10:17,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:10:17,674 INFO L87 Difference]: Start difference. First operand 315 states and 471 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 16:10:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:17,710 INFO L93 Difference]: Finished difference Result 887 states and 1337 transitions. [2025-02-05 16:10:17,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:10:17,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2025-02-05 16:10:17,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:17,715 INFO L225 Difference]: With dead ends: 887 [2025-02-05 16:10:17,715 INFO L226 Difference]: Without dead ends: 589 [2025-02-05 16:10:17,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:10:17,716 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 204 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:17,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 517 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:17,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-02-05 16:10:17,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 574. [2025-02-05 16:10:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 432 states have (on average 1.474537037037037) internal successors, (637), 436 states have internal predecessors, (637), 113 states have call successors, (113), 28 states have call predecessors, (113), 28 states have return successors, (113), 110 states have call predecessors, (113), 113 states have call successors, (113) [2025-02-05 16:10:17,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 863 transitions. [2025-02-05 16:10:17,786 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 863 transitions. Word has length 56 [2025-02-05 16:10:17,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:17,786 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 863 transitions. [2025-02-05 16:10:17,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 16:10:17,786 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 863 transitions. [2025-02-05 16:10:17,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 16:10:17,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:17,788 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:10:17,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:10:17,788 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:17,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:17,789 INFO L85 PathProgramCache]: Analyzing trace with hash 109070334, now seen corresponding path program 1 times [2025-02-05 16:10:17,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:17,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465915116] [2025-02-05 16:10:17,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:17,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:17,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 16:10:17,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 16:10:17,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:17,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:17,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:10:17,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:17,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465915116] [2025-02-05 16:10:17,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465915116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:17,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:17,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:10:17,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221116281] [2025-02-05 16:10:17,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:17,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:10:17,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:17,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:10:17,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:17,959 INFO L87 Difference]: Start difference. First operand 574 states and 863 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 16:10:18,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:18,136 INFO L93 Difference]: Finished difference Result 1224 states and 1839 transitions. [2025-02-05 16:10:18,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:18,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2025-02-05 16:10:18,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:18,143 INFO L225 Difference]: With dead ends: 1224 [2025-02-05 16:10:18,143 INFO L226 Difference]: Without dead ends: 667 [2025-02-05 16:10:18,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:10:18,145 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 349 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:18,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 642 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:10:18,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-02-05 16:10:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 651. [2025-02-05 16:10:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 501 states have (on average 1.4610778443113772) internal successors, (732), 504 states have internal predecessors, (732), 117 states have call successors, (117), 32 states have call predecessors, (117), 32 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-05 16:10:18,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 966 transitions. [2025-02-05 16:10:18,214 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 966 transitions. Word has length 56 [2025-02-05 16:10:18,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:18,214 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 966 transitions. [2025-02-05 16:10:18,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 16:10:18,214 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 966 transitions. [2025-02-05 16:10:18,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 16:10:18,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:18,215 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:10:18,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:10:18,215 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:18,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:18,216 INFO L85 PathProgramCache]: Analyzing trace with hash -742135692, now seen corresponding path program 1 times [2025-02-05 16:10:18,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:18,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824562401] [2025-02-05 16:10:18,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:18,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:18,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 16:10:18,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 16:10:18,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:18,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:10:18,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:18,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824562401] [2025-02-05 16:10:18,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824562401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:18,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:18,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:10:18,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923293058] [2025-02-05 16:10:18,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:18,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:10:18,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:18,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:10:18,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:18,356 INFO L87 Difference]: Start difference. First operand 651 states and 966 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 16:10:18,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:18,495 INFO L93 Difference]: Finished difference Result 1228 states and 1839 transitions. [2025-02-05 16:10:18,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:18,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 57 [2025-02-05 16:10:18,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:18,499 INFO L225 Difference]: With dead ends: 1228 [2025-02-05 16:10:18,499 INFO L226 Difference]: Without dead ends: 671 [2025-02-05 16:10:18,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:10:18,502 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 349 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:18,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 642 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:10:18,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-02-05 16:10:18,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 659. [2025-02-05 16:10:18,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 509 states have (on average 1.4538310412573674) internal successors, (740), 512 states have internal predecessors, (740), 117 states have call successors, (117), 32 states have call predecessors, (117), 32 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-05 16:10:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 974 transitions. [2025-02-05 16:10:18,577 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 974 transitions. Word has length 57 [2025-02-05 16:10:18,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:18,577 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 974 transitions. [2025-02-05 16:10:18,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 16:10:18,578 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 974 transitions. [2025-02-05 16:10:18,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 16:10:18,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:18,579 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:10:18,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:10:18,579 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:18,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:18,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1959158317, now seen corresponding path program 1 times [2025-02-05 16:10:18,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:18,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105852947] [2025-02-05 16:10:18,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:18,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:18,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:10:18,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:10:18,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:18,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:10:18,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:18,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105852947] [2025-02-05 16:10:18,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105852947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:18,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:18,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:18,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722867105] [2025-02-05 16:10:18,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:18,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:18,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:18,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:18,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:18,714 INFO L87 Difference]: Start difference. First operand 659 states and 974 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 16:10:18,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:18,839 INFO L93 Difference]: Finished difference Result 1216 states and 1819 transitions. [2025-02-05 16:10:18,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:18,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2025-02-05 16:10:18,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:18,844 INFO L225 Difference]: With dead ends: 1216 [2025-02-05 16:10:18,844 INFO L226 Difference]: Without dead ends: 659 [2025-02-05 16:10:18,846 INFO L434 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-02-05 16:10:18,849 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 52 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:18,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 640 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:10:18,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-02-05 16:10:18,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2025-02-05 16:10:18,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 509 states have (on average 1.4459724950884087) internal successors, (736), 512 states have internal predecessors, (736), 117 states have call successors, (117), 32 states have call predecessors, (117), 32 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-05 16:10:18,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 970 transitions. [2025-02-05 16:10:18,888 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 970 transitions. Word has length 59 [2025-02-05 16:10:18,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:18,888 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 970 transitions. [2025-02-05 16:10:18,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 16:10:18,889 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 970 transitions. [2025-02-05 16:10:18,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 16:10:18,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:18,891 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:10:18,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:10:18,891 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:18,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:18,892 INFO L85 PathProgramCache]: Analyzing trace with hash 702003061, now seen corresponding path program 1 times [2025-02-05 16:10:18,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:18,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305201160] [2025-02-05 16:10:18,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:18,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:18,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 16:10:18,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 16:10:18,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:18,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:19,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:10:19,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:19,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305201160] [2025-02-05 16:10:19,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305201160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:19,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:19,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:19,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140407411] [2025-02-05 16:10:19,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:19,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:19,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:19,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:19,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:19,049 INFO L87 Difference]: Start difference. First operand 659 states and 970 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 16:10:19,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:19,097 INFO L93 Difference]: Finished difference Result 1236 states and 1843 transitions. [2025-02-05 16:10:19,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:19,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2025-02-05 16:10:19,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:19,102 INFO L225 Difference]: With dead ends: 1236 [2025-02-05 16:10:19,103 INFO L226 Difference]: Without dead ends: 679 [2025-02-05 16:10:19,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-05 16:10:19,105 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 4 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:19,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 740 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:19,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-02-05 16:10:19,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2025-02-05 16:10:19,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 525 states have (on average 1.4323809523809523) internal successors, (752), 528 states have internal predecessors, (752), 117 states have call successors, (117), 36 states have call predecessors, (117), 36 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-05 16:10:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 986 transitions. [2025-02-05 16:10:19,142 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 986 transitions. Word has length 60 [2025-02-05 16:10:19,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:19,143 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 986 transitions. [2025-02-05 16:10:19,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 16:10:19,144 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 986 transitions. [2025-02-05 16:10:19,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:10:19,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:19,145 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:19,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:10:19,145 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:19,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:19,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1822734871, now seen corresponding path program 1 times [2025-02-05 16:10:19,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:19,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725735063] [2025-02-05 16:10:19,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:19,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:19,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:10:19,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:10:19,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:19,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:19,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:10:19,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:19,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725735063] [2025-02-05 16:10:19,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725735063] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:19,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:19,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:19,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470114879] [2025-02-05 16:10:19,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:19,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:19,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:19,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:19,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:19,298 INFO L87 Difference]: Start difference. First operand 679 states and 986 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 16:10:19,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:19,358 INFO L93 Difference]: Finished difference Result 1276 states and 1887 transitions. [2025-02-05 16:10:19,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:19,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2025-02-05 16:10:19,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:19,362 INFO L225 Difference]: With dead ends: 1276 [2025-02-05 16:10:19,362 INFO L226 Difference]: Without dead ends: 699 [2025-02-05 16:10:19,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-05 16:10:19,364 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 4 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:19,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 726 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:19,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-02-05 16:10:19,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2025-02-05 16:10:19,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 541 states have (on average 1.4195933456561922) internal successors, (768), 544 states have internal predecessors, (768), 117 states have call successors, (117), 40 states have call predecessors, (117), 40 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-05 16:10:19,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1002 transitions. [2025-02-05 16:10:19,402 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1002 transitions. Word has length 68 [2025-02-05 16:10:19,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:19,403 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 1002 transitions. [2025-02-05 16:10:19,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 16:10:19,403 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1002 transitions. [2025-02-05 16:10:19,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 16:10:19,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:19,404 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:19,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:10:19,404 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:19,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:19,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1932700925, now seen corresponding path program 1 times [2025-02-05 16:10:19,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:19,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927300870] [2025-02-05 16:10:19,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:19,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:19,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 16:10:19,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 16:10:19,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:19,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:10:19,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:19,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927300870] [2025-02-05 16:10:19,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927300870] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:19,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:19,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:19,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713152389] [2025-02-05 16:10:19,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:19,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:19,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:19,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:19,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:19,509 INFO L87 Difference]: Start difference. First operand 699 states and 1002 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 16:10:19,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:19,560 INFO L93 Difference]: Finished difference Result 1312 states and 1903 transitions. [2025-02-05 16:10:19,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:19,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76 [2025-02-05 16:10:19,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:19,564 INFO L225 Difference]: With dead ends: 1312 [2025-02-05 16:10:19,564 INFO L226 Difference]: Without dead ends: 715 [2025-02-05 16:10:19,565 INFO L434 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-02-05 16:10:19,566 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 3 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:19,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 736 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:19,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-02-05 16:10:19,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2025-02-05 16:10:19,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 553 states have (on average 1.410488245931284) internal successors, (780), 556 states have internal predecessors, (780), 117 states have call successors, (117), 44 states have call predecessors, (117), 44 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-05 16:10:19,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1014 transitions. [2025-02-05 16:10:19,617 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1014 transitions. Word has length 76 [2025-02-05 16:10:19,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:19,617 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1014 transitions. [2025-02-05 16:10:19,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 16:10:19,618 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1014 transitions. [2025-02-05 16:10:19,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 16:10:19,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:19,618 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:19,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:10:19,619 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:19,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:19,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1300772662, now seen corresponding path program 1 times [2025-02-05 16:10:19,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:19,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471827132] [2025-02-05 16:10:19,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:19,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:19,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 16:10:19,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 16:10:19,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:19,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:19,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:10:19,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:19,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471827132] [2025-02-05 16:10:19,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471827132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:19,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:19,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:19,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771152777] [2025-02-05 16:10:19,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:19,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:19,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:19,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:19,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:19,738 INFO L87 Difference]: Start difference. First operand 715 states and 1014 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 16:10:19,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:19,805 INFO L93 Difference]: Finished difference Result 1348 states and 1943 transitions. [2025-02-05 16:10:19,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:19,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76 [2025-02-05 16:10:19,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:19,809 INFO L225 Difference]: With dead ends: 1348 [2025-02-05 16:10:19,809 INFO L226 Difference]: Without dead ends: 735 [2025-02-05 16:10:19,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-05 16:10:19,811 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 4 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:19,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 726 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:19,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-02-05 16:10:19,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2025-02-05 16:10:19,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 569 states have (on average 1.398945518453427) internal successors, (796), 572 states have internal predecessors, (796), 117 states have call successors, (117), 48 states have call predecessors, (117), 48 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-05 16:10:19,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1030 transitions. [2025-02-05 16:10:19,843 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1030 transitions. Word has length 76 [2025-02-05 16:10:19,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:19,844 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 1030 transitions. [2025-02-05 16:10:19,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 16:10:19,844 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1030 transitions. [2025-02-05 16:10:19,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 16:10:19,845 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:19,845 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:19,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:10:19,846 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:19,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:19,846 INFO L85 PathProgramCache]: Analyzing trace with hash -911760200, now seen corresponding path program 1 times [2025-02-05 16:10:19,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:19,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129784126] [2025-02-05 16:10:19,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:19,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:19,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 16:10:19,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 16:10:19,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:19,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:19,999 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:10:20,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:20,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129784126] [2025-02-05 16:10:20,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129784126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:20,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:20,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:20,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017347162] [2025-02-05 16:10:20,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:20,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:20,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:20,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:20,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:20,002 INFO L87 Difference]: Start difference. First operand 735 states and 1030 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 16:10:20,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:20,068 INFO L93 Difference]: Finished difference Result 1392 states and 1971 transitions. [2025-02-05 16:10:20,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:20,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 84 [2025-02-05 16:10:20,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:20,072 INFO L225 Difference]: With dead ends: 1392 [2025-02-05 16:10:20,072 INFO L226 Difference]: Without dead ends: 759 [2025-02-05 16:10:20,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-02-05 16:10:20,074 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 5 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:20,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 738 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:20,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2025-02-05 16:10:20,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2025-02-05 16:10:20,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 589 states have (on average 1.3853989813242784) internal successors, (816), 592 states have internal predecessors, (816), 117 states have call successors, (117), 52 states have call predecessors, (117), 52 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-05 16:10:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1050 transitions. [2025-02-05 16:10:20,118 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1050 transitions. Word has length 84 [2025-02-05 16:10:20,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:20,119 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 1050 transitions. [2025-02-05 16:10:20,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 16:10:20,119 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1050 transitions. [2025-02-05 16:10:20,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 16:10:20,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:20,121 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:20,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:10:20,121 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:20,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:20,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1502649538, now seen corresponding path program 1 times [2025-02-05 16:10:20,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:20,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821856688] [2025-02-05 16:10:20,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:20,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:20,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 16:10:20,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 16:10:20,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:20,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:20,558 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:10:20,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:20,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821856688] [2025-02-05 16:10:20,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821856688] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:20,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:20,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:10:20,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426767147] [2025-02-05 16:10:20,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:20,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:10:20,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:20,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:10:20,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:10:20,559 INFO L87 Difference]: Start difference. First operand 759 states and 1050 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 16:10:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:20,780 INFO L93 Difference]: Finished difference Result 1983 states and 2731 transitions. [2025-02-05 16:10:20,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:10:20,781 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 87 [2025-02-05 16:10:20,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:20,788 INFO L225 Difference]: With dead ends: 1983 [2025-02-05 16:10:20,788 INFO L226 Difference]: Without dead ends: 1326 [2025-02-05 16:10:20,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:10:20,790 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 200 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:20,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1393 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:10:20,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2025-02-05 16:10:20,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 912. [2025-02-05 16:10:20,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 705 states have (on average 1.374468085106383) internal successors, (969), 709 states have internal predecessors, (969), 141 states have call successors, (141), 65 states have call predecessors, (141), 65 states have return successors, (141), 137 states have call predecessors, (141), 141 states have call successors, (141) [2025-02-05 16:10:20,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1251 transitions. [2025-02-05 16:10:20,839 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1251 transitions. Word has length 87 [2025-02-05 16:10:20,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:20,840 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1251 transitions. [2025-02-05 16:10:20,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 16:10:20,840 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1251 transitions. [2025-02-05 16:10:20,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 16:10:20,841 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:20,841 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:20,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:10:20,841 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:20,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:20,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1983966273, now seen corresponding path program 1 times [2025-02-05 16:10:20,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:20,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010384422] [2025-02-05 16:10:20,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:20,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:20,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 16:10:20,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 16:10:20,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:20,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:20,950 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:10:20,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:20,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010384422] [2025-02-05 16:10:20,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010384422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:20,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:20,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:20,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777424376] [2025-02-05 16:10:20,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:20,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:20,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:20,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:20,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:20,951 INFO L87 Difference]: Start difference. First operand 912 states and 1251 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-05 16:10:21,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:21,015 INFO L93 Difference]: Finished difference Result 1697 states and 2351 transitions. [2025-02-05 16:10:21,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:21,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 91 [2025-02-05 16:10:21,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:21,021 INFO L225 Difference]: With dead ends: 1697 [2025-02-05 16:10:21,021 INFO L226 Difference]: Without dead ends: 932 [2025-02-05 16:10:21,022 INFO L434 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-02-05 16:10:21,023 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 3 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:21,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 736 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:21,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-02-05 16:10:21,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2025-02-05 16:10:21,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 720 states have (on average 1.3666666666666667) internal successors, (984), 724 states have internal predecessors, (984), 141 states have call successors, (141), 70 states have call predecessors, (141), 70 states have return successors, (141), 137 states have call predecessors, (141), 141 states have call successors, (141) [2025-02-05 16:10:21,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1266 transitions. [2025-02-05 16:10:21,085 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1266 transitions. Word has length 91 [2025-02-05 16:10:21,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:21,086 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1266 transitions. [2025-02-05 16:10:21,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-05 16:10:21,086 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1266 transitions. [2025-02-05 16:10:21,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:10:21,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:21,087 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:21,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:10:21,087 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:21,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:21,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1856881948, now seen corresponding path program 1 times [2025-02-05 16:10:21,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:21,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365543105] [2025-02-05 16:10:21,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:21,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:21,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:10:21,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:10:21,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:21,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:21,467 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 16:10:21,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:21,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365543105] [2025-02-05 16:10:21,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365543105] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:10:21,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302327385] [2025-02-05 16:10:21,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:21,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:21,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:21,473 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:10:21,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:10:21,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:10:21,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:10:21,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:21,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:21,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 16:10:21,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:10:21,720 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 16:10:21,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:10:21,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302327385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:21,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:10:21,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2025-02-05 16:10:21,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958967990] [2025-02-05 16:10:21,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:21,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:10:21,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:21,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:10:21,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:10:21,721 INFO L87 Difference]: Start difference. First operand 932 states and 1266 transitions. Second operand has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-05 16:10:21,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:21,876 INFO L93 Difference]: Finished difference Result 2086 states and 2955 transitions. [2025-02-05 16:10:21,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:10:21,876 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2025-02-05 16:10:21,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:21,882 INFO L225 Difference]: With dead ends: 2086 [2025-02-05 16:10:21,883 INFO L226 Difference]: Without dead ends: 1341 [2025-02-05 16:10:21,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:10:21,885 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 139 mSDsluCounter, 2352 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 2777 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:21,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 2777 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:10:21,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2025-02-05 16:10:21,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 934. [2025-02-05 16:10:21,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 720 states have (on average 1.3597222222222223) internal successors, (979), 725 states have internal predecessors, (979), 142 states have call successors, (142), 71 states have call predecessors, (142), 71 states have return successors, (142), 137 states have call predecessors, (142), 142 states have call successors, (142) [2025-02-05 16:10:21,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1263 transitions. [2025-02-05 16:10:21,961 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1263 transitions. Word has length 90 [2025-02-05 16:10:21,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:21,961 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1263 transitions. [2025-02-05 16:10:21,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-05 16:10:21,961 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1263 transitions. [2025-02-05 16:10:21,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:10:21,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:21,962 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:21,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 16:10:22,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 16:10:22,164 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:22,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:22,164 INFO L85 PathProgramCache]: Analyzing trace with hash 62194241, now seen corresponding path program 1 times [2025-02-05 16:10:22,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:22,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608200143] [2025-02-05 16:10:22,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:22,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:22,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:10:22,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:10:22,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:22,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:22,275 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 16:10:22,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:22,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608200143] [2025-02-05 16:10:22,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608200143] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:22,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:22,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:10:22,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958216554] [2025-02-05 16:10:22,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:22,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:10:22,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:22,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:10:22,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:10:22,277 INFO L87 Difference]: Start difference. First operand 934 states and 1263 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 16:10:22,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:22,425 INFO L93 Difference]: Finished difference Result 1740 states and 2372 transitions. [2025-02-05 16:10:22,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:10:22,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 93 [2025-02-05 16:10:22,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:22,430 INFO L225 Difference]: With dead ends: 1740 [2025-02-05 16:10:22,430 INFO L226 Difference]: Without dead ends: 994 [2025-02-05 16:10:22,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:10:22,432 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 236 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:22,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1435 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:10:22,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2025-02-05 16:10:22,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 952. [2025-02-05 16:10:22,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 743 states have (on average 1.3566621803499328) internal successors, (1008), 752 states have internal predecessors, (1008), 136 states have call successors, (136), 72 states have call predecessors, (136), 72 states have return successors, (136), 127 states have call predecessors, (136), 136 states have call successors, (136) [2025-02-05 16:10:22,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1280 transitions. [2025-02-05 16:10:22,484 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1280 transitions. Word has length 93 [2025-02-05 16:10:22,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:22,484 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1280 transitions. [2025-02-05 16:10:22,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 16:10:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1280 transitions. [2025-02-05 16:10:22,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:10:22,485 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:22,486 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:22,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:10:22,486 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:22,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:22,486 INFO L85 PathProgramCache]: Analyzing trace with hash 916063623, now seen corresponding path program 1 times [2025-02-05 16:10:22,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:22,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181372536] [2025-02-05 16:10:22,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:22,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:22,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:10:22,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:10:22,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:22,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:22,938 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 16:10:22,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:22,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181372536] [2025-02-05 16:10:22,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181372536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:22,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:22,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:10:22,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146720581] [2025-02-05 16:10:22,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:22,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:10:22,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:22,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:10:22,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:10:22,941 INFO L87 Difference]: Start difference. First operand 952 states and 1280 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:10:23,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:23,118 INFO L93 Difference]: Finished difference Result 1725 states and 2334 transitions. [2025-02-05 16:10:23,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:10:23,119 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 95 [2025-02-05 16:10:23,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:23,128 INFO L225 Difference]: With dead ends: 1725 [2025-02-05 16:10:23,128 INFO L226 Difference]: Without dead ends: 951 [2025-02-05 16:10:23,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:10:23,130 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 131 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:23,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1511 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:10:23,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-02-05 16:10:23,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 941. [2025-02-05 16:10:23,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 735 states have (on average 1.3551020408163266) internal successors, (996), 744 states have internal predecessors, (996), 134 states have call successors, (134), 71 states have call predecessors, (134), 71 states have return successors, (134), 125 states have call predecessors, (134), 134 states have call successors, (134) [2025-02-05 16:10:23,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1264 transitions. [2025-02-05 16:10:23,183 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1264 transitions. Word has length 95 [2025-02-05 16:10:23,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:23,183 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1264 transitions. [2025-02-05 16:10:23,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:10:23,184 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1264 transitions. [2025-02-05 16:10:23,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:10:23,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:23,185 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:23,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:10:23,185 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:23,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:23,186 INFO L85 PathProgramCache]: Analyzing trace with hash 854300559, now seen corresponding path program 1 times [2025-02-05 16:10:23,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:23,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577886888] [2025-02-05 16:10:23,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:23,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:23,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:10:23,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:10:23,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:23,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:23,572 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 16:10:23,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:23,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577886888] [2025-02-05 16:10:23,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577886888] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:23,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:23,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:10:23,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946495166] [2025-02-05 16:10:23,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:23,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:10:23,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:23,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:10:23,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:10:23,576 INFO L87 Difference]: Start difference. First operand 941 states and 1264 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:10:23,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:23,919 INFO L93 Difference]: Finished difference Result 1792 states and 2394 transitions. [2025-02-05 16:10:23,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:10:23,920 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 96 [2025-02-05 16:10:23,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:23,925 INFO L225 Difference]: With dead ends: 1792 [2025-02-05 16:10:23,926 INFO L226 Difference]: Without dead ends: 998 [2025-02-05 16:10:23,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:10:23,928 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 396 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:23,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1205 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:10:23,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-02-05 16:10:23,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 957. [2025-02-05 16:10:23,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 743 states have (on average 1.3310901749663526) internal successors, (989), 753 states have internal predecessors, (989), 137 states have call successors, (137), 76 states have call predecessors, (137), 76 states have return successors, (137), 127 states have call predecessors, (137), 137 states have call successors, (137) [2025-02-05 16:10:23,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1263 transitions. [2025-02-05 16:10:23,993 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1263 transitions. Word has length 96 [2025-02-05 16:10:23,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:23,993 INFO L471 AbstractCegarLoop]: Abstraction has 957 states and 1263 transitions. [2025-02-05 16:10:23,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:10:23,994 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1263 transitions. [2025-02-05 16:10:23,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:10:23,994 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:23,995 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:23,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:10:23,995 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:23,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:23,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1834627817, now seen corresponding path program 1 times [2025-02-05 16:10:23,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:23,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326580199] [2025-02-05 16:10:23,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:23,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:24,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:10:24,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:10:24,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:24,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 16:10:24,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:24,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326580199] [2025-02-05 16:10:24,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326580199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:24,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:24,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:24,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535158395] [2025-02-05 16:10:24,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:24,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:24,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:24,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:24,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:24,084 INFO L87 Difference]: Start difference. First operand 957 states and 1263 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:24,211 INFO L93 Difference]: Finished difference Result 2528 states and 3355 transitions. [2025-02-05 16:10:24,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:24,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 97 [2025-02-05 16:10:24,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:24,219 INFO L225 Difference]: With dead ends: 2528 [2025-02-05 16:10:24,219 INFO L226 Difference]: Without dead ends: 1769 [2025-02-05 16:10:24,221 INFO L434 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-02-05 16:10:24,221 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 192 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:24,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1122 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:24,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2025-02-05 16:10:24,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1538. [2025-02-05 16:10:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1538 states, 1181 states have (on average 1.3243014394580863) internal successors, (1564), 1197 states have internal predecessors, (1564), 231 states have call successors, (231), 125 states have call predecessors, (231), 125 states have return successors, (231), 215 states have call predecessors, (231), 231 states have call successors, (231) [2025-02-05 16:10:24,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2026 transitions. [2025-02-05 16:10:24,321 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2026 transitions. Word has length 97 [2025-02-05 16:10:24,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:24,321 INFO L471 AbstractCegarLoop]: Abstraction has 1538 states and 2026 transitions. [2025-02-05 16:10:24,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:24,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2026 transitions. [2025-02-05 16:10:24,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 16:10:24,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:24,324 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:24,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:10:24,324 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:24,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:24,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1379362924, now seen corresponding path program 1 times [2025-02-05 16:10:24,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:24,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477962618] [2025-02-05 16:10:24,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:24,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:24,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 16:10:24,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 16:10:24,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:24,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:24,389 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 16:10:24,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:24,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477962618] [2025-02-05 16:10:24,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477962618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:24,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:24,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:24,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772897514] [2025-02-05 16:10:24,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:24,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:24,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:24,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:24,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:24,393 INFO L87 Difference]: Start difference. First operand 1538 states and 2026 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:24,592 INFO L93 Difference]: Finished difference Result 3606 states and 4774 transitions. [2025-02-05 16:10:24,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:24,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2025-02-05 16:10:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:24,602 INFO L225 Difference]: With dead ends: 3606 [2025-02-05 16:10:24,603 INFO L226 Difference]: Without dead ends: 2349 [2025-02-05 16:10:24,605 INFO L434 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-02-05 16:10:24,606 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 193 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:24,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1156 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:24,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2025-02-05 16:10:24,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2116. [2025-02-05 16:10:24,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2116 states, 1616 states have (on average 1.318069306930693) internal successors, (2130), 1638 states have internal predecessors, (2130), 325 states have call successors, (325), 174 states have call predecessors, (325), 174 states have return successors, (325), 303 states have call predecessors, (325), 325 states have call successors, (325) [2025-02-05 16:10:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 2780 transitions. [2025-02-05 16:10:24,759 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 2780 transitions. Word has length 99 [2025-02-05 16:10:24,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:24,759 INFO L471 AbstractCegarLoop]: Abstraction has 2116 states and 2780 transitions. [2025-02-05 16:10:24,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:24,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2780 transitions. [2025-02-05 16:10:24,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 16:10:24,760 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:24,760 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:24,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:10:24,760 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:24,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:24,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1146920336, now seen corresponding path program 1 times [2025-02-05 16:10:24,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:24,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445084073] [2025-02-05 16:10:24,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:24,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:24,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 16:10:24,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 16:10:24,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:24,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:24,802 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 16:10:24,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:24,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445084073] [2025-02-05 16:10:24,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445084073] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:24,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:24,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:10:24,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838244368] [2025-02-05 16:10:24,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:24,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:10:24,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:24,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:10:24,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:10:24,804 INFO L87 Difference]: Start difference. First operand 2116 states and 2780 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:24,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:24,965 INFO L93 Difference]: Finished difference Result 4004 states and 5287 transitions. [2025-02-05 16:10:24,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:10:24,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2025-02-05 16:10:24,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:24,975 INFO L225 Difference]: With dead ends: 4004 [2025-02-05 16:10:24,975 INFO L226 Difference]: Without dead ends: 2125 [2025-02-05 16:10:24,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:10:24,979 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 3 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:24,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 466 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:24,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2025-02-05 16:10:25,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2119. [2025-02-05 16:10:25,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2119 states, 1619 states have (on average 1.317479925880173) internal successors, (2133), 1641 states have internal predecessors, (2133), 325 states have call successors, (325), 174 states have call predecessors, (325), 174 states have return successors, (325), 303 states have call predecessors, (325), 325 states have call successors, (325) [2025-02-05 16:10:25,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 2119 states and 2783 transitions. [2025-02-05 16:10:25,161 INFO L78 Accepts]: Start accepts. Automaton has 2119 states and 2783 transitions. Word has length 99 [2025-02-05 16:10:25,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:25,161 INFO L471 AbstractCegarLoop]: Abstraction has 2119 states and 2783 transitions. [2025-02-05 16:10:25,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:25,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 2783 transitions. [2025-02-05 16:10:25,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 16:10:25,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:25,164 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:25,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:10:25,164 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:25,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:25,165 INFO L85 PathProgramCache]: Analyzing trace with hash 699005390, now seen corresponding path program 1 times [2025-02-05 16:10:25,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:25,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323144659] [2025-02-05 16:10:25,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:25,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:25,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 16:10:25,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 16:10:25,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:25,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:25,602 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 16:10:25,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:25,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323144659] [2025-02-05 16:10:25,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323144659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:25,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:25,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:10:25,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074041773] [2025-02-05 16:10:25,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:25,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:10:25,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:25,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:10:25,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:10:25,604 INFO L87 Difference]: Start difference. First operand 2119 states and 2783 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:25,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:25,996 INFO L93 Difference]: Finished difference Result 4395 states and 5769 transitions. [2025-02-05 16:10:25,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:10:25,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2025-02-05 16:10:25,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:26,007 INFO L225 Difference]: With dead ends: 4395 [2025-02-05 16:10:26,008 INFO L226 Difference]: Without dead ends: 2649 [2025-02-05 16:10:26,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:10:26,012 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 400 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:26,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1337 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:10:26,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2025-02-05 16:10:26,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 2126. [2025-02-05 16:10:26,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2126 states, 1615 states have (on average 1.3157894736842106) internal successors, (2125), 1638 states have internal predecessors, (2125), 332 states have call successors, (332), 178 states have call predecessors, (332), 178 states have return successors, (332), 309 states have call predecessors, (332), 332 states have call successors, (332) [2025-02-05 16:10:26,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 2789 transitions. [2025-02-05 16:10:26,149 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 2789 transitions. Word has length 99 [2025-02-05 16:10:26,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:26,149 INFO L471 AbstractCegarLoop]: Abstraction has 2126 states and 2789 transitions. [2025-02-05 16:10:26,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:26,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 2789 transitions. [2025-02-05 16:10:26,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 16:10:26,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:26,151 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:26,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:10:26,152 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:26,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:26,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2019590063, now seen corresponding path program 1 times [2025-02-05 16:10:26,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:26,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698004080] [2025-02-05 16:10:26,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:26,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:26,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 16:10:26,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 16:10:26,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:26,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 16:10:26,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:26,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698004080] [2025-02-05 16:10:26,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698004080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:26,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:26,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:26,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007713809] [2025-02-05 16:10:26,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:26,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:26,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:26,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:26,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:26,256 INFO L87 Difference]: Start difference. First operand 2126 states and 2789 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:26,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:26,483 INFO L93 Difference]: Finished difference Result 5315 states and 7008 transitions. [2025-02-05 16:10:26,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:26,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 101 [2025-02-05 16:10:26,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:26,506 INFO L225 Difference]: With dead ends: 5315 [2025-02-05 16:10:26,506 INFO L226 Difference]: Without dead ends: 3607 [2025-02-05 16:10:26,512 INFO L434 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-02-05 16:10:26,513 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 197 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:26,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1144 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:26,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2025-02-05 16:10:26,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 3376. [2025-02-05 16:10:26,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3376 states, 2530 states have (on average 1.3027667984189724) internal successors, (3296), 2567 states have internal predecessors, (3296), 551 states have call successors, (551), 294 states have call predecessors, (551), 294 states have return successors, (551), 514 states have call predecessors, (551), 551 states have call successors, (551) [2025-02-05 16:10:26,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3376 states to 3376 states and 4398 transitions. [2025-02-05 16:10:26,738 INFO L78 Accepts]: Start accepts. Automaton has 3376 states and 4398 transitions. Word has length 101 [2025-02-05 16:10:26,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:26,739 INFO L471 AbstractCegarLoop]: Abstraction has 3376 states and 4398 transitions. [2025-02-05 16:10:26,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:26,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3376 states and 4398 transitions. [2025-02-05 16:10:26,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 16:10:26,741 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:26,741 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:26,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:10:26,741 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:26,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:26,742 INFO L85 PathProgramCache]: Analyzing trace with hash -73239275, now seen corresponding path program 1 times [2025-02-05 16:10:26,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:26,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422165750] [2025-02-05 16:10:26,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:26,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:26,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 16:10:26,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 16:10:26,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:26,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:26,828 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 16:10:26,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:26,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422165750] [2025-02-05 16:10:26,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422165750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:26,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:26,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:26,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494548597] [2025-02-05 16:10:26,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:26,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:26,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:26,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:26,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:26,830 INFO L87 Difference]: Start difference. First operand 3376 states and 4398 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:27,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:27,077 INFO L93 Difference]: Finished difference Result 6404 states and 8364 transitions. [2025-02-05 16:10:27,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:27,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 102 [2025-02-05 16:10:27,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:27,096 INFO L225 Difference]: With dead ends: 6404 [2025-02-05 16:10:27,097 INFO L226 Difference]: Without dead ends: 3100 [2025-02-05 16:10:27,104 INFO L434 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-02-05 16:10:27,104 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 74 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:27,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 725 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:27,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2025-02-05 16:10:27,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2995. [2025-02-05 16:10:27,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2995 states, 2226 states have (on average 1.3068283917340522) internal successors, (2909), 2250 states have internal predecessors, (2909), 502 states have call successors, (502), 266 states have call predecessors, (502), 266 states have return successors, (502), 478 states have call predecessors, (502), 502 states have call successors, (502) [2025-02-05 16:10:27,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2995 states to 2995 states and 3913 transitions. [2025-02-05 16:10:27,396 INFO L78 Accepts]: Start accepts. Automaton has 2995 states and 3913 transitions. Word has length 102 [2025-02-05 16:10:27,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:27,396 INFO L471 AbstractCegarLoop]: Abstraction has 2995 states and 3913 transitions. [2025-02-05 16:10:27,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:27,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2995 states and 3913 transitions. [2025-02-05 16:10:27,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 16:10:27,398 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:27,398 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:27,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:10:27,398 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:27,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:27,399 INFO L85 PathProgramCache]: Analyzing trace with hash 451740973, now seen corresponding path program 1 times [2025-02-05 16:10:27,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:27,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377456416] [2025-02-05 16:10:27,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:27,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:27,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 16:10:27,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 16:10:27,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:27,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:27,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 16:10:27,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:27,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377456416] [2025-02-05 16:10:27,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377456416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:27,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:27,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:27,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981629619] [2025-02-05 16:10:27,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:27,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:27,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:27,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:27,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:27,505 INFO L87 Difference]: Start difference. First operand 2995 states and 3913 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:27,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:27,709 INFO L93 Difference]: Finished difference Result 5786 states and 7582 transitions. [2025-02-05 16:10:27,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:27,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 104 [2025-02-05 16:10:27,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:27,719 INFO L225 Difference]: With dead ends: 5786 [2025-02-05 16:10:27,719 INFO L226 Difference]: Without dead ends: 2910 [2025-02-05 16:10:27,723 INFO L434 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-02-05 16:10:27,723 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 60 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:27,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 717 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:27,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2025-02-05 16:10:27,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2755. [2025-02-05 16:10:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2755 states, 2045 states have (on average 1.3056234718826405) internal successors, (2670), 2064 states have internal predecessors, (2670), 464 states have call successors, (464), 245 states have call predecessors, (464), 245 states have return successors, (464), 445 states have call predecessors, (464), 464 states have call successors, (464) [2025-02-05 16:10:27,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2755 states and 3598 transitions. [2025-02-05 16:10:27,888 INFO L78 Accepts]: Start accepts. Automaton has 2755 states and 3598 transitions. Word has length 104 [2025-02-05 16:10:27,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:27,888 INFO L471 AbstractCegarLoop]: Abstraction has 2755 states and 3598 transitions. [2025-02-05 16:10:27,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:27,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 3598 transitions. [2025-02-05 16:10:27,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-05 16:10:27,892 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:27,892 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:27,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:10:27,894 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:27,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:27,895 INFO L85 PathProgramCache]: Analyzing trace with hash -106675050, now seen corresponding path program 1 times [2025-02-05 16:10:27,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:27,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564820019] [2025-02-05 16:10:27,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:27,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:27,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 16:10:27,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 16:10:27,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:27,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:28,108 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-05 16:10:28,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:28,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564820019] [2025-02-05 16:10:28,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564820019] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:10:28,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596884931] [2025-02-05 16:10:28,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:28,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:28,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:28,110 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:10:28,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:10:28,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 16:10:28,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 16:10:28,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:28,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:28,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-05 16:10:28,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:10:28,529 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:10:28,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:10:28,838 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-05 16:10:28,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596884931] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:10:28,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:10:28,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 22 [2025-02-05 16:10:28,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929501670] [2025-02-05 16:10:28,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:10:28,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 16:10:28,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:28,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 16:10:28,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:10:28,843 INFO L87 Difference]: Start difference. First operand 2755 states and 3598 transitions. Second operand has 22 states, 22 states have (on average 11.636363636363637) internal successors, (256), 20 states have internal predecessors, (256), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) [2025-02-05 16:10:32,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:32,589 INFO L93 Difference]: Finished difference Result 11336 states and 14741 transitions. [2025-02-05 16:10:32,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-02-05 16:10:32,589 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 11.636363636363637) internal successors, (256), 20 states have internal predecessors, (256), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) Word has length 153 [2025-02-05 16:10:32,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:32,617 INFO L225 Difference]: With dead ends: 11336 [2025-02-05 16:10:32,618 INFO L226 Difference]: Without dead ends: 8861 [2025-02-05 16:10:32,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1855 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1180, Invalid=5300, Unknown=0, NotChecked=0, Total=6480 [2025-02-05 16:10:32,627 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 5858 mSDsluCounter, 2898 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 2246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5858 SdHoareTripleChecker+Valid, 3236 SdHoareTripleChecker+Invalid, 3728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2246 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:32,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5858 Valid, 3236 Invalid, 3728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2246 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 16:10:32,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8861 states. [2025-02-05 16:10:33,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8861 to 7357. [2025-02-05 16:10:33,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7357 states, 5440 states have (on average 1.2987132352941178) internal successors, (7065), 5492 states have internal predecessors, (7065), 1239 states have call successors, (1239), 677 states have call predecessors, (1239), 677 states have return successors, (1239), 1187 states have call predecessors, (1239), 1239 states have call successors, (1239) [2025-02-05 16:10:33,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7357 states to 7357 states and 9543 transitions. [2025-02-05 16:10:33,352 INFO L78 Accepts]: Start accepts. Automaton has 7357 states and 9543 transitions. Word has length 153 [2025-02-05 16:10:33,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:33,357 INFO L471 AbstractCegarLoop]: Abstraction has 7357 states and 9543 transitions. [2025-02-05 16:10:33,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.636363636363637) internal successors, (256), 20 states have internal predecessors, (256), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) [2025-02-05 16:10:33,357 INFO L276 IsEmpty]: Start isEmpty. Operand 7357 states and 9543 transitions. [2025-02-05 16:10:33,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 16:10:33,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:33,372 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:33,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 16:10:33,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-05 16:10:33,572 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:33,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:33,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1127687556, now seen corresponding path program 1 times [2025-02-05 16:10:33,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:33,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765405377] [2025-02-05 16:10:33,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:33,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:33,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 16:10:33,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 16:10:33,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:33,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-02-05 16:10:33,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:33,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765405377] [2025-02-05 16:10:33,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765405377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:33,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:33,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:10:33,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479295995] [2025-02-05 16:10:33,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:33,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:10:33,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:33,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:10:33,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:10:33,700 INFO L87 Difference]: Start difference. First operand 7357 states and 9543 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 16:10:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:34,716 INFO L93 Difference]: Finished difference Result 21307 states and 27761 transitions. [2025-02-05 16:10:34,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:10:34,717 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 156 [2025-02-05 16:10:34,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:34,753 INFO L225 Difference]: With dead ends: 21307 [2025-02-05 16:10:34,753 INFO L226 Difference]: Without dead ends: 14448 [2025-02-05 16:10:34,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:10:34,763 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 215 mSDsluCounter, 1705 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 2094 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:34,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 2094 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:10:34,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14448 states. [2025-02-05 16:10:36,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14448 to 12234. [2025-02-05 16:10:36,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12234 states, 8953 states have (on average 1.2957667820842176) internal successors, (11601), 9043 states have internal predecessors, (11601), 2141 states have call successors, (2141), 1139 states have call predecessors, (2141), 1139 states have return successors, (2141), 2051 states have call predecessors, (2141), 2141 states have call successors, (2141) [2025-02-05 16:10:36,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12234 states to 12234 states and 15883 transitions. [2025-02-05 16:10:36,127 INFO L78 Accepts]: Start accepts. Automaton has 12234 states and 15883 transitions. Word has length 156 [2025-02-05 16:10:36,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:36,131 INFO L471 AbstractCegarLoop]: Abstraction has 12234 states and 15883 transitions. [2025-02-05 16:10:36,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 16:10:36,131 INFO L276 IsEmpty]: Start isEmpty. Operand 12234 states and 15883 transitions. [2025-02-05 16:10:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 16:10:36,152 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:36,153 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:36,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:10:36,153 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:36,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:36,154 INFO L85 PathProgramCache]: Analyzing trace with hash 765909883, now seen corresponding path program 1 times [2025-02-05 16:10:36,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:36,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710901626] [2025-02-05 16:10:36,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:36,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:36,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 16:10:36,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 16:10:36,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:36,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:36,882 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 16:10:36,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:36,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710901626] [2025-02-05 16:10:36,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710901626] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:10:36,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983258660] [2025-02-05 16:10:36,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:36,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:36,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:36,886 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:10:36,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:10:36,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 16:10:37,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 16:10:37,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:37,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:37,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 16:10:37,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:10:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-05 16:10:37,175 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:10:37,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983258660] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:37,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:10:37,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-02-05 16:10:37,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103984554] [2025-02-05 16:10:37,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:37,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:10:37,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:37,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:10:37,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:10:37,178 INFO L87 Difference]: Start difference. First operand 12234 states and 15883 transitions. Second operand has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 16:10:37,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:37,737 INFO L93 Difference]: Finished difference Result 21046 states and 27383 transitions. [2025-02-05 16:10:37,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:10:37,738 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 156 [2025-02-05 16:10:37,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:37,770 INFO L225 Difference]: With dead ends: 21046 [2025-02-05 16:10:37,770 INFO L226 Difference]: Without dead ends: 8950 [2025-02-05 16:10:37,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:10:37,790 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 3 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:37,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1430 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:37,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8950 states. [2025-02-05 16:10:38,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8950 to 7447. [2025-02-05 16:10:38,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7447 states, 5476 states have (on average 1.2983929875821767) internal successors, (7110), 5525 states have internal predecessors, (7110), 1290 states have call successors, (1290), 680 states have call predecessors, (1290), 680 states have return successors, (1290), 1241 states have call predecessors, (1290), 1290 states have call successors, (1290) [2025-02-05 16:10:38,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7447 states to 7447 states and 9690 transitions. [2025-02-05 16:10:38,347 INFO L78 Accepts]: Start accepts. Automaton has 7447 states and 9690 transitions. Word has length 156 [2025-02-05 16:10:38,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:38,348 INFO L471 AbstractCegarLoop]: Abstraction has 7447 states and 9690 transitions. [2025-02-05 16:10:38,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 16:10:38,349 INFO L276 IsEmpty]: Start isEmpty. Operand 7447 states and 9690 transitions. [2025-02-05 16:10:38,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 16:10:38,358 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:38,358 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:38,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 16:10:38,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:38,563 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:38,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:38,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1892171577, now seen corresponding path program 1 times [2025-02-05 16:10:38,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:38,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224562298] [2025-02-05 16:10:38,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:38,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:38,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 16:10:38,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 16:10:38,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:38,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:39,023 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 16:10:39,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:39,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224562298] [2025-02-05 16:10:39,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224562298] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:10:39,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492670366] [2025-02-05 16:10:39,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:39,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:39,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:39,026 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:10:39,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 16:10:39,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 16:10:39,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 16:10:39,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:39,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:39,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-05 16:10:39,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:10:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 62 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:10:39,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:10:40,349 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-05 16:10:40,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492670366] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:10:40,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:10:40,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 10] total 28 [2025-02-05 16:10:40,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705122776] [2025-02-05 16:10:40,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:10:40,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 16:10:40,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:40,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 16:10:40,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2025-02-05 16:10:40,351 INFO L87 Difference]: Start difference. First operand 7447 states and 9690 transitions. Second operand has 28 states, 27 states have (on average 8.925925925925926) internal successors, (241), 26 states have internal predecessors, (241), 8 states have call successors, (36), 5 states have call predecessors, (36), 7 states have return successors, (35), 9 states have call predecessors, (35), 8 states have call successors, (35) [2025-02-05 16:10:44,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:44,144 INFO L93 Difference]: Finished difference Result 21748 states and 28209 transitions. [2025-02-05 16:10:44,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-02-05 16:10:44,144 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 8.925925925925926) internal successors, (241), 26 states have internal predecessors, (241), 8 states have call successors, (36), 5 states have call predecessors, (36), 7 states have return successors, (35), 9 states have call predecessors, (35), 8 states have call successors, (35) Word has length 157 [2025-02-05 16:10:44,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:44,201 INFO L225 Difference]: With dead ends: 21748 [2025-02-05 16:10:44,201 INFO L226 Difference]: Without dead ends: 14579 [2025-02-05 16:10:44,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=583, Invalid=3449, Unknown=0, NotChecked=0, Total=4032 [2025-02-05 16:10:44,219 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 1391 mSDsluCounter, 6659 mSDsCounter, 0 mSdLazyCounter, 3024 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1395 SdHoareTripleChecker+Valid, 7234 SdHoareTripleChecker+Invalid, 3495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 3024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:44,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1395 Valid, 7234 Invalid, 3495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 3024 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 16:10:44,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14579 states. [2025-02-05 16:10:45,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14579 to 9558. [2025-02-05 16:10:45,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9558 states, 7003 states have (on average 1.297158360702556) internal successors, (9084), 7072 states have internal predecessors, (9084), 1662 states have call successors, (1662), 892 states have call predecessors, (1662), 892 states have return successors, (1662), 1593 states have call predecessors, (1662), 1662 states have call successors, (1662) [2025-02-05 16:10:45,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9558 states to 9558 states and 12408 transitions. [2025-02-05 16:10:45,075 INFO L78 Accepts]: Start accepts. Automaton has 9558 states and 12408 transitions. Word has length 157 [2025-02-05 16:10:45,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:45,076 INFO L471 AbstractCegarLoop]: Abstraction has 9558 states and 12408 transitions. [2025-02-05 16:10:45,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 8.925925925925926) internal successors, (241), 26 states have internal predecessors, (241), 8 states have call successors, (36), 5 states have call predecessors, (36), 7 states have return successors, (35), 9 states have call predecessors, (35), 8 states have call successors, (35) [2025-02-05 16:10:45,076 INFO L276 IsEmpty]: Start isEmpty. Operand 9558 states and 12408 transitions. [2025-02-05 16:10:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 16:10:45,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:45,084 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:45,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 16:10:45,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:45,288 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:45,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:45,288 INFO L85 PathProgramCache]: Analyzing trace with hash -334587595, now seen corresponding path program 1 times [2025-02-05 16:10:45,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:45,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904884325] [2025-02-05 16:10:45,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:45,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:45,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 16:10:45,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 16:10:45,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:45,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:46,543 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-05 16:10:46,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:46,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904884325] [2025-02-05 16:10:46,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904884325] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:10:46,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174459191] [2025-02-05 16:10:46,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:46,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:46,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:46,546 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:10:46,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 16:10:46,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 16:10:46,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 16:10:46,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:46,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:46,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 16:10:46,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:10:46,910 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 47 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-05 16:10:46,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:10:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-05 16:10:47,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174459191] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:10:47,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:10:47,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2025-02-05 16:10:47,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756752406] [2025-02-05 16:10:47,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:10:47,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 16:10:47,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:47,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 16:10:47,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:10:47,024 INFO L87 Difference]: Start difference. First operand 9558 states and 12408 transitions. Second operand has 18 states, 18 states have (on average 11.38888888888889) internal successors, (205), 17 states have internal predecessors, (205), 7 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 8 states have call predecessors, (38), 7 states have call successors, (38) [2025-02-05 16:10:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:49,829 INFO L93 Difference]: Finished difference Result 20314 states and 26301 transitions. [2025-02-05 16:10:49,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-02-05 16:10:49,829 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 11.38888888888889) internal successors, (205), 17 states have internal predecessors, (205), 7 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 8 states have call predecessors, (38), 7 states have call successors, (38) Word has length 166 [2025-02-05 16:10:49,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:49,865 INFO L225 Difference]: With dead ends: 20314 [2025-02-05 16:10:49,865 INFO L226 Difference]: Without dead ends: 10970 [2025-02-05 16:10:49,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=614, Invalid=2692, Unknown=0, NotChecked=0, Total=3306 [2025-02-05 16:10:49,878 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 2140 mSDsluCounter, 2213 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 724 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2140 SdHoareTripleChecker+Valid, 2444 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 724 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:49,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2140 Valid, 2444 Invalid, 1610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [724 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:10:49,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10970 states. [2025-02-05 16:10:51,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10970 to 10500. [2025-02-05 16:10:51,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10500 states, 7689 states have (on average 1.2953570035115098) internal successors, (9960), 7766 states have internal predecessors, (9960), 1826 states have call successors, (1826), 984 states have call predecessors, (1826), 984 states have return successors, (1826), 1749 states have call predecessors, (1826), 1826 states have call successors, (1826) [2025-02-05 16:10:51,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10500 states to 10500 states and 13612 transitions. [2025-02-05 16:10:51,463 INFO L78 Accepts]: Start accepts. Automaton has 10500 states and 13612 transitions. Word has length 166 [2025-02-05 16:10:51,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:51,467 INFO L471 AbstractCegarLoop]: Abstraction has 10500 states and 13612 transitions. [2025-02-05 16:10:51,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.38888888888889) internal successors, (205), 17 states have internal predecessors, (205), 7 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 8 states have call predecessors, (38), 7 states have call successors, (38) [2025-02-05 16:10:51,467 INFO L276 IsEmpty]: Start isEmpty. Operand 10500 states and 13612 transitions. [2025-02-05 16:10:51,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 16:10:51,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:51,515 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:51,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 16:10:51,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:51,716 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:51,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:51,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1136638543, now seen corresponding path program 1 times [2025-02-05 16:10:51,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:51,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093198078] [2025-02-05 16:10:51,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:51,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:51,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 16:10:52,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 16:10:52,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:52,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:52,989 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-02-05 16:10:52,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:52,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093198078] [2025-02-05 16:10:52,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093198078] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:10:52,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731376035] [2025-02-05 16:10:52,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:52,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:52,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:53,000 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:10:53,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 16:10:53,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 16:10:53,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 16:10:53,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:53,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:53,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-05 16:10:53,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:10:53,652 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 64 proven. 22 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 16:10:53,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:10:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-02-05 16:10:54,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731376035] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:10:54,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:10:54,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 18 [2025-02-05 16:10:54,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397541491] [2025-02-05 16:10:54,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:10:54,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 16:10:54,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:54,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 16:10:54,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:10:54,035 INFO L87 Difference]: Start difference. First operand 10500 states and 13612 transitions. Second operand has 18 states, 18 states have (on average 13.11111111111111) internal successors, (236), 18 states have internal predecessors, (236), 7 states have call successors, (34), 5 states have call predecessors, (34), 6 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2025-02-05 16:10:57,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:57,320 INFO L93 Difference]: Finished difference Result 25875 states and 33666 transitions. [2025-02-05 16:10:57,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-05 16:10:57,320 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 13.11111111111111) internal successors, (236), 18 states have internal predecessors, (236), 7 states have call successors, (34), 5 states have call predecessors, (34), 6 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) Word has length 175 [2025-02-05 16:10:57,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:57,366 INFO L225 Difference]: With dead ends: 25875 [2025-02-05 16:10:57,367 INFO L226 Difference]: Without dead ends: 15694 [2025-02-05 16:10:57,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 351 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=431, Invalid=1731, Unknown=0, NotChecked=0, Total=2162 [2025-02-05 16:10:57,383 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 1236 mSDsluCounter, 2818 mSDsCounter, 0 mSdLazyCounter, 1923 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 3213 SdHoareTripleChecker+Invalid, 2260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 1923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:57,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 3213 Invalid, 2260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 1923 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:10:57,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15694 states. [2025-02-05 16:10:59,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15694 to 15495. [2025-02-05 16:10:59,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15495 states, 11427 states have (on average 1.2966657915463375) internal successors, (14817), 11536 states have internal predecessors, (14817), 2626 states have call successors, (2626), 1441 states have call predecessors, (2626), 1441 states have return successors, (2626), 2517 states have call predecessors, (2626), 2626 states have call successors, (2626) [2025-02-05 16:10:59,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15495 states to 15495 states and 20069 transitions. [2025-02-05 16:10:59,607 INFO L78 Accepts]: Start accepts. Automaton has 15495 states and 20069 transitions. Word has length 175 [2025-02-05 16:10:59,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:59,607 INFO L471 AbstractCegarLoop]: Abstraction has 15495 states and 20069 transitions. [2025-02-05 16:10:59,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 13.11111111111111) internal successors, (236), 18 states have internal predecessors, (236), 7 states have call successors, (34), 5 states have call predecessors, (34), 6 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2025-02-05 16:10:59,607 INFO L276 IsEmpty]: Start isEmpty. Operand 15495 states and 20069 transitions. [2025-02-05 16:10:59,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 16:10:59,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:59,616 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:59,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 16:10:59,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-02-05 16:10:59,818 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:59,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:59,819 INFO L85 PathProgramCache]: Analyzing trace with hash -787468275, now seen corresponding path program 1 times [2025-02-05 16:10:59,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:59,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643255602] [2025-02-05 16:10:59,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:59,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:59,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 16:10:59,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 16:10:59,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:59,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:00,405 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-02-05 16:11:00,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:00,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643255602] [2025-02-05 16:11:00,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643255602] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:11:00,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684131961] [2025-02-05 16:11:00,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:00,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:11:00,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:11:00,408 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:11:00,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 16:11:00,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 16:11:00,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 16:11:00,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:00,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:00,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-05 16:11:00,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:11:00,812 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 76 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 16:11:00,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:11:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-05 16:11:01,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684131961] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:11:01,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:11:01,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 10] total 26 [2025-02-05 16:11:01,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024840176] [2025-02-05 16:11:01,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:11:01,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 16:11:01,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:01,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 16:11:01,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2025-02-05 16:11:01,041 INFO L87 Difference]: Start difference. First operand 15495 states and 20069 transitions. Second operand has 26 states, 26 states have (on average 8.846153846153847) internal successors, (230), 22 states have internal predecessors, (230), 7 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (40), 11 states have call predecessors, (40), 7 states have call successors, (40) [2025-02-05 16:11:08,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:08,191 INFO L93 Difference]: Finished difference Result 44971 states and 59735 transitions. [2025-02-05 16:11:08,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-02-05 16:11:08,192 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.846153846153847) internal successors, (230), 22 states have internal predecessors, (230), 7 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (40), 11 states have call predecessors, (40), 7 states have call successors, (40) Word has length 175 [2025-02-05 16:11:08,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:08,273 INFO L225 Difference]: With dead ends: 44971 [2025-02-05 16:11:08,273 INFO L226 Difference]: Without dead ends: 29464 [2025-02-05 16:11:08,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1403 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=863, Invalid=5299, Unknown=0, NotChecked=0, Total=6162 [2025-02-05 16:11:08,299 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 1498 mSDsluCounter, 8824 mSDsCounter, 0 mSdLazyCounter, 3303 mSolverCounterSat, 623 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 9487 SdHoareTripleChecker+Invalid, 3926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 623 IncrementalHoareTripleChecker+Valid, 3303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:08,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 9487 Invalid, 3926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [623 Valid, 3303 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 16:11:08,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29464 states. [2025-02-05 16:11:10,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29464 to 17783. [2025-02-05 16:11:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17783 states, 13067 states have (on average 1.294099640315298) internal successors, (16910), 13200 states have internal predecessors, (16910), 3042 states have call successors, (3042), 1673 states have call predecessors, (3042), 1673 states have return successors, (3042), 2909 states have call predecessors, (3042), 3042 states have call successors, (3042) [2025-02-05 16:11:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17783 states to 17783 states and 22994 transitions. [2025-02-05 16:11:10,932 INFO L78 Accepts]: Start accepts. Automaton has 17783 states and 22994 transitions. Word has length 175 [2025-02-05 16:11:10,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:10,932 INFO L471 AbstractCegarLoop]: Abstraction has 17783 states and 22994 transitions. [2025-02-05 16:11:10,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.846153846153847) internal successors, (230), 22 states have internal predecessors, (230), 7 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (40), 11 states have call predecessors, (40), 7 states have call successors, (40) [2025-02-05 16:11:10,932 INFO L276 IsEmpty]: Start isEmpty. Operand 17783 states and 22994 transitions. [2025-02-05 16:11:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-05 16:11:10,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:10,948 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:11:10,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 16:11:11,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:11:11,149 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:11,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:11,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1890313517, now seen corresponding path program 1 times [2025-02-05 16:11:11,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:11,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198068988] [2025-02-05 16:11:11,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:11,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:11,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-05 16:11:11,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 16:11:11,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:11,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:11,955 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-05 16:11:11,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:11,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198068988] [2025-02-05 16:11:11,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198068988] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:11:11,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920300882] [2025-02-05 16:11:11,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:11,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:11:11,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:11:11,962 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:11:11,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 16:11:12,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-05 16:11:12,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 16:11:12,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:12,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:12,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-05 16:11:12,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:11:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 81 proven. 13 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 16:11:12,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:11:13,831 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-05 16:11:13,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920300882] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:11:13,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:11:13,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 28 [2025-02-05 16:11:13,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298327831] [2025-02-05 16:11:13,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:11:13,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 16:11:13,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:13,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 16:11:13,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2025-02-05 16:11:13,834 INFO L87 Difference]: Start difference. First operand 17783 states and 22994 transitions. Second operand has 28 states, 28 states have (on average 10.321428571428571) internal successors, (289), 28 states have internal predecessors, (289), 10 states have call successors, (47), 5 states have call predecessors, (47), 6 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) [2025-02-05 16:11:18,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:18,982 INFO L93 Difference]: Finished difference Result 35519 states and 46041 transitions. [2025-02-05 16:11:18,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-02-05 16:11:18,983 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 10.321428571428571) internal successors, (289), 28 states have internal predecessors, (289), 10 states have call successors, (47), 5 states have call predecessors, (47), 6 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) Word has length 183 [2025-02-05 16:11:18,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:19,086 INFO L225 Difference]: With dead ends: 35519 [2025-02-05 16:11:19,086 INFO L226 Difference]: Without dead ends: 18055 [2025-02-05 16:11:19,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=956, Invalid=3874, Unknown=0, NotChecked=0, Total=4830 [2025-02-05 16:11:19,110 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 3463 mSDsluCounter, 2071 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 1250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3463 SdHoareTripleChecker+Valid, 2408 SdHoareTripleChecker+Invalid, 2669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1250 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:19,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3463 Valid, 2408 Invalid, 2669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1250 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 16:11:19,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18055 states. [2025-02-05 16:11:21,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18055 to 17867. [2025-02-05 16:11:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17867 states, 13143 states have (on average 1.2927794263105836) internal successors, (16991), 13276 states have internal predecessors, (16991), 3046 states have call successors, (3046), 1677 states have call predecessors, (3046), 1677 states have return successors, (3046), 2913 states have call predecessors, (3046), 3046 states have call successors, (3046) [2025-02-05 16:11:21,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17867 states to 17867 states and 23083 transitions. [2025-02-05 16:11:21,620 INFO L78 Accepts]: Start accepts. Automaton has 17867 states and 23083 transitions. Word has length 183 [2025-02-05 16:11:21,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:21,620 INFO L471 AbstractCegarLoop]: Abstraction has 17867 states and 23083 transitions. [2025-02-05 16:11:21,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.321428571428571) internal successors, (289), 28 states have internal predecessors, (289), 10 states have call successors, (47), 5 states have call predecessors, (47), 6 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) [2025-02-05 16:11:21,621 INFO L276 IsEmpty]: Start isEmpty. Operand 17867 states and 23083 transitions. [2025-02-05 16:11:21,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-05 16:11:21,629 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:21,629 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:11:21,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 16:11:21,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:11:21,833 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:21,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:21,833 INFO L85 PathProgramCache]: Analyzing trace with hash -526494204, now seen corresponding path program 1 times [2025-02-05 16:11:21,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:21,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811830448] [2025-02-05 16:11:21,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:21,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:21,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-05 16:11:21,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 16:11:21,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:21,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:22,260 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-05 16:11:22,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:22,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811830448] [2025-02-05 16:11:22,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811830448] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:11:22,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141909849] [2025-02-05 16:11:22,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:22,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:11:22,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:11:22,264 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:11:22,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 16:11:22,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-05 16:11:22,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 16:11:22,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:22,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:22,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-05 16:11:22,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:11:22,806 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 77 proven. 13 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 16:11:22,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:11:23,272 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-05 16:11:23,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141909849] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:11:23,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:11:23,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 22 [2025-02-05 16:11:23,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490892369] [2025-02-05 16:11:23,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:11:23,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 16:11:23,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:23,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 16:11:23,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:11:23,275 INFO L87 Difference]: Start difference. First operand 17867 states and 23083 transitions. Second operand has 22 states, 22 states have (on average 11.590909090909092) internal successors, (255), 21 states have internal predecessors, (255), 8 states have call successors, (36), 5 states have call predecessors, (36), 6 states have return successors, (36), 9 states have call predecessors, (36), 8 states have call successors, (36) [2025-02-05 16:11:27,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:27,203 INFO L93 Difference]: Finished difference Result 38745 states and 50199 transitions. [2025-02-05 16:11:27,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 16:11:27,203 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 11.590909090909092) internal successors, (255), 21 states have internal predecessors, (255), 8 states have call successors, (36), 5 states have call predecessors, (36), 6 states have return successors, (36), 9 states have call predecessors, (36), 8 states have call successors, (36) Word has length 183 [2025-02-05 16:11:27,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:27,353 INFO L225 Difference]: With dead ends: 38745 [2025-02-05 16:11:27,354 INFO L226 Difference]: Without dead ends: 21197 [2025-02-05 16:11:27,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=1047, Unknown=0, NotChecked=0, Total=1332 [2025-02-05 16:11:27,416 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 1903 mSDsluCounter, 3004 mSDsCounter, 0 mSdLazyCounter, 1712 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1903 SdHoareTripleChecker+Valid, 3391 SdHoareTripleChecker+Invalid, 2260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:27,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1903 Valid, 3391 Invalid, 2260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1712 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:11:27,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21197 states.