./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i --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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i -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 7ff62df6f9603281bf0e236ab8865fc937b3dc90e8a1704cf1768013825b0923 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:57:06,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:57:06,421 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 23:57:06,425 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:57:06,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:57:06,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:57:06,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:57:06,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:57:06,438 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:57:06,438 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:57:06,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:57:06,438 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:57:06,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:57:06,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:57:06,439 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:57:06,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:57:06,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:57:06,439 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:57:06,439 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 23:57:06,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:57:06,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:57:06,440 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:57:06,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:57:06,440 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:57:06,440 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:57:06,440 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:57:06,440 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:57:06,440 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:57:06,440 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:57:06,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:57:06,440 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:57:06,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:57:06,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:57:06,440 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:57:06,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:57:06,441 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:57:06,441 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:57:06,441 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 23:57:06,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 23:57:06,441 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:57:06,441 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:57:06,441 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:57:06,441 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:57:06,441 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 -> 7ff62df6f9603281bf0e236ab8865fc937b3dc90e8a1704cf1768013825b0923 [2025-02-05 23:57:06,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:57:06,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:57:06,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:57:06,674 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:57:06,675 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:57:06,675 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i [2025-02-05 23:57:07,809 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/329176349/69fcd4c7e2d54699b5c34d2cdeee3ef1/FLAG2f5c26a36 [2025-02-05 23:57:08,076 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:57:08,077 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i [2025-02-05 23:57:08,083 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/329176349/69fcd4c7e2d54699b5c34d2cdeee3ef1/FLAG2f5c26a36 [2025-02-05 23:57:08,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/329176349/69fcd4c7e2d54699b5c34d2cdeee3ef1 [2025-02-05 23:57:08,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:57:08,381 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:57:08,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:57:08,382 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:57:08,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:57:08,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:57:08" (1/1) ... [2025-02-05 23:57:08,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef3eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:08, skipping insertion in model container [2025-02-05 23:57:08,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:57:08" (1/1) ... [2025-02-05 23:57:08,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:57:08,504 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i[918,931] [2025-02-05 23:57:08,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:57:08,595 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:57:08,604 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i[918,931] [2025-02-05 23:57:08,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:57:08,661 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:57:08,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:08 WrapperNode [2025-02-05 23:57:08,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:57:08,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:57:08,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:57:08,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:57:08,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:08" (1/1) ... [2025-02-05 23:57:08,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:08" (1/1) ... [2025-02-05 23:57:08,722 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 271 [2025-02-05 23:57:08,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:57:08,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:57:08,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:57:08,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:57:08,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:08" (1/1) ... [2025-02-05 23:57:08,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:08" (1/1) ... [2025-02-05 23:57:08,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:08" (1/1) ... [2025-02-05 23:57:08,746 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 23:57:08,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:08" (1/1) ... [2025-02-05 23:57:08,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:08" (1/1) ... [2025-02-05 23:57:08,752 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:08" (1/1) ... [2025-02-05 23:57:08,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:08" (1/1) ... [2025-02-05 23:57:08,754 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:08" (1/1) ... [2025-02-05 23:57:08,755 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:08" (1/1) ... [2025-02-05 23:57:08,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:57:08,758 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:57:08,758 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:57:08,758 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:57:08,758 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:08" (1/1) ... [2025-02-05 23:57:08,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:57:08,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:57:08,786 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 23:57:08,790 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 23:57:08,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:57:08,802 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:57:08,802 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:57:08,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 23:57:08,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:57:08,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:57:08,867 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:57:08,868 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:57:09,271 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L198: havoc property_#t~bitwise27#1;havoc property_#t~short28#1; [2025-02-05 23:57:09,311 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-05 23:57:09,311 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:57:09,325 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:57:09,325 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-05 23:57:09,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:57:09 BoogieIcfgContainer [2025-02-05 23:57:09,326 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:57:09,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:57:09,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:57:09,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:57:09,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:57:08" (1/3) ... [2025-02-05 23:57:09,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b004b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:57:09, skipping insertion in model container [2025-02-05 23:57:09,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:08" (2/3) ... [2025-02-05 23:57:09,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b004b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:57:09, skipping insertion in model container [2025-02-05 23:57:09,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:57:09" (3/3) ... [2025-02-05 23:57:09,332 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i [2025-02-05 23:57:09,342 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:57:09,344 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:57:09,391 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:57:09,400 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;@3af0484e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:57:09,400 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:57:09,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 86 states have internal predecessors, (128), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 23:57:09,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-05 23:57:09,413 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:57:09,414 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:09,414 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:57:09,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:57:09,419 INFO L85 PathProgramCache]: Analyzing trace with hash 860248976, now seen corresponding path program 1 times [2025-02-05 23:57:09,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:57:09,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697418484] [2025-02-05 23:57:09,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:57:09,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:57:09,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-05 23:57:09,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-05 23:57:09,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:57:09,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:57:09,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-02-05 23:57:09,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:57:09,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697418484] [2025-02-05 23:57:09,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697418484] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:57:09,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005345427] [2025-02-05 23:57:09,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:57:09,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:57:09,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:57:09,731 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 23:57:09,732 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 23:57:09,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-05 23:57:09,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-05 23:57:09,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:57:09,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:57:09,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:57:09,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:57:09,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-02-05 23:57:09,898 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:57:09,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005345427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:57:09,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 23:57:09,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 23:57:09,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298936270] [2025-02-05 23:57:09,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:57:09,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:57:09,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:57:09,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:57:09,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:57:09,927 INFO L87 Difference]: Start difference. First operand has 122 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 86 states have internal predecessors, (128), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 23:57:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:57:09,958 INFO L93 Difference]: Finished difference Result 238 states and 421 transitions. [2025-02-05 23:57:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:57:09,960 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 221 [2025-02-05 23:57:09,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:57:09,966 INFO L225 Difference]: With dead ends: 238 [2025-02-05 23:57:09,967 INFO L226 Difference]: Without dead ends: 119 [2025-02-05 23:57:09,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 222 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 23:57:09,974 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:57:09,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:57:09,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-05 23:57:10,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-02-05 23:57:10,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 83 states have internal predecessors, (122), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 23:57:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 190 transitions. [2025-02-05 23:57:10,008 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 190 transitions. Word has length 221 [2025-02-05 23:57:10,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:57:10,008 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 190 transitions. [2025-02-05 23:57:10,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 23:57:10,008 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 190 transitions. [2025-02-05 23:57:10,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-05 23:57:10,014 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:57:10,014 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:10,026 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 23:57:10,215 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,SelfDestructingSolverStorable0 [2025-02-05 23:57:10,216 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:57:10,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:57:10,217 INFO L85 PathProgramCache]: Analyzing trace with hash -851510476, now seen corresponding path program 1 times [2025-02-05 23:57:10,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:57:10,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304185118] [2025-02-05 23:57:10,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:57:10,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:57:10,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-05 23:57:10,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-05 23:57:10,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:57:10,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:57:10,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:57:10,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:57:10,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304185118] [2025-02-05 23:57:10,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304185118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:57:10,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:57:10,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:57:10,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303704103] [2025-02-05 23:57:10,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:57:10,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:57:10,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:57:10,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:57:10,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:57:10,578 INFO L87 Difference]: Start difference. First operand 119 states and 190 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:10,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:57:10,718 INFO L93 Difference]: Finished difference Result 352 states and 566 transitions. [2025-02-05 23:57:10,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:57:10,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 221 [2025-02-05 23:57:10,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:57:10,721 INFO L225 Difference]: With dead ends: 352 [2025-02-05 23:57:10,721 INFO L226 Difference]: Without dead ends: 236 [2025-02-05 23:57:10,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:57:10,722 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 127 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:57:10,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 458 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:57:10,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-02-05 23:57:10,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 233. [2025-02-05 23:57:10,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 162 states have (on average 1.4753086419753085) internal successors, (239), 162 states have internal predecessors, (239), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 23:57:10,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 375 transitions. [2025-02-05 23:57:10,761 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 375 transitions. Word has length 221 [2025-02-05 23:57:10,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:57:10,762 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 375 transitions. [2025-02-05 23:57:10,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:10,762 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 375 transitions. [2025-02-05 23:57:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-02-05 23:57:10,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:57:10,768 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:10,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 23:57:10,768 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:57:10,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:57:10,769 INFO L85 PathProgramCache]: Analyzing trace with hash -109221483, now seen corresponding path program 1 times [2025-02-05 23:57:10,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:57:10,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74361969] [2025-02-05 23:57:10,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:57:10,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:57:10,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-05 23:57:10,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-05 23:57:10,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:57:10,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:57:10,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:57:10,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:57:10,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74361969] [2025-02-05 23:57:10,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74361969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:57:10,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:57:10,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:57:10,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866251639] [2025-02-05 23:57:10,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:57:10,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:57:11,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:57:11,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:57:11,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:57:11,001 INFO L87 Difference]: Start difference. First operand 233 states and 375 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:11,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:57:11,147 INFO L93 Difference]: Finished difference Result 466 states and 750 transitions. [2025-02-05 23:57:11,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:57:11,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 222 [2025-02-05 23:57:11,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:57:11,150 INFO L225 Difference]: With dead ends: 466 [2025-02-05 23:57:11,152 INFO L226 Difference]: Without dead ends: 236 [2025-02-05 23:57:11,152 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 23:57:11,153 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 125 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:57:11,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 459 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:57:11,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-02-05 23:57:11,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 232. [2025-02-05 23:57:11,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 161 states have (on average 1.4720496894409938) internal successors, (237), 161 states have internal predecessors, (237), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 23:57:11,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 373 transitions. [2025-02-05 23:57:11,205 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 373 transitions. Word has length 222 [2025-02-05 23:57:11,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:57:11,206 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 373 transitions. [2025-02-05 23:57:11,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:11,207 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 373 transitions. [2025-02-05 23:57:11,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-02-05 23:57:11,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:57:11,209 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:11,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 23:57:11,210 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:57:11,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:57:11,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1229298669, now seen corresponding path program 1 times [2025-02-05 23:57:11,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:57:11,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876639902] [2025-02-05 23:57:11,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:57:11,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:57:11,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-05 23:57:11,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-05 23:57:11,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:57:11,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:57:11,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:57:11,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:57:11,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876639902] [2025-02-05 23:57:11,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876639902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:57:11,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:57:11,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:57:11,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483314153] [2025-02-05 23:57:11,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:57:11,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:57:11,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:57:11,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:57:11,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:57:11,422 INFO L87 Difference]: Start difference. First operand 232 states and 373 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:11,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:57:11,511 INFO L93 Difference]: Finished difference Result 690 states and 1113 transitions. [2025-02-05 23:57:11,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:57:11,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 222 [2025-02-05 23:57:11,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:57:11,515 INFO L225 Difference]: With dead ends: 690 [2025-02-05 23:57:11,515 INFO L226 Difference]: Without dead ends: 461 [2025-02-05 23:57:11,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 23:57:11,518 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 108 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:57:11,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 356 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:57:11,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-02-05 23:57:11,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 459. [2025-02-05 23:57:11,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 318 states have (on average 1.4528301886792452) internal successors, (462), 318 states have internal predecessors, (462), 136 states have call successors, (136), 4 states have call predecessors, (136), 4 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2025-02-05 23:57:11,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 734 transitions. [2025-02-05 23:57:11,585 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 734 transitions. Word has length 222 [2025-02-05 23:57:11,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:57:11,585 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 734 transitions. [2025-02-05 23:57:11,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:11,586 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 734 transitions. [2025-02-05 23:57:11,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-02-05 23:57:11,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:57:11,588 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:11,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 23:57:11,588 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:57:11,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:57:11,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1033412344, now seen corresponding path program 1 times [2025-02-05 23:57:11,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:57:11,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341764342] [2025-02-05 23:57:11,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:57:11,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:57:11,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-05 23:57:11,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-05 23:57:11,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:57:11,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:57:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:57:11,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:57:11,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341764342] [2025-02-05 23:57:11,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341764342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:57:11,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:57:11,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:57:11,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246336435] [2025-02-05 23:57:11,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:57:11,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:57:11,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:57:11,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:57:11,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:57:11,695 INFO L87 Difference]: Start difference. First operand 459 states and 734 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:57:11,752 INFO L93 Difference]: Finished difference Result 1041 states and 1654 transitions. [2025-02-05 23:57:11,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:57:11,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 223 [2025-02-05 23:57:11,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:57:11,759 INFO L225 Difference]: With dead ends: 1041 [2025-02-05 23:57:11,759 INFO L226 Difference]: Without dead ends: 585 [2025-02-05 23:57:11,760 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 23:57:11,760 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 43 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:57:11,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 382 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:57:11,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-02-05 23:57:11,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 495. [2025-02-05 23:57:11,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 354 states have (on average 1.4519774011299436) internal successors, (514), 354 states have internal predecessors, (514), 136 states have call successors, (136), 4 states have call predecessors, (136), 4 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2025-02-05 23:57:11,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 786 transitions. [2025-02-05 23:57:11,823 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 786 transitions. Word has length 223 [2025-02-05 23:57:11,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:57:11,824 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 786 transitions. [2025-02-05 23:57:11,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:11,825 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 786 transitions. [2025-02-05 23:57:11,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-02-05 23:57:11,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:57:11,827 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:11,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 23:57:11,827 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:57:11,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:57:11,827 INFO L85 PathProgramCache]: Analyzing trace with hash 887647737, now seen corresponding path program 1 times [2025-02-05 23:57:11,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:57:11,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813740923] [2025-02-05 23:57:11,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:57:11,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:57:11,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-05 23:57:11,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-05 23:57:11,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:57:11,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:57:11,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:57:11,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:57:11,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813740923] [2025-02-05 23:57:11,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813740923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:57:11,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:57:11,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:57:11,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525188133] [2025-02-05 23:57:11,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:57:11,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:57:11,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:57:11,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:57:11,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:57:11,957 INFO L87 Difference]: Start difference. First operand 495 states and 786 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:12,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:57:12,051 INFO L93 Difference]: Finished difference Result 1455 states and 2320 transitions. [2025-02-05 23:57:12,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:57:12,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 223 [2025-02-05 23:57:12,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:57:12,056 INFO L225 Difference]: With dead ends: 1455 [2025-02-05 23:57:12,056 INFO L226 Difference]: Without dead ends: 963 [2025-02-05 23:57:12,057 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 23:57:12,058 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 169 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:57:12,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 457 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:57:12,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-02-05 23:57:12,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 961. [2025-02-05 23:57:12,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 680 states have (on average 1.4352941176470588) internal successors, (976), 680 states have internal predecessors, (976), 272 states have call successors, (272), 8 states have call predecessors, (272), 8 states have return successors, (272), 272 states have call predecessors, (272), 272 states have call successors, (272) [2025-02-05 23:57:12,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1520 transitions. [2025-02-05 23:57:12,130 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1520 transitions. Word has length 223 [2025-02-05 23:57:12,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:57:12,130 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1520 transitions. [2025-02-05 23:57:12,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:12,130 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1520 transitions. [2025-02-05 23:57:12,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-02-05 23:57:12,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:57:12,132 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:12,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 23:57:12,132 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:57:12,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:57:12,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1678583575, now seen corresponding path program 1 times [2025-02-05 23:57:12,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:57:12,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146179464] [2025-02-05 23:57:12,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:57:12,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:57:12,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-05 23:57:12,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-05 23:57:12,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:57:12,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:57:12,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:57:12,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:57:12,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146179464] [2025-02-05 23:57:12,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146179464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:57:12,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:57:12,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:57:12,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360404113] [2025-02-05 23:57:12,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:57:12,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:57:12,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:57:12,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:57:12,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:57:12,297 INFO L87 Difference]: Start difference. First operand 961 states and 1520 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:12,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:57:12,852 INFO L93 Difference]: Finished difference Result 3837 states and 6084 transitions. [2025-02-05 23:57:12,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 23:57:12,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 224 [2025-02-05 23:57:12,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:57:12,865 INFO L225 Difference]: With dead ends: 3837 [2025-02-05 23:57:12,865 INFO L226 Difference]: Without dead ends: 2879 [2025-02-05 23:57:12,868 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 23:57:12,868 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 487 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 23:57:12,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 359 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 23:57:12,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2025-02-05 23:57:12,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 1917. [2025-02-05 23:57:12,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1917 states, 1356 states have (on average 1.4306784660766962) internal successors, (1940), 1356 states have internal predecessors, (1940), 544 states have call successors, (544), 16 states have call predecessors, (544), 16 states have return successors, (544), 544 states have call predecessors, (544), 544 states have call successors, (544) [2025-02-05 23:57:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 3028 transitions. [2025-02-05 23:57:12,988 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 3028 transitions. Word has length 224 [2025-02-05 23:57:12,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:57:12,988 INFO L471 AbstractCegarLoop]: Abstraction has 1917 states and 3028 transitions. [2025-02-05 23:57:12,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:12,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 3028 transitions. [2025-02-05 23:57:12,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-02-05 23:57:12,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:57:12,990 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:12,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 23:57:12,990 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:57:12,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:57:12,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1365534352, now seen corresponding path program 1 times [2025-02-05 23:57:12,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:57:12,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826314680] [2025-02-05 23:57:12,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:57:12,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:57:13,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-02-05 23:57:13,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-02-05 23:57:13,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:57:13,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:57:13,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:57:13,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:57:13,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826314680] [2025-02-05 23:57:13,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826314680] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:57:13,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:57:13,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:57:13,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281083600] [2025-02-05 23:57:13,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:57:13,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:57:13,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:57:13,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:57:13,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:57:13,173 INFO L87 Difference]: Start difference. First operand 1917 states and 3028 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:13,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:57:13,397 INFO L93 Difference]: Finished difference Result 5745 states and 9078 transitions. [2025-02-05 23:57:13,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:57:13,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 225 [2025-02-05 23:57:13,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:57:13,418 INFO L225 Difference]: With dead ends: 5745 [2025-02-05 23:57:13,418 INFO L226 Difference]: Without dead ends: 3831 [2025-02-05 23:57:13,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:57:13,424 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 128 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:57:13,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 341 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:57:13,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3831 states. [2025-02-05 23:57:13,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3831 to 3813. [2025-02-05 23:57:13,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3813 states, 2692 states have (on average 1.4279346210995543) internal successors, (3844), 2692 states have internal predecessors, (3844), 1088 states have call successors, (1088), 32 states have call predecessors, (1088), 32 states have return successors, (1088), 1088 states have call predecessors, (1088), 1088 states have call successors, (1088) [2025-02-05 23:57:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3813 states to 3813 states and 6020 transitions. [2025-02-05 23:57:13,982 INFO L78 Accepts]: Start accepts. Automaton has 3813 states and 6020 transitions. Word has length 225 [2025-02-05 23:57:13,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:57:13,986 INFO L471 AbstractCegarLoop]: Abstraction has 3813 states and 6020 transitions. [2025-02-05 23:57:13,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:13,986 INFO L276 IsEmpty]: Start isEmpty. Operand 3813 states and 6020 transitions. [2025-02-05 23:57:13,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-02-05 23:57:13,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:57:13,994 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:13,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 23:57:13,994 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:57:13,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:57:13,994 INFO L85 PathProgramCache]: Analyzing trace with hash 921412474, now seen corresponding path program 1 times [2025-02-05 23:57:13,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:57:13,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243959983] [2025-02-05 23:57:13,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:57:13,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:57:14,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-02-05 23:57:14,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-02-05 23:57:14,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:57:14,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:57:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:57:14,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:57:14,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243959983] [2025-02-05 23:57:14,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243959983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:57:14,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:57:14,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:57:14,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736015353] [2025-02-05 23:57:14,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:57:14,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:57:14,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:57:14,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:57:14,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:57:14,234 INFO L87 Difference]: Start difference. First operand 3813 states and 6020 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:14,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:57:14,582 INFO L93 Difference]: Finished difference Result 9577 states and 15142 transitions. [2025-02-05 23:57:14,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:57:14,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 226 [2025-02-05 23:57:14,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:57:14,612 INFO L225 Difference]: With dead ends: 9577 [2025-02-05 23:57:14,613 INFO L226 Difference]: Without dead ends: 5767 [2025-02-05 23:57:14,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 23:57:14,625 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 122 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:57:14,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 358 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:57:14,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5767 states. [2025-02-05 23:57:14,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5767 to 5765. [2025-02-05 23:57:14,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5765 states, 4084 states have (on average 1.4191968658178256) internal successors, (5796), 4084 states have internal predecessors, (5796), 1632 states have call successors, (1632), 48 states have call predecessors, (1632), 48 states have return successors, (1632), 1632 states have call predecessors, (1632), 1632 states have call successors, (1632) [2025-02-05 23:57:14,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 9060 transitions. [2025-02-05 23:57:14,961 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 9060 transitions. Word has length 226 [2025-02-05 23:57:14,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:57:14,962 INFO L471 AbstractCegarLoop]: Abstraction has 5765 states and 9060 transitions. [2025-02-05 23:57:14,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:14,963 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 9060 transitions. [2025-02-05 23:57:14,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-02-05 23:57:14,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:57:14,965 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:14,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 23:57:14,965 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:57:14,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:57:14,966 INFO L85 PathProgramCache]: Analyzing trace with hash -18068683, now seen corresponding path program 1 times [2025-02-05 23:57:14,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:57:14,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156293458] [2025-02-05 23:57:14,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:57:14,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:57:14,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-05 23:57:14,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-05 23:57:14,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:57:14,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:57:15,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:57:15,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:57:15,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156293458] [2025-02-05 23:57:15,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156293458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:57:15,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:57:15,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 23:57:15,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83935350] [2025-02-05 23:57:15,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:57:15,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 23:57:15,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:57:15,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 23:57:15,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:57:15,217 INFO L87 Difference]: Start difference. First operand 5765 states and 9060 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:16,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:57:16,484 INFO L93 Difference]: Finished difference Result 19323 states and 30385 transitions. [2025-02-05 23:57:16,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 23:57:16,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 228 [2025-02-05 23:57:16,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:57:16,555 INFO L225 Difference]: With dead ends: 19323 [2025-02-05 23:57:16,555 INFO L226 Difference]: Without dead ends: 13561 [2025-02-05 23:57:16,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 23:57:16,570 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 544 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 23:57:16,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 654 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 23:57:16,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13561 states. [2025-02-05 23:57:17,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13561 to 7743. [2025-02-05 23:57:17,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7743 states, 5586 states have (on average 1.4278553526673827) internal successors, (7976), 5614 states have internal predecessors, (7976), 2084 states have call successors, (2084), 72 states have call predecessors, (2084), 72 states have return successors, (2084), 2056 states have call predecessors, (2084), 2084 states have call successors, (2084) [2025-02-05 23:57:17,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7743 states to 7743 states and 12144 transitions. [2025-02-05 23:57:17,071 INFO L78 Accepts]: Start accepts. Automaton has 7743 states and 12144 transitions. Word has length 228 [2025-02-05 23:57:17,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:57:17,072 INFO L471 AbstractCegarLoop]: Abstraction has 7743 states and 12144 transitions. [2025-02-05 23:57:17,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:17,072 INFO L276 IsEmpty]: Start isEmpty. Operand 7743 states and 12144 transitions. [2025-02-05 23:57:17,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-02-05 23:57:17,076 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:57:17,076 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:17,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 23:57:17,076 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:57:17,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:57:17,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2095278026, now seen corresponding path program 1 times [2025-02-05 23:57:17,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:57:17,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96230342] [2025-02-05 23:57:17,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:57:17,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:57:17,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-05 23:57:17,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-05 23:57:17,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:57:17,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:57:17,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:57:17,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:57:17,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96230342] [2025-02-05 23:57:17,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96230342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:57:17,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:57:17,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 23:57:17,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526717723] [2025-02-05 23:57:17,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:57:17,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 23:57:17,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:57:17,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 23:57:17,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 23:57:17,264 INFO L87 Difference]: Start difference. First operand 7743 states and 12144 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:18,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:57:18,129 INFO L93 Difference]: Finished difference Result 21303 states and 33348 transitions. [2025-02-05 23:57:18,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 23:57:18,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 228 [2025-02-05 23:57:18,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:57:18,187 INFO L225 Difference]: With dead ends: 21303 [2025-02-05 23:57:18,187 INFO L226 Difference]: Without dead ends: 13563 [2025-02-05 23:57:18,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 23:57:18,213 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 182 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:57:18,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 536 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:57:18,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13563 states. [2025-02-05 23:57:19,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13563 to 13497. [2025-02-05 23:57:19,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13497 states, 9744 states have (on average 1.423440065681445) internal successors, (13870), 9800 states have internal predecessors, (13870), 3624 states have call successors, (3624), 128 states have call predecessors, (3624), 128 states have return successors, (3624), 3568 states have call predecessors, (3624), 3624 states have call successors, (3624) [2025-02-05 23:57:19,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13497 states to 13497 states and 21118 transitions. [2025-02-05 23:57:19,105 INFO L78 Accepts]: Start accepts. Automaton has 13497 states and 21118 transitions. Word has length 228 [2025-02-05 23:57:19,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:57:19,106 INFO L471 AbstractCegarLoop]: Abstraction has 13497 states and 21118 transitions. [2025-02-05 23:57:19,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:19,107 INFO L276 IsEmpty]: Start isEmpty. Operand 13497 states and 21118 transitions. [2025-02-05 23:57:19,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-02-05 23:57:19,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:57:19,109 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:19,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 23:57:19,110 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:57:19,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:57:19,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1451954326, now seen corresponding path program 1 times [2025-02-05 23:57:19,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:57:19,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941650894] [2025-02-05 23:57:19,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:57:19,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:57:19,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-05 23:57:19,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-05 23:57:19,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:57:19,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:57:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:57:19,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:57:19,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941650894] [2025-02-05 23:57:19,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941650894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:57:19,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:57:19,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:57:19,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190620722] [2025-02-05 23:57:19,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:57:19,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:57:19,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:57:19,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:57:19,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:57:19,269 INFO L87 Difference]: Start difference. First operand 13497 states and 21118 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:20,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:57:20,055 INFO L93 Difference]: Finished difference Result 29901 states and 46748 transitions. [2025-02-05 23:57:20,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:57:20,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 228 [2025-02-05 23:57:20,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:57:20,121 INFO L225 Difference]: With dead ends: 29901 [2025-02-05 23:57:20,122 INFO L226 Difference]: Without dead ends: 16407 [2025-02-05 23:57:20,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:57:20,152 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 124 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:57:20,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 350 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:57:20,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16407 states. [2025-02-05 23:57:21,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16407 to 16381. [2025-02-05 23:57:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16381 states, 11830 states have (on average 1.4204564666103128) internal successors, (16804), 11900 states have internal predecessors, (16804), 4394 states have call successors, (4394), 156 states have call predecessors, (4394), 156 states have return successors, (4394), 4324 states have call predecessors, (4394), 4394 states have call successors, (4394) [2025-02-05 23:57:21,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16381 states to 16381 states and 25592 transitions. [2025-02-05 23:57:21,523 INFO L78 Accepts]: Start accepts. Automaton has 16381 states and 25592 transitions. Word has length 228 [2025-02-05 23:57:21,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:57:21,524 INFO L471 AbstractCegarLoop]: Abstraction has 16381 states and 25592 transitions. [2025-02-05 23:57:21,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:21,524 INFO L276 IsEmpty]: Start isEmpty. Operand 16381 states and 25592 transitions. [2025-02-05 23:57:21,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-02-05 23:57:21,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:57:21,527 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:21,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 23:57:21,528 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:57:21,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:57:21,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1059749755, now seen corresponding path program 1 times [2025-02-05 23:57:21,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:57:21,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4158372] [2025-02-05 23:57:21,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:57:21,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:57:21,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-05 23:57:21,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-05 23:57:21,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:57:21,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:57:21,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-02-05 23:57:21,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:57:21,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4158372] [2025-02-05 23:57:21,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4158372] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:57:21,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975758229] [2025-02-05 23:57:21,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:57:21,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:57:21,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:57:21,784 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 23:57:21,785 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 23:57:21,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-05 23:57:21,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-05 23:57:21,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:57:21,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:57:21,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 23:57:21,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:57:22,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1083 proven. 36 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2025-02-05 23:57:22,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:57:22,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-02-05 23:57:22,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975758229] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 23:57:22,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 23:57:22,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-05 23:57:22,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89846029] [2025-02-05 23:57:22,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 23:57:22,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 23:57:22,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:57:22,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 23:57:22,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-05 23:57:22,324 INFO L87 Difference]: Start difference. First operand 16381 states and 25592 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2025-02-05 23:57:23,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:57:23,391 INFO L93 Difference]: Finished difference Result 31155 states and 47970 transitions. [2025-02-05 23:57:23,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 23:57:23,392 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) Word has length 229 [2025-02-05 23:57:23,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:57:23,448 INFO L225 Difference]: With dead ends: 31155 [2025-02-05 23:57:23,449 INFO L226 Difference]: Without dead ends: 14777 [2025-02-05 23:57:23,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2025-02-05 23:57:23,481 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 520 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 23:57:23,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 563 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 23:57:23,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14777 states. [2025-02-05 23:57:24,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14777 to 13443. [2025-02-05 23:57:24,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13443 states, 9688 states have (on average 1.398431048720066) internal successors, (13548), 9716 states have internal predecessors, (13548), 3512 states have call successors, (3512), 242 states have call predecessors, (3512), 242 states have return successors, (3512), 3484 states have call predecessors, (3512), 3512 states have call successors, (3512) [2025-02-05 23:57:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13443 states to 13443 states and 20572 transitions. [2025-02-05 23:57:24,318 INFO L78 Accepts]: Start accepts. Automaton has 13443 states and 20572 transitions. Word has length 229 [2025-02-05 23:57:24,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:57:24,318 INFO L471 AbstractCegarLoop]: Abstraction has 13443 states and 20572 transitions. [2025-02-05 23:57:24,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2025-02-05 23:57:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 13443 states and 20572 transitions. [2025-02-05 23:57:24,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-05 23:57:24,320 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:57:24,320 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:24,327 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 23:57:24,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:57:24,521 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:57:24,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:57:24,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1573560555, now seen corresponding path program 1 times [2025-02-05 23:57:24,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:57:24,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965542364] [2025-02-05 23:57:24,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:57:24,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:57:24,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-05 23:57:24,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-05 23:57:24,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:57:24,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:57:24,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:57:24,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:57:24,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965542364] [2025-02-05 23:57:24,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965542364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:57:24,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:57:24,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 23:57:24,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411255880] [2025-02-05 23:57:24,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:57:24,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 23:57:24,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:57:24,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 23:57:24,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:57:24,685 INFO L87 Difference]: Start difference. First operand 13443 states and 20572 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:25,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:57:25,451 INFO L93 Difference]: Finished difference Result 27439 states and 42001 transitions. [2025-02-05 23:57:25,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 23:57:25,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 230 [2025-02-05 23:57:25,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:57:25,501 INFO L225 Difference]: With dead ends: 27439 [2025-02-05 23:57:25,501 INFO L226 Difference]: Without dead ends: 13999 [2025-02-05 23:57:25,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 23:57:25,524 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 319 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:57:25,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 553 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:57:25,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13999 states. [2025-02-05 23:57:26,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13999 to 13909. [2025-02-05 23:57:26,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13909 states, 9978 states have (on average 1.3916616556424133) internal successors, (13886), 10014 states have internal predecessors, (13886), 3680 states have call successors, (3680), 250 states have call predecessors, (3680), 250 states have return successors, (3680), 3644 states have call predecessors, (3680), 3680 states have call successors, (3680) [2025-02-05 23:57:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13909 states to 13909 states and 21246 transitions. [2025-02-05 23:57:26,418 INFO L78 Accepts]: Start accepts. Automaton has 13909 states and 21246 transitions. Word has length 230 [2025-02-05 23:57:26,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:57:26,419 INFO L471 AbstractCegarLoop]: Abstraction has 13909 states and 21246 transitions. [2025-02-05 23:57:26,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:26,419 INFO L276 IsEmpty]: Start isEmpty. Operand 13909 states and 21246 transitions. [2025-02-05 23:57:26,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-02-05 23:57:26,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:57:26,421 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:26,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 23:57:26,422 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:57:26,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:57:26,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1392491386, now seen corresponding path program 1 times [2025-02-05 23:57:26,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:57:26,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021015187] [2025-02-05 23:57:26,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:57:26,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:57:26,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-02-05 23:57:26,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-02-05 23:57:26,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:57:26,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:57:26,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:57:26,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:57:26,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021015187] [2025-02-05 23:57:26,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021015187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:57:26,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:57:26,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 23:57:26,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240477429] [2025-02-05 23:57:26,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:57:26,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 23:57:26,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:57:26,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 23:57:26,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:57:26,806 INFO L87 Difference]: Start difference. First operand 13909 states and 21246 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:29,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:57:29,599 INFO L93 Difference]: Finished difference Result 45449 states and 69269 transitions. [2025-02-05 23:57:29,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 23:57:29,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 231 [2025-02-05 23:57:29,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:57:29,727 INFO L225 Difference]: With dead ends: 45449 [2025-02-05 23:57:29,728 INFO L226 Difference]: Without dead ends: 31543 [2025-02-05 23:57:29,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:57:29,761 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 613 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 23:57:29,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 687 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 23:57:29,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31543 states. [2025-02-05 23:57:31,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31543 to 23235. [2025-02-05 23:57:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23235 states, 16880 states have (on average 1.3954383886255923) internal successors, (23555), 16950 states have internal predecessors, (23555), 5958 states have call successors, (5958), 396 states have call predecessors, (5958), 396 states have return successors, (5958), 5888 states have call predecessors, (5958), 5958 states have call successors, (5958) [2025-02-05 23:57:31,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23235 states to 23235 states and 35471 transitions. [2025-02-05 23:57:31,364 INFO L78 Accepts]: Start accepts. Automaton has 23235 states and 35471 transitions. Word has length 231 [2025-02-05 23:57:31,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:57:31,364 INFO L471 AbstractCegarLoop]: Abstraction has 23235 states and 35471 transitions. [2025-02-05 23:57:31,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:31,365 INFO L276 IsEmpty]: Start isEmpty. Operand 23235 states and 35471 transitions. [2025-02-05 23:57:31,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-02-05 23:57:31,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:57:31,366 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:31,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 23:57:31,366 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:57:31,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:57:31,367 INFO L85 PathProgramCache]: Analyzing trace with hash 519497817, now seen corresponding path program 1 times [2025-02-05 23:57:31,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:57:31,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600852933] [2025-02-05 23:57:31,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:57:31,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:57:31,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-02-05 23:57:31,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-02-05 23:57:31,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:57:31,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:57:32,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 75 proven. 117 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [2025-02-05 23:57:32,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:57:32,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600852933] [2025-02-05 23:57:32,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600852933] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:57:32,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292066662] [2025-02-05 23:57:32,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:57:32,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:57:32,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:57:32,206 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 23:57:32,207 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 23:57:32,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-02-05 23:57:32,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-02-05 23:57:32,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:57:32,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:57:32,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-05 23:57:32,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:57:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1222 proven. 249 refuted. 0 times theorem prover too weak. 773 trivial. 0 not checked. [2025-02-05 23:57:33,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:57:35,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 111 proven. 267 refuted. 0 times theorem prover too weak. 1866 trivial. 0 not checked. [2025-02-05 23:57:35,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292066662] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 23:57:35,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 23:57:35,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 15] total 35 [2025-02-05 23:57:35,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217835929] [2025-02-05 23:57:35,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 23:57:35,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-05 23:57:35,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:57:35,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-05 23:57:35,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=905, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 23:57:35,057 INFO L87 Difference]: Start difference. First operand 23235 states and 35471 transitions. Second operand has 35 states, 34 states have (on average 5.5588235294117645) internal successors, (189), 33 states have internal predecessors, (189), 12 states have call successors, (89), 6 states have call predecessors, (89), 13 states have return successors, (90), 11 states have call predecessors, (90), 12 states have call successors, (90) [2025-02-05 23:57:37,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:57:37,739 INFO L93 Difference]: Finished difference Result 38299 states and 55848 transitions. [2025-02-05 23:57:37,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-05 23:57:37,739 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 5.5588235294117645) internal successors, (189), 33 states have internal predecessors, (189), 12 states have call successors, (89), 6 states have call predecessors, (89), 13 states have return successors, (90), 11 states have call predecessors, (90), 12 states have call successors, (90) Word has length 231 [2025-02-05 23:57:37,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:57:37,829 INFO L225 Difference]: With dead ends: 38299 [2025-02-05 23:57:37,829 INFO L226 Difference]: Without dead ends: 20083 [2025-02-05 23:57:37,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1073, Invalid=2709, Unknown=0, NotChecked=0, Total=3782 [2025-02-05 23:57:37,876 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 421 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 23:57:37,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 493 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 23:57:37,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20083 states. [2025-02-05 23:57:39,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20083 to 18520. [2025-02-05 23:57:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18520 states, 13768 states have (on average 1.3284427658338176) internal successors, (18290), 13873 states have internal predecessors, (18290), 3850 states have call successors, (3850), 901 states have call predecessors, (3850), 901 states have return successors, (3850), 3745 states have call predecessors, (3850), 3850 states have call successors, (3850) [2025-02-05 23:57:39,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18520 states to 18520 states and 25990 transitions. [2025-02-05 23:57:39,438 INFO L78 Accepts]: Start accepts. Automaton has 18520 states and 25990 transitions. Word has length 231 [2025-02-05 23:57:39,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:57:39,439 INFO L471 AbstractCegarLoop]: Abstraction has 18520 states and 25990 transitions. [2025-02-05 23:57:39,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 5.5588235294117645) internal successors, (189), 33 states have internal predecessors, (189), 12 states have call successors, (89), 6 states have call predecessors, (89), 13 states have return successors, (90), 11 states have call predecessors, (90), 12 states have call successors, (90) [2025-02-05 23:57:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 18520 states and 25990 transitions. [2025-02-05 23:57:39,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-02-05 23:57:39,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:57:39,441 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:39,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 23:57:39,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:57:39,645 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:57:39,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:57:39,645 INFO L85 PathProgramCache]: Analyzing trace with hash 83635760, now seen corresponding path program 1 times [2025-02-05 23:57:39,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:57:39,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208080928] [2025-02-05 23:57:39,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:57:39,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:57:39,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-05 23:57:39,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-05 23:57:39,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:57:39,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:57:39,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:57:39,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:57:39,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208080928] [2025-02-05 23:57:39,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208080928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:57:39,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:57:39,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 23:57:39,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77933075] [2025-02-05 23:57:39,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:57:39,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 23:57:39,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:57:39,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 23:57:39,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:57:39,862 INFO L87 Difference]: Start difference. First operand 18520 states and 25990 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:41,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:57:41,910 INFO L93 Difference]: Finished difference Result 29138 states and 40998 transitions. [2025-02-05 23:57:41,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 23:57:41,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 232 [2025-02-05 23:57:41,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:57:41,992 INFO L225 Difference]: With dead ends: 29138 [2025-02-05 23:57:41,992 INFO L226 Difference]: Without dead ends: 22496 [2025-02-05 23:57:42,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:57:42,012 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 186 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:57:42,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 543 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:57:42,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22496 states. [2025-02-05 23:57:44,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22496 to 22470. [2025-02-05 23:57:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22470 states, 16656 states have (on average 1.3282901056676273) internal successors, (22124), 16779 states have internal predecessors, (22124), 4708 states have call successors, (4708), 1105 states have call predecessors, (4708), 1105 states have return successors, (4708), 4585 states have call predecessors, (4708), 4708 states have call successors, (4708) [2025-02-05 23:57:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22470 states to 22470 states and 31540 transitions. [2025-02-05 23:57:44,444 INFO L78 Accepts]: Start accepts. Automaton has 22470 states and 31540 transitions. Word has length 232 [2025-02-05 23:57:44,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:57:44,444 INFO L471 AbstractCegarLoop]: Abstraction has 22470 states and 31540 transitions. [2025-02-05 23:57:44,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:44,445 INFO L276 IsEmpty]: Start isEmpty. Operand 22470 states and 31540 transitions. [2025-02-05 23:57:44,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-02-05 23:57:44,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:57:44,446 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:44,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 23:57:44,446 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:57:44,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:57:44,447 INFO L85 PathProgramCache]: Analyzing trace with hash -186917513, now seen corresponding path program 1 times [2025-02-05 23:57:44,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:57:44,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754688147] [2025-02-05 23:57:44,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:57:44,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:57:44,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-05 23:57:44,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-05 23:57:44,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:57:44,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:57:44,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:57:44,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:57:44,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754688147] [2025-02-05 23:57:44,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754688147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:57:44,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:57:44,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 23:57:44,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577001399] [2025-02-05 23:57:44,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:57:44,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 23:57:44,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:57:44,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 23:57:44,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:57:44,606 INFO L87 Difference]: Start difference. First operand 22470 states and 31540 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:46,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:57:46,559 INFO L93 Difference]: Finished difference Result 39966 states and 56289 transitions. [2025-02-05 23:57:46,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:57:46,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 232 [2025-02-05 23:57:46,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:57:46,640 INFO L225 Difference]: With dead ends: 39966 [2025-02-05 23:57:46,640 INFO L226 Difference]: Without dead ends: 24024 [2025-02-05 23:57:46,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:57:46,669 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 289 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:57:46,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 673 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:57:46,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24024 states. [2025-02-05 23:57:48,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24024 to 22868. [2025-02-05 23:57:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22868 states, 17054 states have (on average 1.3328837809311598) internal successors, (22731), 17177 states have internal predecessors, (22731), 4708 states have call successors, (4708), 1105 states have call predecessors, (4708), 1105 states have return successors, (4708), 4585 states have call predecessors, (4708), 4708 states have call successors, (4708) [2025-02-05 23:57:48,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22868 states to 22868 states and 32147 transitions. [2025-02-05 23:57:48,611 INFO L78 Accepts]: Start accepts. Automaton has 22868 states and 32147 transitions. Word has length 232 [2025-02-05 23:57:48,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:57:48,612 INFO L471 AbstractCegarLoop]: Abstraction has 22868 states and 32147 transitions. [2025-02-05 23:57:48,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:57:48,612 INFO L276 IsEmpty]: Start isEmpty. Operand 22868 states and 32147 transitions. [2025-02-05 23:57:48,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-02-05 23:57:48,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:57:48,614 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:48,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 23:57:48,614 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:57:48,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:57:48,614 INFO L85 PathProgramCache]: Analyzing trace with hash -247279476, now seen corresponding path program 1 times [2025-02-05 23:57:48,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:57:48,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891150042] [2025-02-05 23:57:48,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:57:48,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:57:48,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-05 23:57:48,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-05 23:57:48,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:57:48,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:57:48,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:57:48,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:57:48,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891150042] [2025-02-05 23:57:48,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891150042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:57:48,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:57:48,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 23:57:48,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776058596] [2025-02-05 23:57:48,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:57:48,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 23:57:48,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:57:48,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 23:57:48,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 23:57:48,860 INFO L87 Difference]: Start difference. First operand 22868 states and 32147 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 23:57:51,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:57:51,579 INFO L93 Difference]: Finished difference Result 51129 states and 71789 transitions. [2025-02-05 23:57:51,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 23:57:51,580 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 232 [2025-02-05 23:57:51,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:57:51,685 INFO L225 Difference]: With dead ends: 51129 [2025-02-05 23:57:51,685 INFO L226 Difference]: Without dead ends: 28264 [2025-02-05 23:57:51,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-02-05 23:57:51,733 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 675 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 23:57:51,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 675 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 23:57:51,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28264 states. [2025-02-05 23:57:54,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28264 to 28167. [2025-02-05 23:57:54,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28167 states, 21021 states have (on average 1.3273393273393272) internal successors, (27902), 21182 states have internal predecessors, (27902), 5784 states have call successors, (5784), 1361 states have call predecessors, (5784), 1361 states have return successors, (5784), 5623 states have call predecessors, (5784), 5784 states have call successors, (5784) [2025-02-05 23:57:54,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28167 states to 28167 states and 39470 transitions. [2025-02-05 23:57:54,179 INFO L78 Accepts]: Start accepts. Automaton has 28167 states and 39470 transitions. Word has length 232 [2025-02-05 23:57:54,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:57:54,179 INFO L471 AbstractCegarLoop]: Abstraction has 28167 states and 39470 transitions. [2025-02-05 23:57:54,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 23:57:54,180 INFO L276 IsEmpty]: Start isEmpty. Operand 28167 states and 39470 transitions. [2025-02-05 23:57:54,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-05 23:57:54,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:57:54,181 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:54,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 23:57:54,181 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:57:54,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:57:54,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1045964804, now seen corresponding path program 1 times [2025-02-05 23:57:54,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:57:54,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402249958] [2025-02-05 23:57:54,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:57:54,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:57:54,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-05 23:57:54,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-05 23:57:54,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:57:54,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:57:54,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:57:54,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:57:54,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402249958] [2025-02-05 23:57:54,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402249958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:57:54,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:57:54,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 23:57:54,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666401172] [2025-02-05 23:57:54,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:57:54,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 23:57:54,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:57:54,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 23:57:54,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 23:57:54,518 INFO L87 Difference]: Start difference. First operand 28167 states and 39470 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 23:57:58,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:57:58,591 INFO L93 Difference]: Finished difference Result 50670 states and 71029 transitions. [2025-02-05 23:57:58,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 23:57:58,593 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 233 [2025-02-05 23:57:58,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:57:58,693 INFO L225 Difference]: With dead ends: 50670 [2025-02-05 23:57:58,693 INFO L226 Difference]: Without dead ends: 30516 [2025-02-05 23:57:58,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2025-02-05 23:57:58,728 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 402 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:57:58,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1289 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 23:57:58,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30516 states. [2025-02-05 23:58:01,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30516 to 28855. [2025-02-05 23:58:01,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28855 states, 21629 states have (on average 1.3270146562485552) internal successors, (28702), 21806 states have internal predecessors, (28702), 5848 states have call successors, (5848), 1377 states have call predecessors, (5848), 1377 states have return successors, (5848), 5671 states have call predecessors, (5848), 5848 states have call successors, (5848) [2025-02-05 23:58:01,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28855 states to 28855 states and 40398 transitions. [2025-02-05 23:58:01,701 INFO L78 Accepts]: Start accepts. Automaton has 28855 states and 40398 transitions. Word has length 233 [2025-02-05 23:58:01,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:58:01,702 INFO L471 AbstractCegarLoop]: Abstraction has 28855 states and 40398 transitions. [2025-02-05 23:58:01,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 23:58:01,702 INFO L276 IsEmpty]: Start isEmpty. Operand 28855 states and 40398 transitions. [2025-02-05 23:58:01,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-05 23:58:01,703 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:58:01,704 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:58:01,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 23:58:01,704 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:58:01,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:58:01,704 INFO L85 PathProgramCache]: Analyzing trace with hash -42725397, now seen corresponding path program 1 times [2025-02-05 23:58:01,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:58:01,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696720464] [2025-02-05 23:58:01,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:58:01,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:58:01,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-05 23:58:01,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-05 23:58:01,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:58:01,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 23:58:01,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1263810339] [2025-02-05 23:58:01,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:58:01,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:58:01,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:58:01,753 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 23:58:01,755 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 23:58:01,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-05 23:58:01,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-05 23:58:01,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:58:01,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:58:01,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 23:58:01,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:58:02,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1083 proven. 36 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2025-02-05 23:58:02,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:58:22,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:58:22,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696720464] [2025-02-05 23:58:22,646 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 23:58:22,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263810339] [2025-02-05 23:58:22,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263810339] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:58:22,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 23:58:22,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-02-05 23:58:22,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954480364] [2025-02-05 23:58:22,646 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 23:58:22,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 23:58:22,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:58:22,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 23:58:22,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=126, Unknown=4, NotChecked=0, Total=182 [2025-02-05 23:58:22,647 INFO L87 Difference]: Start difference. First operand 28855 states and 40398 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 23:58:31,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:58:31,386 INFO L93 Difference]: Finished difference Result 62261 states and 86704 transitions. [2025-02-05 23:58:31,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 23:58:31,390 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 233 [2025-02-05 23:58:31,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:58:31,637 INFO L225 Difference]: With dead ends: 62261 [2025-02-05 23:58:31,637 INFO L226 Difference]: Without dead ends: 33409 [2025-02-05 23:58:31,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=117, Invalid=259, Unknown=4, NotChecked=0, Total=380 [2025-02-05 23:58:31,677 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 457 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:58:31,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 909 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-02-05 23:58:31,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33409 states.