./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-49.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_operatoramount_amount500_file-49.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 4a71ff94ddd05990b8bae34b7e5a74219661739e8f61363c2e62cfc27979e9a4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:41:08,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:41:08,158 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:41:08,161 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:41:08,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:41:08,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:41:08,176 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:41:08,176 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:41:08,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:41:08,176 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:41:08,177 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:41:08,177 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:41:08,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:41:08,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:41:08,177 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:41:08,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:41:08,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:41:08,177 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:41:08,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:41:08,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:41:08,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:41:08,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:41:08,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:41:08,178 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:41:08,178 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:41:08,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:41:08,178 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:41:08,178 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:41:08,178 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:41:08,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:41:08,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:41:08,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:41:08,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:41:08,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:41:08,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:41:08,179 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:41:08,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:41:08,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:41:08,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:41:08,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:41:08,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:41:08,179 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:41:08,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:41:08,179 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 -> 4a71ff94ddd05990b8bae34b7e5a74219661739e8f61363c2e62cfc27979e9a4 [2025-02-06 02:41:08,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:41:08,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:41:08,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:41:08,379 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:41:08,380 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:41:08,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-49.i [2025-02-06 02:41:09,505 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e141594f/05810a6d954e435c84c44bbf005af91d/FLAG535772e1f [2025-02-06 02:41:09,778 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:41:09,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-49.i [2025-02-06 02:41:09,793 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e141594f/05810a6d954e435c84c44bbf005af91d/FLAG535772e1f [2025-02-06 02:41:10,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e141594f/05810a6d954e435c84c44bbf005af91d [2025-02-06 02:41:10,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:41:10,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:41:10,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:41:10,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:41:10,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:41:10,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:41:10" (1/1) ... [2025-02-06 02:41:10,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e79afff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:10, skipping insertion in model container [2025-02-06 02:41:10,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:41:10" (1/1) ... [2025-02-06 02:41:10,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:41:10,231 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_operatoramount_amount500_file-49.i[916,929] [2025-02-06 02:41:10,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:41:10,569 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:41:10,576 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_operatoramount_amount500_file-49.i[916,929] [2025-02-06 02:41:10,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:41:10,649 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:41:10,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:10 WrapperNode [2025-02-06 02:41:10,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:41:10,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:41:10,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:41:10,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:41:10,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:10" (1/1) ... [2025-02-06 02:41:10,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:10" (1/1) ... [2025-02-06 02:41:10,738 INFO L138 Inliner]: procedures = 26, calls = 104, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 781 [2025-02-06 02:41:10,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:41:10,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:41:10,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:41:10,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:41:10,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:10" (1/1) ... [2025-02-06 02:41:10,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:10" (1/1) ... [2025-02-06 02:41:10,767 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:10" (1/1) ... [2025-02-06 02:41:10,843 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-06 02:41:10,844 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:10" (1/1) ... [2025-02-06 02:41:10,844 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:10" (1/1) ... [2025-02-06 02:41:10,875 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:10" (1/1) ... [2025-02-06 02:41:10,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:10" (1/1) ... [2025-02-06 02:41:10,890 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:10" (1/1) ... [2025-02-06 02:41:10,894 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:10" (1/1) ... [2025-02-06 02:41:10,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:41:10,915 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:41:10,915 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:41:10,915 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:41:10,916 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:10" (1/1) ... [2025-02-06 02:41:10,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:41:10,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:41:10,943 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-06 02:41:10,951 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-06 02:41:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:41:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:41:10,965 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:41:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:41:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:41:10,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:41:11,083 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:41:11,084 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:41:12,060 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L688: havoc property_#t~ite63#1;havoc property_#t~bitwise62#1;havoc property_#t~short64#1;havoc property_#t~ite67#1;havoc property_#t~ite66#1;havoc property_#t~bitwise65#1;havoc property_#t~short68#1;havoc property_#t~ite72#1;havoc property_#t~bitwise69#1;havoc property_#t~bitwise70#1;havoc property_#t~short71#1;havoc property_#t~short73#1; [2025-02-06 02:41:12,197 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2025-02-06 02:41:12,197 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:41:12,213 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:41:12,214 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:41:12,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:41:12 BoogieIcfgContainer [2025-02-06 02:41:12,214 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:41:12,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:41:12,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:41:12,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:41:12,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:41:10" (1/3) ... [2025-02-06 02:41:12,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a66767c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:41:12, skipping insertion in model container [2025-02-06 02:41:12,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:10" (2/3) ... [2025-02-06 02:41:12,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a66767c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:41:12, skipping insertion in model container [2025-02-06 02:41:12,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:41:12" (3/3) ... [2025-02-06 02:41:12,221 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-49.i [2025-02-06 02:41:12,230 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:41:12,232 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-49.i that has 2 procedures, 311 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:41:12,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:41:12,277 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;@75b7819e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:41:12,278 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:41:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 311 states, 217 states have (on average 1.5115207373271888) internal successors, (328), 218 states have internal predecessors, (328), 91 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-06 02:41:12,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-02-06 02:41:12,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:12,302 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:41:12,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:12,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:12,306 INFO L85 PathProgramCache]: Analyzing trace with hash -660192414, now seen corresponding path program 1 times [2025-02-06 02:41:12,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:12,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056463708] [2025-02-06 02:41:12,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:12,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:12,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-02-06 02:41:12,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-02-06 02:41:12,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:12,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:12,893 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 16200 trivial. 0 not checked. [2025-02-06 02:41:12,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:12,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056463708] [2025-02-06 02:41:12,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056463708] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:41:12,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104146613] [2025-02-06 02:41:12,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:12,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:41:12,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:41:12,900 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-06 02:41:12,901 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-06 02:41:13,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-02-06 02:41:13,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-02-06 02:41:13,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:13,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:13,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:41:13,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:41:13,432 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 16200 trivial. 0 not checked. [2025-02-06 02:41:13,432 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:41:13,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104146613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:13,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:41:13,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:41:13,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215663400] [2025-02-06 02:41:13,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:13,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:41:13,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:13,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:41:13,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:41:13,461 INFO L87 Difference]: Start difference. First operand has 311 states, 217 states have (on average 1.5115207373271888) internal successors, (328), 218 states have internal predecessors, (328), 91 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) Second operand has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 2 states have call successors, (91), 2 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 2 states have call successors, (91) [2025-02-06 02:41:13,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:13,532 INFO L93 Difference]: Finished difference Result 611 states and 1098 transitions. [2025-02-06 02:41:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:41:13,534 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 2 states have call successors, (91), 2 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 2 states have call successors, (91) Word has length 596 [2025-02-06 02:41:13,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:13,540 INFO L225 Difference]: With dead ends: 611 [2025-02-06 02:41:13,540 INFO L226 Difference]: Without dead ends: 303 [2025-02-06 02:41:13,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 597 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-06 02:41:13,547 INFO L435 NwaCegarLoop]: 488 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, 488 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-06 02:41:13,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 488 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:41:13,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-02-06 02:41:13,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2025-02-06 02:41:13,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 210 states have (on average 1.4857142857142858) internal successors, (312), 210 states have internal predecessors, (312), 91 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-06 02:41:13,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 494 transitions. [2025-02-06 02:41:13,622 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 494 transitions. Word has length 596 [2025-02-06 02:41:13,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:13,623 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 494 transitions. [2025-02-06 02:41:13,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 2 states have call successors, (91), 2 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 2 states have call successors, (91) [2025-02-06 02:41:13,624 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 494 transitions. [2025-02-06 02:41:13,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-02-06 02:41:13,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:13,638 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:41:13,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:41:13,843 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-06 02:41:13,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:13,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:13,846 INFO L85 PathProgramCache]: Analyzing trace with hash -524205791, now seen corresponding path program 1 times [2025-02-06 02:41:13,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:13,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218538642] [2025-02-06 02:41:13,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:13,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:13,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-02-06 02:41:14,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-02-06 02:41:14,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:14,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-02-06 02:41:14,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:14,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218538642] [2025-02-06 02:41:14,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218538642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:14,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:14,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:14,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084001634] [2025-02-06 02:41:14,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:14,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:14,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:14,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:14,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:14,591 INFO L87 Difference]: Start difference. First operand 303 states and 494 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-06 02:41:14,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:14,740 INFO L93 Difference]: Finished difference Result 892 states and 1455 transitions. [2025-02-06 02:41:14,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:14,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 596 [2025-02-06 02:41:14,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:14,750 INFO L225 Difference]: With dead ends: 892 [2025-02-06 02:41:14,751 INFO L226 Difference]: Without dead ends: 592 [2025-02-06 02:41:14,754 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-06 02:41:14,754 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 468 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:14,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 935 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:14,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-02-06 02:41:14,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 370. [2025-02-06 02:41:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 277 states have (on average 1.5306859205776173) internal successors, (424), 277 states have internal predecessors, (424), 91 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-06 02:41:14,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 606 transitions. [2025-02-06 02:41:14,814 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 606 transitions. Word has length 596 [2025-02-06 02:41:14,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:14,817 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 606 transitions. [2025-02-06 02:41:14,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-06 02:41:14,817 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 606 transitions. [2025-02-06 02:41:14,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-02-06 02:41:14,826 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:14,827 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:41:14,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:41:14,827 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:14,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:14,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1479727070, now seen corresponding path program 1 times [2025-02-06 02:41:14,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:14,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702590095] [2025-02-06 02:41:14,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:14,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:14,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-02-06 02:41:14,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-02-06 02:41:14,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:14,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-02-06 02:41:15,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:15,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702590095] [2025-02-06 02:41:15,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702590095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:15,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:15,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:15,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152614815] [2025-02-06 02:41:15,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:15,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:15,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:15,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:15,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:15,248 INFO L87 Difference]: Start difference. First operand 370 states and 606 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-06 02:41:15,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:15,360 INFO L93 Difference]: Finished difference Result 922 states and 1511 transitions. [2025-02-06 02:41:15,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:15,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 596 [2025-02-06 02:41:15,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:15,368 INFO L225 Difference]: With dead ends: 922 [2025-02-06 02:41:15,369 INFO L226 Difference]: Without dead ends: 555 [2025-02-06 02:41:15,370 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-06 02:41:15,371 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 199 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:15,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 938 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:15,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-02-06 02:41:15,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 552. [2025-02-06 02:41:15,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 455 states have (on average 1.5626373626373626) internal successors, (711), 456 states have internal predecessors, (711), 94 states have call successors, (94), 2 states have call predecessors, (94), 2 states have return successors, (94), 93 states have call predecessors, (94), 94 states have call successors, (94) [2025-02-06 02:41:15,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 899 transitions. [2025-02-06 02:41:15,414 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 899 transitions. Word has length 596 [2025-02-06 02:41:15,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:15,416 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 899 transitions. [2025-02-06 02:41:15,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-06 02:41:15,417 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 899 transitions. [2025-02-06 02:41:15,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-02-06 02:41:15,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:15,424 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:41:15,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:41:15,424 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:15,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:15,424 INFO L85 PathProgramCache]: Analyzing trace with hash 190786499, now seen corresponding path program 1 times [2025-02-06 02:41:15,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:15,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397322336] [2025-02-06 02:41:15,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:15,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:15,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-02-06 02:41:15,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-02-06 02:41:15,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:15,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:15,772 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-02-06 02:41:15,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:15,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397322336] [2025-02-06 02:41:15,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397322336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:15,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:15,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:15,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664668610] [2025-02-06 02:41:15,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:15,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:15,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:15,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:15,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:15,783 INFO L87 Difference]: Start difference. First operand 552 states and 899 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-06 02:41:15,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:15,992 INFO L93 Difference]: Finished difference Result 1650 states and 2691 transitions. [2025-02-06 02:41:15,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:15,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 596 [2025-02-06 02:41:15,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:16,010 INFO L225 Difference]: With dead ends: 1650 [2025-02-06 02:41:16,011 INFO L226 Difference]: Without dead ends: 1101 [2025-02-06 02:41:16,020 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-06 02:41:16,020 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 485 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:16,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 954 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:16,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2025-02-06 02:41:16,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1099. [2025-02-06 02:41:16,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 906 states have (on average 1.5430463576158941) internal successors, (1398), 908 states have internal predecessors, (1398), 188 states have call successors, (188), 4 states have call predecessors, (188), 4 states have return successors, (188), 186 states have call predecessors, (188), 188 states have call successors, (188) [2025-02-06 02:41:16,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1774 transitions. [2025-02-06 02:41:16,270 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1774 transitions. Word has length 596 [2025-02-06 02:41:16,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:16,271 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1774 transitions. [2025-02-06 02:41:16,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-06 02:41:16,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1774 transitions. [2025-02-06 02:41:16,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-02-06 02:41:16,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:16,291 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:41:16,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:41:16,292 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:16,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:16,293 INFO L85 PathProgramCache]: Analyzing trace with hash 89874532, now seen corresponding path program 1 times [2025-02-06 02:41:16,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:16,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772824898] [2025-02-06 02:41:16,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:16,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:16,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-02-06 02:41:16,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-02-06 02:41:16,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:16,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-02-06 02:41:17,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:17,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772824898] [2025-02-06 02:41:17,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772824898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:17,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:17,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:17,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916010064] [2025-02-06 02:41:17,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:17,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:17,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:17,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:17,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:17,405 INFO L87 Difference]: Start difference. First operand 1099 states and 1774 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-06 02:41:17,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:17,512 INFO L93 Difference]: Finished difference Result 3291 states and 5316 transitions. [2025-02-06 02:41:17,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:17,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 596 [2025-02-06 02:41:17,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:17,523 INFO L225 Difference]: With dead ends: 3291 [2025-02-06 02:41:17,523 INFO L226 Difference]: Without dead ends: 2195 [2025-02-06 02:41:17,526 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-06 02:41:17,527 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 483 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:17,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1308 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:17,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2025-02-06 02:41:17,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 2193. [2025-02-06 02:41:17,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2193 states, 1808 states have (on average 1.5265486725663717) internal successors, (2760), 1812 states have internal predecessors, (2760), 376 states have call successors, (376), 8 states have call predecessors, (376), 8 states have return successors, (376), 372 states have call predecessors, (376), 376 states have call successors, (376) [2025-02-06 02:41:17,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 3512 transitions. [2025-02-06 02:41:17,649 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 3512 transitions. Word has length 596 [2025-02-06 02:41:17,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:17,652 INFO L471 AbstractCegarLoop]: Abstraction has 2193 states and 3512 transitions. [2025-02-06 02:41:17,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-06 02:41:17,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 3512 transitions. [2025-02-06 02:41:17,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-02-06 02:41:17,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:17,659 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:41:17,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:41:17,660 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:17,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:17,661 INFO L85 PathProgramCache]: Analyzing trace with hash -375208699, now seen corresponding path program 1 times [2025-02-06 02:41:17,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:17,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963882706] [2025-02-06 02:41:17,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:17,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:17,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-02-06 02:41:17,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-02-06 02:41:17,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:17,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-02-06 02:41:18,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:18,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963882706] [2025-02-06 02:41:18,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963882706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:18,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:18,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:18,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965487187] [2025-02-06 02:41:18,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:18,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:18,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:18,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:18,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:18,454 INFO L87 Difference]: Start difference. First operand 2193 states and 3512 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-06 02:41:18,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:18,617 INFO L93 Difference]: Finished difference Result 6573 states and 10530 transitions. [2025-02-06 02:41:18,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:18,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 596 [2025-02-06 02:41:18,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:18,638 INFO L225 Difference]: With dead ends: 6573 [2025-02-06 02:41:18,638 INFO L226 Difference]: Without dead ends: 4383 [2025-02-06 02:41:18,643 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-06 02:41:18,644 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 291 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:18,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 968 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:41:18,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4383 states. [2025-02-06 02:41:18,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4383 to 4381. [2025-02-06 02:41:18,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4381 states, 3612 states have (on average 1.5227021040974529) internal successors, (5500), 3620 states have internal predecessors, (5500), 752 states have call successors, (752), 16 states have call predecessors, (752), 16 states have return successors, (752), 744 states have call predecessors, (752), 752 states have call successors, (752) [2025-02-06 02:41:18,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 4381 states and 7004 transitions. [2025-02-06 02:41:18,889 INFO L78 Accepts]: Start accepts. Automaton has 4381 states and 7004 transitions. Word has length 596 [2025-02-06 02:41:18,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:18,890 INFO L471 AbstractCegarLoop]: Abstraction has 4381 states and 7004 transitions. [2025-02-06 02:41:18,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-06 02:41:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 4381 states and 7004 transitions. [2025-02-06 02:41:18,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-02-06 02:41:18,895 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:18,896 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:41:18,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:41:18,896 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:18,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:18,897 INFO L85 PathProgramCache]: Analyzing trace with hash -29654600, now seen corresponding path program 1 times [2025-02-06 02:41:18,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:18,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005512201] [2025-02-06 02:41:18,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:18,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:18,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-02-06 02:41:19,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-02-06 02:41:19,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:19,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-02-06 02:41:20,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:20,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005512201] [2025-02-06 02:41:20,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005512201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:20,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:20,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:41:20,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922469386] [2025-02-06 02:41:20,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:20,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:41:20,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:20,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:41:20,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:41:20,726 INFO L87 Difference]: Start difference. First operand 4381 states and 7004 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-06 02:41:21,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:21,354 INFO L93 Difference]: Finished difference Result 15703 states and 24849 transitions. [2025-02-06 02:41:21,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:41:21,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 597 [2025-02-06 02:41:21,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:21,407 INFO L225 Difference]: With dead ends: 15703 [2025-02-06 02:41:21,407 INFO L226 Difference]: Without dead ends: 11325 [2025-02-06 02:41:21,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:41:21,422 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 853 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:21,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 1908 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:41:21,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11325 states. [2025-02-06 02:41:21,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11325 to 6941. [2025-02-06 02:41:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6941 states, 6172 states have (on average 1.5573558003888528) internal successors, (9612), 6180 states have internal predecessors, (9612), 752 states have call successors, (752), 16 states have call predecessors, (752), 16 states have return successors, (752), 744 states have call predecessors, (752), 752 states have call successors, (752) [2025-02-06 02:41:21,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6941 states to 6941 states and 11116 transitions. [2025-02-06 02:41:21,763 INFO L78 Accepts]: Start accepts. Automaton has 6941 states and 11116 transitions. Word has length 597 [2025-02-06 02:41:21,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:21,765 INFO L471 AbstractCegarLoop]: Abstraction has 6941 states and 11116 transitions. [2025-02-06 02:41:21,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-06 02:41:21,769 INFO L276 IsEmpty]: Start isEmpty. Operand 6941 states and 11116 transitions. [2025-02-06 02:41:21,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-02-06 02:41:21,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:21,776 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:41:21,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:41:21,777 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:21,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:21,777 INFO L85 PathProgramCache]: Analyzing trace with hash 57440568, now seen corresponding path program 1 times [2025-02-06 02:41:21,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:21,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676514325] [2025-02-06 02:41:21,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:21,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:21,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-02-06 02:41:22,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-02-06 02:41:22,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:22,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-02-06 02:41:23,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:23,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676514325] [2025-02-06 02:41:23,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676514325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:23,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:23,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:41:23,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10755706] [2025-02-06 02:41:23,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:23,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:41:23,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:23,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:41:23,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:41:23,322 INFO L87 Difference]: Start difference. First operand 6941 states and 11116 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-06 02:41:23,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:23,917 INFO L93 Difference]: Finished difference Result 20997 states and 33544 transitions. [2025-02-06 02:41:23,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:41:23,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 597 [2025-02-06 02:41:23,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:23,964 INFO L225 Difference]: With dead ends: 20997 [2025-02-06 02:41:23,965 INFO L226 Difference]: Without dead ends: 13995 [2025-02-06 02:41:23,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:41:23,985 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 807 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:23,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1780 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:41:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13995 states. [2025-02-06 02:41:24,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13995 to 12681. [2025-02-06 02:41:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12681 states, 11768 states have (on average 1.5746091094493542) internal successors, (18530), 11792 states have internal predecessors, (18530), 880 states have call successors, (880), 32 states have call predecessors, (880), 32 states have return successors, (880), 856 states have call predecessors, (880), 880 states have call successors, (880) [2025-02-06 02:41:24,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12681 states to 12681 states and 20290 transitions. [2025-02-06 02:41:24,479 INFO L78 Accepts]: Start accepts. Automaton has 12681 states and 20290 transitions. Word has length 597 [2025-02-06 02:41:24,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:24,480 INFO L471 AbstractCegarLoop]: Abstraction has 12681 states and 20290 transitions. [2025-02-06 02:41:24,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-06 02:41:24,481 INFO L276 IsEmpty]: Start isEmpty. Operand 12681 states and 20290 transitions. [2025-02-06 02:41:24,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-02-06 02:41:24,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:24,489 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:41:24,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:41:24,490 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:24,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:24,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1317954054, now seen corresponding path program 1 times [2025-02-06 02:41:24,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:24,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406275371] [2025-02-06 02:41:24,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:24,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:24,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-02-06 02:41:24,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-02-06 02:41:24,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:24,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:24,750 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-02-06 02:41:24,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:24,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406275371] [2025-02-06 02:41:24,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406275371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:24,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:24,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:24,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007309172] [2025-02-06 02:41:24,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:24,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:24,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:24,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:24,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:24,753 INFO L87 Difference]: Start difference. First operand 12681 states and 20290 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-06 02:41:25,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:25,007 INFO L93 Difference]: Finished difference Result 23657 states and 37870 transitions. [2025-02-06 02:41:25,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:25,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 597 [2025-02-06 02:41:25,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:25,037 INFO L225 Difference]: With dead ends: 23657 [2025-02-06 02:41:25,038 INFO L226 Difference]: Without dead ends: 10979 [2025-02-06 02:41:25,060 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-06 02:41:25,062 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 482 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:25,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 1273 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:25,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10979 states. [2025-02-06 02:41:25,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10979 to 10977. [2025-02-06 02:41:25,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10977 states, 10064 states have (on average 1.5411367249602543) internal successors, (15510), 10088 states have internal predecessors, (15510), 880 states have call successors, (880), 32 states have call predecessors, (880), 32 states have return successors, (880), 856 states have call predecessors, (880), 880 states have call successors, (880) [2025-02-06 02:41:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10977 states to 10977 states and 17270 transitions. [2025-02-06 02:41:25,427 INFO L78 Accepts]: Start accepts. Automaton has 10977 states and 17270 transitions. Word has length 597 [2025-02-06 02:41:25,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:25,428 INFO L471 AbstractCegarLoop]: Abstraction has 10977 states and 17270 transitions. [2025-02-06 02:41:25,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-06 02:41:25,429 INFO L276 IsEmpty]: Start isEmpty. Operand 10977 states and 17270 transitions. [2025-02-06 02:41:25,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-02-06 02:41:25,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:25,436 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:41:25,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:41:25,436 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:25,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:25,437 INFO L85 PathProgramCache]: Analyzing trace with hash 685318521, now seen corresponding path program 1 times [2025-02-06 02:41:25,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:25,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391040459] [2025-02-06 02:41:25,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:25,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:25,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-02-06 02:41:25,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-02-06 02:41:25,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:25,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:25,901 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-02-06 02:41:25,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:25,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391040459] [2025-02-06 02:41:25,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391040459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:25,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:25,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:41:25,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697424191] [2025-02-06 02:41:25,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:25,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:41:25,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:25,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:41:25,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:41:25,903 INFO L87 Difference]: Start difference. First operand 10977 states and 17270 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 2 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 2 states have call predecessors, (91), 2 states have call successors, (91) [2025-02-06 02:41:26,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:26,269 INFO L93 Difference]: Finished difference Result 28538 states and 44852 transitions. [2025-02-06 02:41:26,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:26,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 2 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 2 states have call predecessors, (91), 2 states have call successors, (91) Word has length 597 [2025-02-06 02:41:26,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:26,313 INFO L225 Difference]: With dead ends: 28538 [2025-02-06 02:41:26,314 INFO L226 Difference]: Without dead ends: 17564 [2025-02-06 02:41:26,339 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-06 02:41:26,340 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 627 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:26,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 965 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:26,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17564 states. [2025-02-06 02:41:26,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17564 to 17188. [2025-02-06 02:41:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17188 states, 15726 states have (on average 1.5365636525499173) internal successors, (24164), 15762 states have internal predecessors, (24164), 1411 states have call successors, (1411), 50 states have call predecessors, (1411), 50 states have return successors, (1411), 1375 states have call predecessors, (1411), 1411 states have call successors, (1411) [2025-02-06 02:41:26,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17188 states to 17188 states and 26986 transitions. [2025-02-06 02:41:26,989 INFO L78 Accepts]: Start accepts. Automaton has 17188 states and 26986 transitions. Word has length 597 [2025-02-06 02:41:26,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:26,990 INFO L471 AbstractCegarLoop]: Abstraction has 17188 states and 26986 transitions. [2025-02-06 02:41:26,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 2 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 2 states have call predecessors, (91), 2 states have call successors, (91) [2025-02-06 02:41:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand 17188 states and 26986 transitions. [2025-02-06 02:41:26,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-02-06 02:41:26,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:26,997 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:41:26,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:41:26,998 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:26,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:26,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1134015160, now seen corresponding path program 1 times [2025-02-06 02:41:26,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:26,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715482342] [2025-02-06 02:41:26,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:26,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:27,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-02-06 02:41:28,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-02-06 02:41:28,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:28,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:29,361 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 105 proven. 165 refuted. 0 times theorem prover too weak. 16110 trivial. 0 not checked. [2025-02-06 02:41:29,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:29,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715482342] [2025-02-06 02:41:29,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715482342] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:41:29,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894661893] [2025-02-06 02:41:29,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:29,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:41:29,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:41:29,364 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-06 02:41:29,366 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-06 02:41:29,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-02-06 02:41:29,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-02-06 02:41:29,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:29,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:29,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 1444 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 02:41:29,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:41:30,137 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 6210 proven. 66 refuted. 0 times theorem prover too weak. 10104 trivial. 0 not checked. [2025-02-06 02:41:30,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:41:30,602 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 204 proven. 66 refuted. 0 times theorem prover too weak. 16110 trivial. 0 not checked. [2025-02-06 02:41:30,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894661893] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:41:30,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:41:30,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2025-02-06 02:41:30,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622110632] [2025-02-06 02:41:30,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:41:30,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:41:30,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:30,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:41:30,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:41:30,606 INFO L87 Difference]: Start difference. First operand 17188 states and 26986 transitions. Second operand has 10 states, 10 states have (on average 29.8) internal successors, (298), 10 states have internal predecessors, (298), 4 states have call successors, (168), 2 states have call predecessors, (168), 4 states have return successors, (170), 4 states have call predecessors, (170), 4 states have call successors, (170) [2025-02-06 02:41:32,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:32,251 INFO L93 Difference]: Finished difference Result 42765 states and 67123 transitions. [2025-02-06 02:41:32,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 02:41:32,253 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 29.8) internal successors, (298), 10 states have internal predecessors, (298), 4 states have call successors, (168), 2 states have call predecessors, (168), 4 states have return successors, (170), 4 states have call predecessors, (170), 4 states have call successors, (170) Word has length 597 [2025-02-06 02:41:32,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:32,321 INFO L225 Difference]: With dead ends: 42765 [2025-02-06 02:41:32,321 INFO L226 Difference]: Without dead ends: 25719 [2025-02-06 02:41:32,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1219 GetRequests, 1192 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=538, Unknown=0, NotChecked=0, Total=756 [2025-02-06 02:41:32,360 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 2240 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 1262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2241 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1262 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:32,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2241 Valid, 1273 Invalid, 1988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1262 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 02:41:32,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25719 states. [2025-02-06 02:41:33,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25719 to 25496. [2025-02-06 02:41:33,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25496 states, 23312 states have (on average 1.5217913520933424) internal successors, (35476), 23366 states have internal predecessors, (35476), 2071 states have call successors, (2071), 112 states have call predecessors, (2071), 112 states have return successors, (2071), 2017 states have call predecessors, (2071), 2071 states have call successors, (2071) [2025-02-06 02:41:33,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25496 states to 25496 states and 39618 transitions. [2025-02-06 02:41:33,369 INFO L78 Accepts]: Start accepts. Automaton has 25496 states and 39618 transitions. Word has length 597 [2025-02-06 02:41:33,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:33,370 INFO L471 AbstractCegarLoop]: Abstraction has 25496 states and 39618 transitions. [2025-02-06 02:41:33,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 29.8) internal successors, (298), 10 states have internal predecessors, (298), 4 states have call successors, (168), 2 states have call predecessors, (168), 4 states have return successors, (170), 4 states have call predecessors, (170), 4 states have call successors, (170) [2025-02-06 02:41:33,371 INFO L276 IsEmpty]: Start isEmpty. Operand 25496 states and 39618 transitions. [2025-02-06 02:41:33,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-02-06 02:41:33,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:33,381 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:41:33,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 02:41:33,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:41:33,585 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:33,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:33,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1743921162, now seen corresponding path program 1 times [2025-02-06 02:41:33,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:33,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290264222] [2025-02-06 02:41:33,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:33,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:33,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-02-06 02:41:33,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-02-06 02:41:33,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:33,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:34,192 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-02-06 02:41:34,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:34,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290264222] [2025-02-06 02:41:34,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290264222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:34,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:34,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:41:34,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879091718] [2025-02-06 02:41:34,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:34,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:41:34,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:34,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:41:34,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:41:34,195 INFO L87 Difference]: Start difference. First operand 25496 states and 39618 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-06 02:41:35,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:35,136 INFO L93 Difference]: Finished difference Result 52196 states and 81058 transitions. [2025-02-06 02:41:35,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:41:35,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 598 [2025-02-06 02:41:35,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:35,204 INFO L225 Difference]: With dead ends: 52196 [2025-02-06 02:41:35,204 INFO L226 Difference]: Without dead ends: 26994 [2025-02-06 02:41:35,228 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-06 02:41:35,229 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 377 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:35,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1427 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:41:35,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26994 states. [2025-02-06 02:41:36,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26994 to 26224. [2025-02-06 02:41:36,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26224 states, 24040 states have (on average 1.521089850249584) internal successors, (36567), 24094 states have internal predecessors, (36567), 2071 states have call successors, (2071), 112 states have call predecessors, (2071), 112 states have return successors, (2071), 2017 states have call predecessors, (2071), 2071 states have call successors, (2071) [2025-02-06 02:41:36,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26224 states to 26224 states and 40709 transitions. [2025-02-06 02:41:36,405 INFO L78 Accepts]: Start accepts. Automaton has 26224 states and 40709 transitions. Word has length 598 [2025-02-06 02:41:36,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:36,409 INFO L471 AbstractCegarLoop]: Abstraction has 26224 states and 40709 transitions. [2025-02-06 02:41:36,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-06 02:41:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 26224 states and 40709 transitions. [2025-02-06 02:41:36,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-02-06 02:41:36,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:36,418 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:41:36,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:41:36,420 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:36,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:36,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1875804284, now seen corresponding path program 1 times [2025-02-06 02:41:36,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:36,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154875219] [2025-02-06 02:41:36,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:36,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:36,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-02-06 02:41:39,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-02-06 02:41:39,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:39,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:40,118 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 42 proven. 228 refuted. 0 times theorem prover too weak. 16110 trivial. 0 not checked. [2025-02-06 02:41:40,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:40,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154875219] [2025-02-06 02:41:40,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154875219] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:41:40,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103733017] [2025-02-06 02:41:40,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:40,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:41:40,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:41:40,121 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-06 02:41:40,123 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-06 02:41:40,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-02-06 02:41:40,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-02-06 02:41:40,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:40,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:40,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 02:41:40,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:41:40,697 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 6388 proven. 69 refuted. 0 times theorem prover too weak. 9923 trivial. 0 not checked. [2025-02-06 02:41:40,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:41:41,054 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 201 proven. 69 refuted. 0 times theorem prover too weak. 16110 trivial. 0 not checked. [2025-02-06 02:41:41,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103733017] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:41:41,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:41:41,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-06 02:41:41,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796103322] [2025-02-06 02:41:41,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:41:41,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:41:41,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:41,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:41:41,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:41:41,058 INFO L87 Difference]: Start difference. First operand 26224 states and 40709 transitions. Second operand has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 3 states have call successors, (190), 2 states have call predecessors, (190), 4 states have return successors, (192), 3 states have call predecessors, (192), 3 states have call successors, (192) [2025-02-06 02:41:42,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:42,984 INFO L93 Difference]: Finished difference Result 46894 states and 72538 transitions. [2025-02-06 02:41:42,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 02:41:42,985 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 3 states have call successors, (190), 2 states have call predecessors, (190), 4 states have return successors, (192), 3 states have call predecessors, (192), 3 states have call successors, (192) Word has length 598 [2025-02-06 02:41:42,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:43,046 INFO L225 Difference]: With dead ends: 46894 [2025-02-06 02:41:43,046 INFO L226 Difference]: Without dead ends: 21284 [2025-02-06 02:41:43,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1228 GetRequests, 1194 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=316, Invalid=806, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 02:41:43,077 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 2009 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 751 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2009 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 2012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 751 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:43,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2009 Valid, 1625 Invalid, 2012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [751 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 02:41:43,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21284 states. [2025-02-06 02:41:43,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21284 to 17366. [2025-02-06 02:41:43,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17366 states, 15252 states have (on average 1.4769210595331759) internal successors, (22526), 15294 states have internal predecessors, (22526), 1975 states have call successors, (1975), 138 states have call predecessors, (1975), 138 states have return successors, (1975), 1933 states have call predecessors, (1975), 1975 states have call successors, (1975) [2025-02-06 02:41:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17366 states to 17366 states and 26476 transitions. [2025-02-06 02:41:43,909 INFO L78 Accepts]: Start accepts. Automaton has 17366 states and 26476 transitions. Word has length 598 [2025-02-06 02:41:43,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:43,910 INFO L471 AbstractCegarLoop]: Abstraction has 17366 states and 26476 transitions. [2025-02-06 02:41:43,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 3 states have call successors, (190), 2 states have call predecessors, (190), 4 states have return successors, (192), 3 states have call predecessors, (192), 3 states have call successors, (192) [2025-02-06 02:41:43,910 INFO L276 IsEmpty]: Start isEmpty. Operand 17366 states and 26476 transitions. [2025-02-06 02:41:43,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-02-06 02:41:43,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:43,915 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:41:43,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 02:41:44,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:41:44,120 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:44,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:44,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1255493252, now seen corresponding path program 1 times [2025-02-06 02:41:44,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:44,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348844026] [2025-02-06 02:41:44,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:44,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:44,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-02-06 02:41:44,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-02-06 02:41:44,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:44,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:45,097 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-02-06 02:41:45,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:45,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348844026] [2025-02-06 02:41:45,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348844026] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:45,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:45,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:41:45,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118424321] [2025-02-06 02:41:45,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:45,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:41:45,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:45,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:41:45,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:41:45,099 INFO L87 Difference]: Start difference. First operand 17366 states and 26476 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-06 02:41:46,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:46,115 INFO L93 Difference]: Finished difference Result 46054 states and 69875 transitions. [2025-02-06 02:41:46,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:41:46,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 598 [2025-02-06 02:41:46,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:46,187 INFO L225 Difference]: With dead ends: 46054 [2025-02-06 02:41:46,188 INFO L226 Difference]: Without dead ends: 26904 [2025-02-06 02:41:46,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:41:46,217 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 706 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 2342 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:46,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 2342 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:41:46,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26904 states. [2025-02-06 02:41:47,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26904 to 20904. [2025-02-06 02:41:47,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20904 states, 17350 states have (on average 1.445763688760807) internal successors, (25084), 17422 states have internal predecessors, (25084), 3319 states have call successors, (3319), 234 states have call predecessors, (3319), 234 states have return successors, (3319), 3247 states have call predecessors, (3319), 3319 states have call successors, (3319) [2025-02-06 02:41:47,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20904 states to 20904 states and 31722 transitions. [2025-02-06 02:41:47,381 INFO L78 Accepts]: Start accepts. Automaton has 20904 states and 31722 transitions. Word has length 598 [2025-02-06 02:41:47,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:47,383 INFO L471 AbstractCegarLoop]: Abstraction has 20904 states and 31722 transitions. [2025-02-06 02:41:47,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-06 02:41:47,383 INFO L276 IsEmpty]: Start isEmpty. Operand 20904 states and 31722 transitions. [2025-02-06 02:41:47,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-02-06 02:41:47,387 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:47,387 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:41:47,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 02:41:47,387 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:47,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:47,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1353964351, now seen corresponding path program 1 times [2025-02-06 02:41:47,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:47,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53423587] [2025-02-06 02:41:47,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:47,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:47,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-02-06 02:41:47,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-02-06 02:41:47,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:47,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:48,340 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-02-06 02:41:48,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:48,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53423587] [2025-02-06 02:41:48,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53423587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:48,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:48,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:41:48,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534107000] [2025-02-06 02:41:48,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:48,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:41:48,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:48,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:41:48,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:41:48,343 INFO L87 Difference]: Start difference. First operand 20904 states and 31722 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-06 02:41:49,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:49,788 INFO L93 Difference]: Finished difference Result 46118 states and 69881 transitions. [2025-02-06 02:41:49,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:41:49,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 598 [2025-02-06 02:41:49,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:49,852 INFO L225 Difference]: With dead ends: 46118 [2025-02-06 02:41:49,853 INFO L226 Difference]: Without dead ends: 25583 [2025-02-06 02:41:49,877 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-06 02:41:49,877 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 717 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1770 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:49,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1770 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:41:49,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25583 states. [2025-02-06 02:41:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25583 to 19878. [2025-02-06 02:41:51,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19878 states, 15838 states have (on average 1.4144462684682408) internal successors, (22402), 15910 states have internal predecessors, (22402), 3769 states have call successors, (3769), 270 states have call predecessors, (3769), 270 states have return successors, (3769), 3697 states have call predecessors, (3769), 3769 states have call successors, (3769) [2025-02-06 02:41:51,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19878 states to 19878 states and 29940 transitions. [2025-02-06 02:41:51,171 INFO L78 Accepts]: Start accepts. Automaton has 19878 states and 29940 transitions. Word has length 598 [2025-02-06 02:41:51,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:51,172 INFO L471 AbstractCegarLoop]: Abstraction has 19878 states and 29940 transitions. [2025-02-06 02:41:51,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-06 02:41:51,172 INFO L276 IsEmpty]: Start isEmpty. Operand 19878 states and 29940 transitions. [2025-02-06 02:41:51,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-02-06 02:41:51,178 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:51,179 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:41:51,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 02:41:51,179 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:51,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:51,179 INFO L85 PathProgramCache]: Analyzing trace with hash 945140126, now seen corresponding path program 1 times [2025-02-06 02:41:51,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:51,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674780561] [2025-02-06 02:41:51,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:51,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:51,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-02-06 02:41:52,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-02-06 02:41:52,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:52,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:53,043 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 9 proven. 261 refuted. 0 times theorem prover too weak. 16110 trivial. 0 not checked. [2025-02-06 02:41:53,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:53,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674780561] [2025-02-06 02:41:53,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674780561] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:41:53,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824514111] [2025-02-06 02:41:53,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:53,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:41:53,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:41:53,046 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-06 02:41:53,049 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-06 02:41:53,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-02-06 02:41:53,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-02-06 02:41:53,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:53,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:53,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 1450 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 02:41:53,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:41:55,573 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 11375 proven. 510 refuted. 0 times theorem prover too weak. 4495 trivial. 0 not checked. [2025-02-06 02:41:55,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:41:56,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824514111] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:41:56,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 02:41:56,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17] total 18 [2025-02-06 02:41:56,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828800967] [2025-02-06 02:41:56,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 02:41:56,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 02:41:56,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:56,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 02:41:56,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2025-02-06 02:41:56,665 INFO L87 Difference]: Start difference. First operand 19878 states and 29940 transitions. Second operand has 18 states, 18 states have (on average 13.333333333333334) internal successors, (240), 17 states have internal predecessors, (240), 6 states have call successors, (178), 5 states have call predecessors, (178), 8 states have return successors, (179), 6 states have call predecessors, (179), 6 states have call successors, (179) [2025-02-06 02:42:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:00,480 INFO L93 Difference]: Finished difference Result 41532 states and 61228 transitions. [2025-02-06 02:42:00,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-06 02:42:00,484 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 13.333333333333334) internal successors, (240), 17 states have internal predecessors, (240), 6 states have call successors, (178), 5 states have call predecessors, (178), 8 states have return successors, (179), 6 states have call predecessors, (179), 6 states have call successors, (179) Word has length 598 [2025-02-06 02:42:00,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:00,562 INFO L225 Difference]: With dead ends: 41532 [2025-02-06 02:42:00,562 INFO L226 Difference]: Without dead ends: 21716 [2025-02-06 02:42:00,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 675 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=650, Invalid=2320, Unknown=0, NotChecked=0, Total=2970 [2025-02-06 02:42:00,602 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 1788 mSDsluCounter, 1962 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1790 SdHoareTripleChecker+Valid, 2345 SdHoareTripleChecker+Invalid, 2680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:00,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1790 Valid, 2345 Invalid, 2680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 02:42:00,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21716 states. [2025-02-06 02:42:01,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21716 to 10100. [2025-02-06 02:42:01,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10100 states, 7951 states have (on average 1.3795748962394667) internal successors, (10969), 7963 states have internal predecessors, (10969), 1885 states have call successors, (1885), 263 states have call predecessors, (1885), 263 states have return successors, (1885), 1873 states have call predecessors, (1885), 1885 states have call successors, (1885) [2025-02-06 02:42:01,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10100 states to 10100 states and 14739 transitions. [2025-02-06 02:42:01,412 INFO L78 Accepts]: Start accepts. Automaton has 10100 states and 14739 transitions. Word has length 598 [2025-02-06 02:42:01,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:01,413 INFO L471 AbstractCegarLoop]: Abstraction has 10100 states and 14739 transitions. [2025-02-06 02:42:01,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 13.333333333333334) internal successors, (240), 17 states have internal predecessors, (240), 6 states have call successors, (178), 5 states have call predecessors, (178), 8 states have return successors, (179), 6 states have call predecessors, (179), 6 states have call successors, (179) [2025-02-06 02:42:01,413 INFO L276 IsEmpty]: Start isEmpty. Operand 10100 states and 14739 transitions. [2025-02-06 02:42:01,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-02-06 02:42:01,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:01,417 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:42:01,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 02:42:01,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 02:42:01,621 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:01,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:01,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1351815168, now seen corresponding path program 1 times [2025-02-06 02:42:01,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:01,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594006920] [2025-02-06 02:42:01,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:01,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:01,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-02-06 02:42:04,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-02-06 02:42:04,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:04,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:04,871 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 75 proven. 195 refuted. 0 times theorem prover too weak. 16110 trivial. 0 not checked. [2025-02-06 02:42:04,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:04,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594006920] [2025-02-06 02:42:04,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594006920] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:42:04,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568884270] [2025-02-06 02:42:04,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:04,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:42:04,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:42:04,874 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:42:04,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 02:42:05,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-02-06 02:42:05,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-02-06 02:42:05,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:05,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:05,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 02:42:05,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:42:05,749 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 6640 proven. 195 refuted. 0 times theorem prover too weak. 9545 trivial. 0 not checked. [2025-02-06 02:42:05,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:42:06,167 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 75 proven. 195 refuted. 0 times theorem prover too weak. 16110 trivial. 0 not checked. [2025-02-06 02:42:06,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568884270] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:42:06,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:42:06,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-02-06 02:42:06,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144695344] [2025-02-06 02:42:06,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:42:06,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 02:42:06,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:06,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 02:42:06,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:42:06,170 INFO L87 Difference]: Start difference. First operand 10100 states and 14739 transitions. Second operand has 13 states, 13 states have (on average 23.53846153846154) internal successors, (306), 13 states have internal predecessors, (306), 5 states have call successors, (247), 2 states have call predecessors, (247), 4 states have return successors, (248), 5 states have call predecessors, (248), 5 states have call successors, (248) [2025-02-06 02:42:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:08,147 INFO L93 Difference]: Finished difference Result 26290 states and 38098 transitions. [2025-02-06 02:42:08,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 02:42:08,148 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 23.53846153846154) internal successors, (306), 13 states have internal predecessors, (306), 5 states have call successors, (247), 2 states have call predecessors, (247), 4 states have return successors, (248), 5 states have call predecessors, (248), 5 states have call successors, (248) Word has length 599 [2025-02-06 02:42:08,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:08,192 INFO L225 Difference]: With dead ends: 26290 [2025-02-06 02:42:08,192 INFO L226 Difference]: Without dead ends: 16486 [2025-02-06 02:42:08,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1217 GetRequests, 1195 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2025-02-06 02:42:08,206 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 1578 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1579 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:08,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1579 Valid, 1694 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 02:42:08,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16486 states. [2025-02-06 02:42:09,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16486 to 16082. [2025-02-06 02:42:09,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16082 states, 13162 states have (on average 1.3929493997872664) internal successors, (18334), 13204 states have internal predecessors, (18334), 2491 states have call successors, (2491), 428 states have call predecessors, (2491), 428 states have return successors, (2491), 2449 states have call predecessors, (2491), 2491 states have call successors, (2491) [2025-02-06 02:42:09,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16082 states to 16082 states and 23316 transitions. [2025-02-06 02:42:09,162 INFO L78 Accepts]: Start accepts. Automaton has 16082 states and 23316 transitions. Word has length 599 [2025-02-06 02:42:09,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:09,163 INFO L471 AbstractCegarLoop]: Abstraction has 16082 states and 23316 transitions. [2025-02-06 02:42:09,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 23.53846153846154) internal successors, (306), 13 states have internal predecessors, (306), 5 states have call successors, (247), 2 states have call predecessors, (247), 4 states have return successors, (248), 5 states have call predecessors, (248), 5 states have call successors, (248) [2025-02-06 02:42:09,163 INFO L276 IsEmpty]: Start isEmpty. Operand 16082 states and 23316 transitions. [2025-02-06 02:42:09,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-02-06 02:42:09,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:09,166 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:42:09,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 02:42:09,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 02:42:09,367 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:09,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:09,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1982273793, now seen corresponding path program 1 times [2025-02-06 02:42:09,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:09,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687652505] [2025-02-06 02:42:09,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:09,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:09,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-02-06 02:42:10,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-02-06 02:42:10,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:10,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:14,299 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 534 proven. 510 refuted. 0 times theorem prover too weak. 15336 trivial. 0 not checked. [2025-02-06 02:42:14,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:14,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687652505] [2025-02-06 02:42:14,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687652505] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:42:14,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999814592] [2025-02-06 02:42:14,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:14,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:42:14,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:42:14,302 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:42:14,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 02:42:14,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-02-06 02:42:14,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-02-06 02:42:14,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:14,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:14,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-06 02:42:14,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:42:22,053 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 13096 proven. 864 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2025-02-06 02:42:22,053 INFO L312 TraceCheckSpWp]: Computing backward predicates...