./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.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 0cbadd5c8de40e45d11c8c9bd5d5aa33e26bba45cb60181d9a1abcae7f03bb4b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:00:18,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:00:18,074 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 23:00:18,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:00:18,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:00:18,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:00:18,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:00:18,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:00:18,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:00:18,098 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:00:18,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:00:18,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:00:18,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:00:18,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:00:18,099 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:00:18,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:00:18,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:00:18,099 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:00:18,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 23:00:18,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:00:18,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:00:18,100 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:00:18,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:00:18,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:00:18,100 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:00:18,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:00:18,100 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:00:18,100 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:00:18,100 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:00:18,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:00:18,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:00:18,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:00:18,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:00:18,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:00:18,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:00:18,101 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:00:18,101 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:00:18,102 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 23:00:18,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 23:00:18,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:00:18,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:00:18,102 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:00:18,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:00:18,102 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 -> 0cbadd5c8de40e45d11c8c9bd5d5aa33e26bba45cb60181d9a1abcae7f03bb4b [2025-02-05 23:00:18,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:00:18,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:00:18,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:00:18,360 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:00:18,360 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:00:18,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.i [2025-02-05 23:00:19,417 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/04cd9aceb/e3029fb26e354ba7bcab5f82a3f0be42/FLAGa979ab9f4 [2025-02-05 23:00:19,706 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:00:19,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.i [2025-02-05 23:00:19,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/04cd9aceb/e3029fb26e354ba7bcab5f82a3f0be42/FLAGa979ab9f4 [2025-02-05 23:00:20,007 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/04cd9aceb/e3029fb26e354ba7bcab5f82a3f0be42 [2025-02-05 23:00:20,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:00:20,011 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:00:20,012 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:00:20,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:00:20,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:00:20,016 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:00:20" (1/1) ... [2025-02-05 23:00:20,018 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3641e6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:00:20, skipping insertion in model container [2025-02-05 23:00:20,018 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:00:20" (1/1) ... [2025-02-05 23:00:20,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:00:20,123 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.i[919,932] [2025-02-05 23:00:20,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:00:20,168 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:00:20,175 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.i[919,932] [2025-02-05 23:00:20,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:00:20,211 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:00:20,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:00:20 WrapperNode [2025-02-05 23:00:20,212 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:00:20,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:00:20,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:00:20,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:00:20,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:00:20" (1/1) ... [2025-02-05 23:00:20,222 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:00:20" (1/1) ... [2025-02-05 23:00:20,241 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2025-02-05 23:00:20,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:00:20,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:00:20,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:00:20,242 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:00:20,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:00:20" (1/1) ... [2025-02-05 23:00:20,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:00:20" (1/1) ... [2025-02-05 23:00:20,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:00:20" (1/1) ... [2025-02-05 23:00:20,265 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 23:00:20,265 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:00:20" (1/1) ... [2025-02-05 23:00:20,265 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:00:20" (1/1) ... [2025-02-05 23:00:20,270 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:00:20" (1/1) ... [2025-02-05 23:00:20,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:00:20" (1/1) ... [2025-02-05 23:00:20,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:00:20" (1/1) ... [2025-02-05 23:00:20,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:00:20" (1/1) ... [2025-02-05 23:00:20,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:00:20,274 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:00:20,274 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:00:20,275 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:00:20,275 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:00:20" (1/1) ... [2025-02-05 23:00:20,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:00:20,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:00:20,309 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 23:00:20,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 23:00:20,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:00:20,332 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:00:20,332 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:00:20,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 23:00:20,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:00:20,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:00:20,403 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:00:20,404 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:00:20,678 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-05 23:00:20,680 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:00:20,689 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:00:20,691 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 23:00:20,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:00:20 BoogieIcfgContainer [2025-02-05 23:00:20,691 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:00:20,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:00:20,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:00:20,697 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:00:20,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:00:20" (1/3) ... [2025-02-05 23:00:20,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5f5a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:00:20, skipping insertion in model container [2025-02-05 23:00:20,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:00:20" (2/3) ... [2025-02-05 23:00:20,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5f5a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:00:20, skipping insertion in model container [2025-02-05 23:00:20,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:00:20" (3/3) ... [2025-02-05 23:00:20,700 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.i [2025-02-05 23:00:20,709 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:00:20,711 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:00:20,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:00:20,759 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;@f9585c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:00:20,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:00:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-05 23:00:20,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 23:00:20,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:00:20,777 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:00:20,777 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:00:20,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:00:20,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1479191098, now seen corresponding path program 1 times [2025-02-05 23:00:20,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:00:20,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744560700] [2025-02-05 23:00:20,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:00:20,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:00:20,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 23:00:20,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 23:00:20,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:00:20,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:00:21,030 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-02-05 23:00:21,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:00:21,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744560700] [2025-02-05 23:00:21,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744560700] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:00:21,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396729130] [2025-02-05 23:00:21,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:00:21,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:00:21,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:00:21,035 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 23:00:21,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 23:00:21,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 23:00:21,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 23:00:21,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:00:21,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:00:21,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:00:21,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:00:21,204 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-02-05 23:00:21,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:00:21,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396729130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:00:21,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 23:00:21,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 23:00:21,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27969165] [2025-02-05 23:00:21,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:00:21,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:00:21,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:00:21,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:00:21,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:00:21,229 INFO L87 Difference]: Start difference. First operand has 80 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 23:00:21,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:00:21,254 INFO L93 Difference]: Finished difference Result 154 states and 269 transitions. [2025-02-05 23:00:21,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:00:21,256 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 149 [2025-02-05 23:00:21,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:00:21,261 INFO L225 Difference]: With dead ends: 154 [2025-02-05 23:00:21,262 INFO L226 Difference]: Without dead ends: 77 [2025-02-05 23:00:21,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:00:21,268 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:00:21,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:00:21,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-05 23:00:21,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-05 23:00:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 53 states have internal predecessors, (77), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-05 23:00:21,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 121 transitions. [2025-02-05 23:00:21,298 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 121 transitions. Word has length 149 [2025-02-05 23:00:21,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:00:21,298 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 121 transitions. [2025-02-05 23:00:21,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 23:00:21,299 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 121 transitions. [2025-02-05 23:00:21,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 23:00:21,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:00:21,301 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:00:21,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 23:00:21,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 23:00:21,505 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:00:21,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:00:21,507 INFO L85 PathProgramCache]: Analyzing trace with hash 2111041848, now seen corresponding path program 1 times [2025-02-05 23:00:21,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:00:21,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376844462] [2025-02-05 23:00:21,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:00:21,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:00:21,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 23:00:21,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 23:00:21,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:00:21,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:00:22,050 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:00:22,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:00:22,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376844462] [2025-02-05 23:00:22,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376844462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:00:22,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:00:22,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 23:00:22,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067110765] [2025-02-05 23:00:22,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:00:22,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 23:00:22,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:00:22,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 23:00:22,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 23:00:22,052 INFO L87 Difference]: Start difference. First operand 77 states and 121 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:00:22,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:00:22,361 INFO L93 Difference]: Finished difference Result 251 states and 405 transitions. [2025-02-05 23:00:22,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 23:00:22,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2025-02-05 23:00:22,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:00:22,365 INFO L225 Difference]: With dead ends: 251 [2025-02-05 23:00:22,365 INFO L226 Difference]: Without dead ends: 177 [2025-02-05 23:00:22,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-02-05 23:00:22,366 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 148 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:00:22,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 453 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:00:22,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-02-05 23:00:22,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 139. [2025-02-05 23:00:22,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-05 23:00:22,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 217 transitions. [2025-02-05 23:00:22,405 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 217 transitions. Word has length 149 [2025-02-05 23:00:22,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:00:22,405 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 217 transitions. [2025-02-05 23:00:22,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:00:22,405 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 217 transitions. [2025-02-05 23:00:22,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 23:00:22,408 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:00:22,408 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:00:22,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 23:00:22,408 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:00:22,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:00:22,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1266569977, now seen corresponding path program 1 times [2025-02-05 23:00:22,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:00:22,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189300520] [2025-02-05 23:00:22,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:00:22,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:00:22,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 23:00:22,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 23:00:22,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:00:22,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:00:23,217 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:00:23,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:00:23,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189300520] [2025-02-05 23:00:23,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189300520] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:00:23,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:00:23,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 23:00:23,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102918581] [2025-02-05 23:00:23,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:00:23,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 23:00:23,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:00:23,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 23:00:23,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 23:00:23,219 INFO L87 Difference]: Start difference. First operand 139 states and 217 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 23:00:23,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:00:23,542 INFO L93 Difference]: Finished difference Result 263 states and 424 transitions. [2025-02-05 23:00:23,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 23:00:23,543 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 149 [2025-02-05 23:00:23,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:00:23,545 INFO L225 Difference]: With dead ends: 263 [2025-02-05 23:00:23,545 INFO L226 Difference]: Without dead ends: 189 [2025-02-05 23:00:23,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-02-05 23:00:23,546 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 161 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:00:23,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 412 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:00:23,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-05 23:00:23,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 144. [2025-02-05 23:00:23,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 96 states have (on average 1.4375) internal successors, (138), 96 states have internal predecessors, (138), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-05 23:00:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 226 transitions. [2025-02-05 23:00:23,569 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 226 transitions. Word has length 149 [2025-02-05 23:00:23,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:00:23,569 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 226 transitions. [2025-02-05 23:00:23,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 23:00:23,570 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 226 transitions. [2025-02-05 23:00:23,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 23:00:23,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:00:23,571 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:00:23,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 23:00:23,571 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:00:23,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:00:23,572 INFO L85 PathProgramCache]: Analyzing trace with hash -884279417, now seen corresponding path program 1 times [2025-02-05 23:00:23,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:00:23,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007299962] [2025-02-05 23:00:23,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:00:23,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:00:23,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 23:00:23,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 23:00:23,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:00:23,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:00:26,437 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:00:26,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:00:26,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007299962] [2025-02-05 23:00:26,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007299962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:00:26,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:00:26,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 23:00:26,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180250949] [2025-02-05 23:00:26,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:00:26,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 23:00:26,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:00:26,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 23:00:26,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-02-05 23:00:26,441 INFO L87 Difference]: Start difference. First operand 144 states and 226 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:00:27,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:00:27,367 INFO L93 Difference]: Finished difference Result 388 states and 593 transitions. [2025-02-05 23:00:27,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 23:00:27,368 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-02-05 23:00:27,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:00:27,370 INFO L225 Difference]: With dead ends: 388 [2025-02-05 23:00:27,370 INFO L226 Difference]: Without dead ends: 314 [2025-02-05 23:00:27,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-02-05 23:00:27,371 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 238 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 23:00:27,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 735 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 23:00:27,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-02-05 23:00:27,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 222. [2025-02-05 23:00:27,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 169 states have (on average 1.4911242603550297) internal successors, (252), 170 states have internal predecessors, (252), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 23:00:27,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 348 transitions. [2025-02-05 23:00:27,404 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 348 transitions. Word has length 150 [2025-02-05 23:00:27,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:00:27,405 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 348 transitions. [2025-02-05 23:00:27,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:00:27,405 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 348 transitions. [2025-02-05 23:00:27,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 23:00:27,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:00:27,408 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:00:27,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 23:00:27,408 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:00:27,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:00:27,408 INFO L85 PathProgramCache]: Analyzing trace with hash -883355896, now seen corresponding path program 1 times [2025-02-05 23:00:27,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:00:27,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480964539] [2025-02-05 23:00:27,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:00:27,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:00:27,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 23:00:27,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 23:00:27,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:00:27,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:00:31,046 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:00:31,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:00:31,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480964539] [2025-02-05 23:00:31,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480964539] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:00:31,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:00:31,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 23:00:31,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596810751] [2025-02-05 23:00:31,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:00:31,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 23:00:31,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:00:31,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 23:00:31,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-02-05 23:00:31,048 INFO L87 Difference]: Start difference. First operand 222 states and 348 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:00:32,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:00:32,055 INFO L93 Difference]: Finished difference Result 314 states and 464 transitions. [2025-02-05 23:00:32,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 23:00:32,056 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-02-05 23:00:32,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:00:32,057 INFO L225 Difference]: With dead ends: 314 [2025-02-05 23:00:32,057 INFO L226 Difference]: Without dead ends: 312 [2025-02-05 23:00:32,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-02-05 23:00:32,058 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 266 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 23:00:32,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 639 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 23:00:32,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-02-05 23:00:32,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 222. [2025-02-05 23:00:32,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 169 states have (on average 1.4911242603550297) internal successors, (252), 170 states have internal predecessors, (252), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 23:00:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 348 transitions. [2025-02-05 23:00:32,071 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 348 transitions. Word has length 150 [2025-02-05 23:00:32,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:00:32,071 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 348 transitions. [2025-02-05 23:00:32,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:00:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 348 transitions. [2025-02-05 23:00:32,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 23:00:32,073 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:00:32,073 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:00:32,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 23:00:32,073 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:00:32,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:00:32,078 INFO L85 PathProgramCache]: Analyzing trace with hash -755196698, now seen corresponding path program 1 times [2025-02-05 23:00:32,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:00:32,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622351783] [2025-02-05 23:00:32,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:00:32,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:00:32,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 23:00:32,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 23:00:32,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:00:32,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:00:34,715 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:00:34,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:00:34,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622351783] [2025-02-05 23:00:34,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622351783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:00:34,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:00:34,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 23:00:34,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163838983] [2025-02-05 23:00:34,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:00:34,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 23:00:34,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:00:34,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 23:00:34,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-02-05 23:00:34,719 INFO L87 Difference]: Start difference. First operand 222 states and 348 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:00:35,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:00:35,630 INFO L93 Difference]: Finished difference Result 323 states and 475 transitions. [2025-02-05 23:00:35,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 23:00:35,633 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-02-05 23:00:35,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:00:35,637 INFO L225 Difference]: With dead ends: 323 [2025-02-05 23:00:35,637 INFO L226 Difference]: Without dead ends: 321 [2025-02-05 23:00:35,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-02-05 23:00:35,638 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 276 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 23:00:35,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 547 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 23:00:35,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-02-05 23:00:35,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 230. [2025-02-05 23:00:35,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 177 states have (on average 1.4915254237288136) internal successors, (264), 178 states have internal predecessors, (264), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 23:00:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 360 transitions. [2025-02-05 23:00:35,657 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 360 transitions. Word has length 150 [2025-02-05 23:00:35,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:00:35,657 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 360 transitions. [2025-02-05 23:00:35,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:00:35,657 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 360 transitions. [2025-02-05 23:00:35,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 23:00:35,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:00:35,658 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:00:35,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 23:00:35,660 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:00:35,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:00:35,660 INFO L85 PathProgramCache]: Analyzing trace with hash -754273177, now seen corresponding path program 1 times [2025-02-05 23:00:35,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:00:35,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500049683] [2025-02-05 23:00:35,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:00:35,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:00:35,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 23:00:35,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 23:00:35,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:00:35,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:00:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:00:39,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:00:39,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500049683] [2025-02-05 23:00:39,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500049683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:00:39,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:00:39,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 23:00:39,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520708373] [2025-02-05 23:00:39,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:00:39,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 23:00:39,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:00:39,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 23:00:39,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-02-05 23:00:39,369 INFO L87 Difference]: Start difference. First operand 230 states and 360 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:00:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:00:40,602 INFO L93 Difference]: Finished difference Result 321 states and 473 transitions. [2025-02-05 23:00:40,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 23:00:40,602 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-02-05 23:00:40,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:00:40,604 INFO L225 Difference]: With dead ends: 321 [2025-02-05 23:00:40,604 INFO L226 Difference]: Without dead ends: 319 [2025-02-05 23:00:40,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-02-05 23:00:40,605 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 290 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 23:00:40,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 628 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 23:00:40,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-02-05 23:00:40,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 222. [2025-02-05 23:00:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 169 states have (on average 1.4911242603550297) internal successors, (252), 170 states have internal predecessors, (252), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 23:00:40,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 348 transitions. [2025-02-05 23:00:40,616 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 348 transitions. Word has length 150 [2025-02-05 23:00:40,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:00:40,616 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 348 transitions. [2025-02-05 23:00:40,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:00:40,616 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 348 transitions. [2025-02-05 23:00:40,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 23:00:40,617 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:00:40,617 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:00:40,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 23:00:40,617 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:00:40,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:00:40,618 INFO L85 PathProgramCache]: Analyzing trace with hash 469030280, now seen corresponding path program 1 times [2025-02-05 23:00:40,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:00:40,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005447529] [2025-02-05 23:00:40,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:00:40,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:00:40,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 23:00:40,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 23:00:40,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:00:40,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:00:40,650 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:00:40,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:00:40,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005447529] [2025-02-05 23:00:40,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005447529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:00:40,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:00:40,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:00:40,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374624194] [2025-02-05 23:00:40,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:00:40,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:00:40,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:00:40,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:00:40,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:00:40,652 INFO L87 Difference]: Start difference. First operand 222 states and 348 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:00:40,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:00:40,691 INFO L93 Difference]: Finished difference Result 494 states and 777 transitions. [2025-02-05 23:00:40,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:00:40,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-02-05 23:00:40,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:00:40,694 INFO L225 Difference]: With dead ends: 494 [2025-02-05 23:00:40,694 INFO L226 Difference]: Without dead ends: 348 [2025-02-05 23:00:40,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:00:40,695 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 101 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:00:40,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 316 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:00:40,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-02-05 23:00:40,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 346. [2025-02-05 23:00:40,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 265 states have (on average 1.441509433962264) internal successors, (382), 267 states have internal predecessors, (382), 74 states have call successors, (74), 6 states have call predecessors, (74), 6 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-02-05 23:00:40,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 530 transitions. [2025-02-05 23:00:40,716 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 530 transitions. Word has length 150 [2025-02-05 23:00:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:00:40,716 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 530 transitions. [2025-02-05 23:00:40,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:00:40,716 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 530 transitions. [2025-02-05 23:00:40,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 23:00:40,717 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:00:40,718 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:00:40,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 23:00:40,718 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:00:40,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:00:40,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1327921079, now seen corresponding path program 1 times [2025-02-05 23:00:40,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:00:40,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817112707] [2025-02-05 23:00:40,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:00:40,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:00:40,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 23:00:40,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 23:00:40,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:00:40,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:00:40,778 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:00:40,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:00:40,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817112707] [2025-02-05 23:00:40,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817112707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:00:40,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:00:40,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 23:00:40,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069488232] [2025-02-05 23:00:40,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:00:40,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 23:00:40,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:00:40,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 23:00:40,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:00:40,780 INFO L87 Difference]: Start difference. First operand 346 states and 530 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:00:40,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:00:40,960 INFO L93 Difference]: Finished difference Result 780 states and 1175 transitions. [2025-02-05 23:00:40,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 23:00:40,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-02-05 23:00:40,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:00:40,963 INFO L225 Difference]: With dead ends: 780 [2025-02-05 23:00:40,963 INFO L226 Difference]: Without dead ends: 527 [2025-02-05 23:00:40,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:00:40,964 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 101 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:00:40,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 400 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:00:40,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-02-05 23:00:40,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 476. [2025-02-05 23:00:40,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 366 states have (on average 1.4262295081967213) internal successors, (522), 369 states have internal predecessors, (522), 100 states have call successors, (100), 9 states have call predecessors, (100), 9 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-05 23:00:40,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 722 transitions. [2025-02-05 23:00:40,989 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 722 transitions. Word has length 150 [2025-02-05 23:00:40,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:00:40,989 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 722 transitions. [2025-02-05 23:00:40,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:00:40,989 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 722 transitions. [2025-02-05 23:00:40,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 23:00:40,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:00:40,991 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:00:40,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 23:00:40,991 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:00:40,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:00:40,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1198838360, now seen corresponding path program 1 times [2025-02-05 23:00:40,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:00:40,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619789888] [2025-02-05 23:00:40,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:00:40,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:00:40,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 23:00:41,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 23:00:41,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:00:41,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:00:42,427 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:00:42,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:00:42,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619789888] [2025-02-05 23:00:42,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619789888] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:00:42,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:00:42,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 23:00:42,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183484491] [2025-02-05 23:00:42,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:00:42,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 23:00:42,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:00:42,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 23:00:42,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-02-05 23:00:42,429 INFO L87 Difference]: Start difference. First operand 476 states and 722 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:00:43,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:00:43,348 INFO L93 Difference]: Finished difference Result 646 states and 926 transitions. [2025-02-05 23:00:43,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 23:00:43,349 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-02-05 23:00:43,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:00:43,353 INFO L225 Difference]: With dead ends: 646 [2025-02-05 23:00:43,353 INFO L226 Difference]: Without dead ends: 644 [2025-02-05 23:00:43,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-02-05 23:00:43,354 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 326 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 23:00:43,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 682 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 23:00:43,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-02-05 23:00:43,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 548. [2025-02-05 23:00:43,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 427 states have (on average 1.405152224824356) internal successors, (600), 432 states have internal predecessors, (600), 108 states have call successors, (108), 12 states have call predecessors, (108), 12 states have return successors, (108), 103 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-05 23:00:43,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 816 transitions. [2025-02-05 23:00:43,398 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 816 transitions. Word has length 150 [2025-02-05 23:00:43,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:00:43,399 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 816 transitions. [2025-02-05 23:00:43,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:00:43,399 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 816 transitions. [2025-02-05 23:00:43,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 23:00:43,401 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:00:43,401 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:00:43,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 23:00:43,401 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:00:43,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:00:43,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1197914839, now seen corresponding path program 1 times [2025-02-05 23:00:43,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:00:43,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689791842] [2025-02-05 23:00:43,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:00:43,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:00:43,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 23:00:43,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 23:00:43,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:00:43,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:00:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:00:45,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:00:45,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689791842] [2025-02-05 23:00:45,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689791842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:00:45,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:00:45,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 23:00:45,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935666600] [2025-02-05 23:00:45,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:00:45,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 23:00:45,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:00:45,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 23:00:45,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-02-05 23:00:45,730 INFO L87 Difference]: Start difference. First operand 548 states and 816 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:00:47,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:00:47,193 INFO L93 Difference]: Finished difference Result 644 states and 924 transitions. [2025-02-05 23:00:47,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 23:00:47,194 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-02-05 23:00:47,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:00:47,199 INFO L225 Difference]: With dead ends: 644 [2025-02-05 23:00:47,201 INFO L226 Difference]: Without dead ends: 642 [2025-02-05 23:00:47,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-02-05 23:00:47,201 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 342 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:00:47,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 803 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 23:00:47,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-02-05 23:00:47,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 548. [2025-02-05 23:00:47,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 427 states have (on average 1.405152224824356) internal successors, (600), 432 states have internal predecessors, (600), 108 states have call successors, (108), 12 states have call predecessors, (108), 12 states have return successors, (108), 103 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-05 23:00:47,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 816 transitions. [2025-02-05 23:00:47,235 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 816 transitions. Word has length 150 [2025-02-05 23:00:47,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:00:47,235 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 816 transitions. [2025-02-05 23:00:47,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:00:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 816 transitions. [2025-02-05 23:00:47,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 23:00:47,237 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:00:47,238 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:00:47,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 23:00:47,238 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:00:47,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:00:47,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1293103642, now seen corresponding path program 1 times [2025-02-05 23:00:47,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:00:47,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160004763] [2025-02-05 23:00:47,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:00:47,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:00:47,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 23:00:47,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 23:00:47,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:00:47,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:00:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:00:47,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:00:47,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160004763] [2025-02-05 23:00:47,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160004763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:00:47,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:00:47,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 23:00:47,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458726198] [2025-02-05 23:00:47,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:00:47,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 23:00:47,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:00:47,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 23:00:47,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 23:00:47,471 INFO L87 Difference]: Start difference. First operand 548 states and 816 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-02-05 23:00:47,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:00:47,805 INFO L93 Difference]: Finished difference Result 1055 states and 1582 transitions. [2025-02-05 23:00:47,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 23:00:47,806 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 150 [2025-02-05 23:00:47,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:00:47,809 INFO L225 Difference]: With dead ends: 1055 [2025-02-05 23:00:47,809 INFO L226 Difference]: Without dead ends: 602 [2025-02-05 23:00:47,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-02-05 23:00:47,812 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 214 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 23:00:47,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 422 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 23:00:47,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-02-05 23:00:47,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 547. [2025-02-05 23:00:47,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 426 states have (on average 1.4014084507042253) internal successors, (597), 431 states have internal predecessors, (597), 108 states have call successors, (108), 12 states have call predecessors, (108), 12 states have return successors, (108), 103 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-05 23:00:47,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 813 transitions. [2025-02-05 23:00:47,845 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 813 transitions. Word has length 150 [2025-02-05 23:00:47,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:00:47,845 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 813 transitions. [2025-02-05 23:00:47,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-02-05 23:00:47,846 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 813 transitions. [2025-02-05 23:00:47,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 23:00:47,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:00:47,848 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:00:47,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 23:00:47,848 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:00:47,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:00:47,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1566006792, now seen corresponding path program 1 times [2025-02-05 23:00:47,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:00:47,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984062372] [2025-02-05 23:00:47,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:00:47,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:00:47,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 23:00:47,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 23:00:47,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:00:47,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:00:48,021 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:00:48,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:00:48,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984062372] [2025-02-05 23:00:48,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984062372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:00:48,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:00:48,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 23:00:48,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124438796] [2025-02-05 23:00:48,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:00:48,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 23:00:48,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:00:48,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 23:00:48,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:00:48,023 INFO L87 Difference]: Start difference. First operand 547 states and 813 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 23:00:48,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:00:48,233 INFO L93 Difference]: Finished difference Result 985 states and 1449 transitions. [2025-02-05 23:00:48,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 23:00:48,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 150 [2025-02-05 23:00:48,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:00:48,237 INFO L225 Difference]: With dead ends: 985 [2025-02-05 23:00:48,237 INFO L226 Difference]: Without dead ends: 528 [2025-02-05 23:00:48,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:00:48,239 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 198 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:00:48,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 223 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:00:48,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-02-05 23:00:48,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 519. [2025-02-05 23:00:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 392 states have (on average 1.3596938775510203) internal successors, (533), 397 states have internal predecessors, (533), 112 states have call successors, (112), 14 states have call predecessors, (112), 14 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 23:00:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 757 transitions. [2025-02-05 23:00:48,272 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 757 transitions. Word has length 150 [2025-02-05 23:00:48,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:00:48,273 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 757 transitions. [2025-02-05 23:00:48,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 23:00:48,273 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 757 transitions. [2025-02-05 23:00:48,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 23:00:48,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:00:48,274 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:00:48,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 23:00:48,275 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:00:48,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:00:48,275 INFO L85 PathProgramCache]: Analyzing trace with hash -5532117, now seen corresponding path program 1 times [2025-02-05 23:00:48,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:00:48,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198334228] [2025-02-05 23:00:48,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:00:48,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:00:48,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 23:00:48,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 23:00:48,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:00:48,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:00:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:00:49,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:00:49,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198334228] [2025-02-05 23:00:49,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198334228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:00:49,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:00:49,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 23:00:49,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361850062] [2025-02-05 23:00:49,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:00:49,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 23:00:49,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:00:49,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 23:00:49,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-05 23:00:49,443 INFO L87 Difference]: Start difference. First operand 519 states and 757 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-02-05 23:00:51,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:00:51,306 INFO L93 Difference]: Finished difference Result 1250 states and 1811 transitions. [2025-02-05 23:00:51,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 23:00:51,307 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 150 [2025-02-05 23:00:51,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:00:51,310 INFO L225 Difference]: With dead ends: 1250 [2025-02-05 23:00:51,310 INFO L226 Difference]: Without dead ends: 819 [2025-02-05 23:00:51,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2025-02-05 23:00:51,312 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 367 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:00:51,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 989 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 23:00:51,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-02-05 23:00:51,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 623. [2025-02-05 23:00:51,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 484 states have (on average 1.3553719008264462) internal successors, (656), 493 states have internal predecessors, (656), 120 states have call successors, (120), 18 states have call predecessors, (120), 18 states have return successors, (120), 111 states have call predecessors, (120), 120 states have call successors, (120) [2025-02-05 23:00:51,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 896 transitions. [2025-02-05 23:00:51,351 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 896 transitions. Word has length 150 [2025-02-05 23:00:51,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:00:51,351 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 896 transitions. [2025-02-05 23:00:51,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-02-05 23:00:51,352 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 896 transitions. [2025-02-05 23:00:51,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 23:00:51,352 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:00:51,352 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:00:51,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 23:00:51,353 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:00:51,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:00:51,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1486608171, now seen corresponding path program 1 times [2025-02-05 23:00:51,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:00:51,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132898195] [2025-02-05 23:00:51,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:00:51,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:00:51,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 23:00:51,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 23:00:51,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:00:51,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:00:51,447 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-02-05 23:00:51,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:00:51,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132898195] [2025-02-05 23:00:51,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132898195] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:00:51,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356026574] [2025-02-05 23:00:51,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:00:51,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:00:51,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:00:51,450 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 23:00:51,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 23:00:51,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 23:00:51,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 23:00:51,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:00:51,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:00:51,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 23:00:51,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:00:51,732 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 211 proven. 6 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2025-02-05 23:00:51,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:00:51,884 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-02-05 23:00:51,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356026574] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 23:00:51,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 23:00:51,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14 [2025-02-05 23:00:51,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912496714] [2025-02-05 23:00:51,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 23:00:51,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 23:00:51,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:00:51,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 23:00:51,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-02-05 23:00:51,886 INFO L87 Difference]: Start difference. First operand 623 states and 896 transitions. Second operand has 14 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 6 states have call successors, (66), 3 states have call predecessors, (66), 6 states have return successors, (66), 6 states have call predecessors, (66), 6 states have call successors, (66) [2025-02-05 23:00:52,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:00:52,375 INFO L93 Difference]: Finished difference Result 1403 states and 2009 transitions. [2025-02-05 23:00:52,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 23:00:52,375 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 6 states have call successors, (66), 3 states have call predecessors, (66), 6 states have return successors, (66), 6 states have call predecessors, (66), 6 states have call successors, (66) Word has length 151 [2025-02-05 23:00:52,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:00:52,380 INFO L225 Difference]: With dead ends: 1403 [2025-02-05 23:00:52,380 INFO L226 Difference]: Without dead ends: 972 [2025-02-05 23:00:52,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=531, Unknown=0, NotChecked=0, Total=756 [2025-02-05 23:00:52,383 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 297 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 23:00:52,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 534 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 23:00:52,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2025-02-05 23:00:52,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 945. [2025-02-05 23:00:52,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 724 states have (on average 1.3232044198895028) internal successors, (958), 740 states have internal predecessors, (958), 192 states have call successors, (192), 28 states have call predecessors, (192), 28 states have return successors, (192), 176 states have call predecessors, (192), 192 states have call successors, (192) [2025-02-05 23:00:52,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1342 transitions. [2025-02-05 23:00:52,472 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1342 transitions. Word has length 151 [2025-02-05 23:00:52,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:00:52,472 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1342 transitions. [2025-02-05 23:00:52,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 6 states have call successors, (66), 3 states have call predecessors, (66), 6 states have return successors, (66), 6 states have call predecessors, (66), 6 states have call successors, (66) [2025-02-05 23:00:52,472 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1342 transitions. [2025-02-05 23:00:52,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 23:00:52,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:00:52,474 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:00:52,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 23:00:52,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 23:00:52,679 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:00:52,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:00:52,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1246469363, now seen corresponding path program 1 times [2025-02-05 23:00:52,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:00:52,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719684205] [2025-02-05 23:00:52,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:00:52,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:00:52,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 23:00:52,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 23:00:52,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:00:52,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:00:52,782 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-02-05 23:00:52,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:00:52,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719684205] [2025-02-05 23:00:52,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719684205] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:00:52,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474121802] [2025-02-05 23:00:52,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:00:52,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:00:52,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:00:52,784 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 23:00:52,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 23:00:52,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 23:00:52,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 23:00:52,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:00:52,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:00:52,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 23:00:52,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:00:52,974 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 481 proven. 33 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2025-02-05 23:00:52,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:00:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-02-05 23:00:53,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474121802] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 23:00:53,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 23:00:53,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-05 23:00:53,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838896488] [2025-02-05 23:00:53,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 23:00:53,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 23:00:53,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:00:53,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 23:00:53,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 23:00:53,115 INFO L87 Difference]: Start difference. First operand 945 states and 1342 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2025-02-05 23:00:53,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:00:53,286 INFO L93 Difference]: Finished difference Result 1737 states and 2444 transitions. [2025-02-05 23:00:53,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 23:00:53,287 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) Word has length 151 [2025-02-05 23:00:53,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:00:53,292 INFO L225 Difference]: With dead ends: 1737 [2025-02-05 23:00:53,292 INFO L226 Difference]: Without dead ends: 987 [2025-02-05 23:00:53,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-02-05 23:00:53,294 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 182 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:00:53,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 220 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:00:53,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2025-02-05 23:00:53,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 973. [2025-02-05 23:00:53,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 745 states have (on average 1.2993288590604026) internal successors, (968), 761 states have internal predecessors, (968), 192 states have call successors, (192), 35 states have call predecessors, (192), 35 states have return successors, (192), 176 states have call predecessors, (192), 192 states have call successors, (192) [2025-02-05 23:00:53,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1352 transitions. [2025-02-05 23:00:53,365 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1352 transitions. Word has length 151 [2025-02-05 23:00:53,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:00:53,365 INFO L471 AbstractCegarLoop]: Abstraction has 973 states and 1352 transitions. [2025-02-05 23:00:53,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2025-02-05 23:00:53,365 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1352 transitions. [2025-02-05 23:00:53,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 23:00:53,367 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:00:53,367 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:00:53,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 23:00:53,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:00:53,571 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:00:53,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:00:53,571 INFO L85 PathProgramCache]: Analyzing trace with hash 401997492, now seen corresponding path program 1 times [2025-02-05 23:00:53,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:00:53,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365941638] [2025-02-05 23:00:53,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:00:53,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:00:53,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 23:00:53,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 23:00:53,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:00:53,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:00:53,799 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:00:53,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:00:53,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365941638] [2025-02-05 23:00:53,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365941638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:00:53,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:00:53,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 23:00:53,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947552957] [2025-02-05 23:00:53,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:00:53,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 23:00:53,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:00:53,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 23:00:53,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:00:53,801 INFO L87 Difference]: Start difference. First operand 973 states and 1352 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:00:54,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:00:54,169 INFO L93 Difference]: Finished difference Result 1615 states and 2237 transitions. [2025-02-05 23:00:54,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 23:00:54,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-02-05 23:00:54,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:00:54,174 INFO L225 Difference]: With dead ends: 1615 [2025-02-05 23:00:54,174 INFO L226 Difference]: Without dead ends: 993 [2025-02-05 23:00:54,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-05 23:00:54,176 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 118 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:00:54,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 439 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:00:54,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2025-02-05 23:00:54,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 973. [2025-02-05 23:00:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 744 states have (on average 1.2956989247311828) internal successors, (964), 760 states have internal predecessors, (964), 192 states have call successors, (192), 36 states have call predecessors, (192), 36 states have return successors, (192), 176 states have call predecessors, (192), 192 states have call successors, (192) [2025-02-05 23:00:54,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1348 transitions. [2025-02-05 23:00:54,245 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1348 transitions. Word has length 151 [2025-02-05 23:00:54,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:00:54,245 INFO L471 AbstractCegarLoop]: Abstraction has 973 states and 1348 transitions. [2025-02-05 23:00:54,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:00:54,245 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1348 transitions. [2025-02-05 23:00:54,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 23:00:54,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:00:54,246 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:00:54,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 23:00:54,246 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:00:54,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:00:54,247 INFO L85 PathProgramCache]: Analyzing trace with hash 197299414, now seen corresponding path program 1 times [2025-02-05 23:00:54,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:00:54,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800227360] [2025-02-05 23:00:54,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:00:54,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:00:54,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 23:00:54,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 23:00:54,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:00:54,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:00:56,800 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:00:56,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:00:56,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800227360] [2025-02-05 23:00:56,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800227360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:00:56,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:00:56,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-05 23:00:56,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106801904] [2025-02-05 23:00:56,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:00:56,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 23:00:56,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:00:56,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 23:00:56,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-02-05 23:00:56,802 INFO L87 Difference]: Start difference. First operand 973 states and 1348 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:00:57,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:00:57,921 INFO L93 Difference]: Finished difference Result 1491 states and 2070 transitions. [2025-02-05 23:00:57,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 23:00:57,921 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-02-05 23:00:57,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:00:57,925 INFO L225 Difference]: With dead ends: 1491 [2025-02-05 23:00:57,925 INFO L226 Difference]: Without dead ends: 1182 [2025-02-05 23:00:57,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2025-02-05 23:00:57,926 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 439 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 23:00:57,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 822 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 23:00:57,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2025-02-05 23:00:57,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1023. [2025-02-05 23:00:57,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 789 states have (on average 1.2978453738910012) internal successors, (1024), 806 states have internal predecessors, (1024), 196 states have call successors, (196), 37 states have call predecessors, (196), 37 states have return successors, (196), 179 states have call predecessors, (196), 196 states have call successors, (196) [2025-02-05 23:00:57,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1416 transitions. [2025-02-05 23:00:57,997 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1416 transitions. Word has length 151 [2025-02-05 23:00:57,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:00:57,997 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1416 transitions. [2025-02-05 23:00:57,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:00:57,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1416 transitions. [2025-02-05 23:00:57,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 23:00:57,998 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:00:57,998 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:00:57,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 23:00:57,998 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:00:57,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:00:57,999 INFO L85 PathProgramCache]: Analyzing trace with hash 198222935, now seen corresponding path program 1 times [2025-02-05 23:00:57,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:00:57,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45857162] [2025-02-05 23:00:57,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:00:57,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:00:58,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 23:00:58,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 23:00:58,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:00:58,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:01:01,710 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:01:01,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:01:01,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45857162] [2025-02-05 23:01:01,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45857162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:01:01,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:01:01,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-05 23:01:01,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725009603] [2025-02-05 23:01:01,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:01:01,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 23:01:01,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:01:01,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 23:01:01,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-02-05 23:01:01,711 INFO L87 Difference]: Start difference. First operand 1023 states and 1416 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:01:05,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:01:05,640 INFO L93 Difference]: Finished difference Result 1174 states and 1607 transitions. [2025-02-05 23:01:05,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-05 23:01:05,640 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-02-05 23:01:05,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:01:05,645 INFO L225 Difference]: With dead ends: 1174 [2025-02-05 23:01:05,645 INFO L226 Difference]: Without dead ends: 1172 [2025-02-05 23:01:05,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=268, Invalid=1138, Unknown=0, NotChecked=0, Total=1406 [2025-02-05 23:01:05,646 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 374 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 23:01:05,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1060 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 23:01:05,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2025-02-05 23:01:05,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1034. [2025-02-05 23:01:05,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 800 states have (on average 1.30125) internal successors, (1041), 817 states have internal predecessors, (1041), 196 states have call successors, (196), 37 states have call predecessors, (196), 37 states have return successors, (196), 179 states have call predecessors, (196), 196 states have call successors, (196) [2025-02-05 23:01:05,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1433 transitions. [2025-02-05 23:01:05,720 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1433 transitions. Word has length 151 [2025-02-05 23:01:05,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:01:05,721 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1433 transitions. [2025-02-05 23:01:05,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:01:05,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1433 transitions. [2025-02-05 23:01:05,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 23:01:05,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:01:05,722 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:01:05,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 23:01:05,723 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:01:05,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:01:05,723 INFO L85 PathProgramCache]: Analyzing trace with hash 326382133, now seen corresponding path program 1 times [2025-02-05 23:01:05,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:01:05,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478907197] [2025-02-05 23:01:05,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:05,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:01:05,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 23:01:05,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 23:01:05,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:05,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:01:33,370 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:01:33,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:01:33,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478907197] [2025-02-05 23:01:33,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478907197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:01:33,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:01:33,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-05 23:01:33,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258005150] [2025-02-05 23:01:33,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:01:33,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 23:01:33,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:01:33,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 23:01:33,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2025-02-05 23:01:33,372 INFO L87 Difference]: Start difference. First operand 1034 states and 1433 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:01:38,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:01:38,935 INFO L93 Difference]: Finished difference Result 1185 states and 1620 transitions. [2025-02-05 23:01:38,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-05 23:01:38,938 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-02-05 23:01:38,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:01:38,943 INFO L225 Difference]: With dead ends: 1185 [2025-02-05 23:01:38,943 INFO L226 Difference]: Without dead ends: 1183 [2025-02-05 23:01:38,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=264, Invalid=1068, Unknown=0, NotChecked=0, Total=1332 [2025-02-05 23:01:38,944 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 384 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 1689 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:01:38,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 933 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1689 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 23:01:38,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-02-05 23:01:39,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1034. [2025-02-05 23:01:39,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 800 states have (on average 1.30125) internal successors, (1041), 817 states have internal predecessors, (1041), 196 states have call successors, (196), 37 states have call predecessors, (196), 37 states have return successors, (196), 179 states have call predecessors, (196), 196 states have call successors, (196) [2025-02-05 23:01:39,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1433 transitions. [2025-02-05 23:01:39,022 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1433 transitions. Word has length 151 [2025-02-05 23:01:39,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:01:39,023 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1433 transitions. [2025-02-05 23:01:39,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:01:39,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1433 transitions. [2025-02-05 23:01:39,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 23:01:39,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:01:39,024 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:01:39,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 23:01:39,025 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:01:39,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:01:39,026 INFO L85 PathProgramCache]: Analyzing trace with hash 327305654, now seen corresponding path program 1 times [2025-02-05 23:01:39,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:01:39,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952396247] [2025-02-05 23:01:39,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:39,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:01:39,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 23:01:39,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 23:01:39,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:39,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:01:43,682 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:01:43,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:01:43,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952396247] [2025-02-05 23:01:43,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952396247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:01:43,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:01:43,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-05 23:01:43,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819102023] [2025-02-05 23:01:43,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:01:43,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 23:01:43,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:01:43,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 23:01:43,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2025-02-05 23:01:43,684 INFO L87 Difference]: Start difference. First operand 1034 states and 1433 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 23:01:46,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:01:46,935 INFO L93 Difference]: Finished difference Result 1294 states and 1767 transitions. [2025-02-05 23:01:46,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 23:01:46,935 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 151 [2025-02-05 23:01:46,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:01:46,939 INFO L225 Difference]: With dead ends: 1294 [2025-02-05 23:01:46,940 INFO L226 Difference]: Without dead ends: 1292 [2025-02-05 23:01:46,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=285, Invalid=1047, Unknown=0, NotChecked=0, Total=1332 [2025-02-05 23:01:46,941 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 491 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 1645 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 23:01:46,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 874 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1645 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 23:01:46,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2025-02-05 23:01:47,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1047. [2025-02-05 23:01:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 813 states have (on average 1.3038130381303814) internal successors, (1060), 830 states have internal predecessors, (1060), 196 states have call successors, (196), 37 states have call predecessors, (196), 37 states have return successors, (196), 179 states have call predecessors, (196), 196 states have call successors, (196) [2025-02-05 23:01:47,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1452 transitions. [2025-02-05 23:01:47,023 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1452 transitions. Word has length 151 [2025-02-05 23:01:47,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:01:47,023 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1452 transitions. [2025-02-05 23:01:47,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 23:01:47,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1452 transitions. [2025-02-05 23:01:47,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 23:01:47,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:01:47,024 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:01:47,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 23:01:47,024 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:01:47,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:01:47,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1981103403, now seen corresponding path program 1 times [2025-02-05 23:01:47,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:01:47,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883163020] [2025-02-05 23:01:47,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:47,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:01:47,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 23:01:47,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 23:01:47,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:47,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:01:47,076 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 23:01:47,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:01:47,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883163020] [2025-02-05 23:01:47,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883163020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:01:47,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:01:47,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 23:01:47,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689439694] [2025-02-05 23:01:47,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:01:47,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 23:01:47,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:01:47,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 23:01:47,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:01:47,078 INFO L87 Difference]: Start difference. First operand 1047 states and 1452 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:01:47,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:01:47,288 INFO L93 Difference]: Finished difference Result 1845 states and 2558 transitions. [2025-02-05 23:01:47,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 23:01:47,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-02-05 23:01:47,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:01:47,295 INFO L225 Difference]: With dead ends: 1845 [2025-02-05 23:01:47,295 INFO L226 Difference]: Without dead ends: 1278 [2025-02-05 23:01:47,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:01:47,298 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 126 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:01:47,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 415 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:01:47,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2025-02-05 23:01:47,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1191. [2025-02-05 23:01:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 911 states have (on average 1.2974753018660812) internal successors, (1182), 928 states have internal predecessors, (1182), 234 states have call successors, (234), 45 states have call predecessors, (234), 45 states have return successors, (234), 217 states have call predecessors, (234), 234 states have call successors, (234) [2025-02-05 23:01:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1650 transitions. [2025-02-05 23:01:47,373 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1650 transitions. Word has length 151 [2025-02-05 23:01:47,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:01:47,374 INFO L471 AbstractCegarLoop]: Abstraction has 1191 states and 1650 transitions. [2025-02-05 23:01:47,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 23:01:47,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1650 transitions. [2025-02-05 23:01:47,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 23:01:47,375 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:01:47,375 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:01:47,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 23:01:47,376 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:01:47,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:01:47,376 INFO L85 PathProgramCache]: Analyzing trace with hash -15245647, now seen corresponding path program 1 times [2025-02-05 23:01:47,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:01:47,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843117451] [2025-02-05 23:01:47,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:47,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:01:47,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 23:01:47,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 23:01:47,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:47,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:01:47,462 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-02-05 23:01:47,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:01:47,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843117451] [2025-02-05 23:01:47,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843117451] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:01:47,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136440103] [2025-02-05 23:01:47,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:47,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:01:47,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:01:47,465 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 23:01:47,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 23:01:47,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 23:01:47,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 23:01:47,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:47,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:01:47,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 23:01:47,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:01:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 301 proven. 51 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-02-05 23:01:47,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:01:47,781 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-02-05 23:01:47,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136440103] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 23:01:47,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 23:01:47,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-05 23:01:47,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203670823] [2025-02-05 23:01:47,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 23:01:47,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 23:01:47,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:01:47,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 23:01:47,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 23:01:47,783 INFO L87 Difference]: Start difference. First operand 1191 states and 1650 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) [2025-02-05 23:01:47,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:01:47,974 INFO L93 Difference]: Finished difference Result 1577 states and 2157 transitions. [2025-02-05 23:01:47,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 23:01:47,974 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) Word has length 151 [2025-02-05 23:01:47,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:01:47,977 INFO L225 Difference]: With dead ends: 1577 [2025-02-05 23:01:47,977 INFO L226 Difference]: Without dead ends: 588 [2025-02-05 23:01:47,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-02-05 23:01:47,979 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 229 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:01:47,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 326 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:01:47,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-02-05 23:01:48,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 576. [2025-02-05 23:01:48,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 412 states have (on average 1.2063106796116505) internal successors, (497), 416 states have internal predecessors, (497), 128 states have call successors, (128), 35 states have call predecessors, (128), 35 states have return successors, (128), 124 states have call predecessors, (128), 128 states have call successors, (128) [2025-02-05 23:01:48,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 753 transitions. [2025-02-05 23:01:48,022 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 753 transitions. Word has length 151 [2025-02-05 23:01:48,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:01:48,023 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 753 transitions. [2025-02-05 23:01:48,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) [2025-02-05 23:01:48,023 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 753 transitions. [2025-02-05 23:01:48,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 23:01:48,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:01:48,024 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:01:48,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 23:01:48,225 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,SelfDestructingSolverStorable22 [2025-02-05 23:01:48,226 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:01:48,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:01:48,226 INFO L85 PathProgramCache]: Analyzing trace with hash -830652985, now seen corresponding path program 1 times [2025-02-05 23:01:48,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:01:48,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844784175] [2025-02-05 23:01:48,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:01:48,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:01:48,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 23:01:48,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 23:01:48,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:01:48,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat