./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-52.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-pe-ci_file-52.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 9596c2b1f5a6a86d977a7da5a7a12c7a349c8346134fffef1cb814ea5153401b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:21:31,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:21:31,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 22:21:31,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:21:31,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:21:31,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:21:31,103 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:21:31,103 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:21:31,104 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:21:31,104 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:21:31,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:21:31,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:21:31,105 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:21:31,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:21:31,105 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:21:31,105 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:21:31,106 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:21:31,106 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:21:31,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:21:31,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:21:31,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:21:31,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:21:31,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:21:31,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:21:31,106 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:21:31,106 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:21:31,106 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:21:31,106 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:21:31,107 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:21:31,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:21:31,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:21:31,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:21:31,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:21:31,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:21:31,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:21:31,108 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:21:31,108 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:21:31,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:21:31,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:21:31,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:21:31,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:21:31,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:21:31,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:21:31,108 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 -> 9596c2b1f5a6a86d977a7da5a7a12c7a349c8346134fffef1cb814ea5153401b [2025-02-05 22:21:31,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:21:31,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:21:31,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:21:31,338 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:21:31,338 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:21:31,339 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-pe-ci_file-52.i [2025-02-05 22:21:32,487 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e74753d78/c64864d404914d6881e043ad273039c1/FLAG768e2726c [2025-02-05 22:21:32,767 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:21:32,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-52.i [2025-02-05 22:21:32,778 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e74753d78/c64864d404914d6881e043ad273039c1/FLAG768e2726c [2025-02-05 22:21:32,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e74753d78/c64864d404914d6881e043ad273039c1 [2025-02-05 22:21:32,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:21:32,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:21:32,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:21:32,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:21:32,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:21:32,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:21:32" (1/1) ... [2025-02-05 22:21:32,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a76cb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:32, skipping insertion in model container [2025-02-05 22:21:32,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:21:32" (1/1) ... [2025-02-05 22:21:32,821 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:21:32,927 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-pe-ci_file-52.i[919,932] [2025-02-05 22:21:32,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:21:33,005 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:21:33,014 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-pe-ci_file-52.i[919,932] [2025-02-05 22:21:33,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:21:33,058 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:21:33,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:33 WrapperNode [2025-02-05 22:21:33,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:21:33,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:21:33,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:21:33,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:21:33,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:33" (1/1) ... [2025-02-05 22:21:33,077 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:33" (1/1) ... [2025-02-05 22:21:33,111 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2025-02-05 22:21:33,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:21:33,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:21:33,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:21:33,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:21:33,127 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:33" (1/1) ... [2025-02-05 22:21:33,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:33" (1/1) ... [2025-02-05 22:21:33,135 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:33" (1/1) ... [2025-02-05 22:21:33,156 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 22:21:33,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:33" (1/1) ... [2025-02-05 22:21:33,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:33" (1/1) ... [2025-02-05 22:21:33,165 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:33" (1/1) ... [2025-02-05 22:21:33,170 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:33" (1/1) ... [2025-02-05 22:21:33,171 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:33" (1/1) ... [2025-02-05 22:21:33,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:33" (1/1) ... [2025-02-05 22:21:33,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:21:33,177 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:21:33,179 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:21:33,179 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:21:33,180 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:33" (1/1) ... [2025-02-05 22:21:33,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:21:33,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:21:33,208 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 22:21:33,211 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 22:21:33,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:21:33,230 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:21:33,230 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:21:33,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:21:33,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:21:33,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:21:33,298 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:21:33,300 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:21:33,615 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-02-05 22:21:33,616 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:21:33,628 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:21:33,628 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:21:33,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:21:33 BoogieIcfgContainer [2025-02-05 22:21:33,628 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:21:33,630 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:21:33,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:21:33,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:21:33,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:21:32" (1/3) ... [2025-02-05 22:21:33,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d65eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:21:33, skipping insertion in model container [2025-02-05 22:21:33,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:33" (2/3) ... [2025-02-05 22:21:33,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d65eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:21:33, skipping insertion in model container [2025-02-05 22:21:33,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:21:33" (3/3) ... [2025-02-05 22:21:33,635 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-52.i [2025-02-05 22:21:33,644 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:21:33,646 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-52.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:21:33,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:21:33,696 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;@4c2e687c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:21:33,698 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:21:33,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 60 states have internal predecessors, (87), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-05 22:21:33,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 22:21:33,711 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:21:33,712 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:21:33,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:21:33,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:21:33,718 INFO L85 PathProgramCache]: Analyzing trace with hash -63178327, now seen corresponding path program 1 times [2025-02-05 22:21:33,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:21:33,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010448942] [2025-02-05 22:21:33,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:21:33,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:21:33,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 22:21:33,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 22:21:33,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:21:33,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:21:33,959 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-05 22:21:33,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:21:33,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010448942] [2025-02-05 22:21:33,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010448942] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:21:33,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714316882] [2025-02-05 22:21:33,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:21:33,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:21:33,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:21:33,965 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 22:21:33,967 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 22:21:34,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 22:21:34,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 22:21:34,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:21:34,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:21:34,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:21:34,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:21:34,171 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-05 22:21:34,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:21:34,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714316882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:21:34,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:21:34,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:21:34,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276690642] [2025-02-05 22:21:34,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:21:34,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:21:34,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:21:34,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:21:34,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:21:34,192 INFO L87 Difference]: Start difference. First operand has 79 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 60 states have internal predecessors, (87), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 22:21:34,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:21:34,215 INFO L93 Difference]: Finished difference Result 152 states and 254 transitions. [2025-02-05 22:21:34,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:21:34,217 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 125 [2025-02-05 22:21:34,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:21:34,222 INFO L225 Difference]: With dead ends: 152 [2025-02-05 22:21:34,222 INFO L226 Difference]: Without dead ends: 76 [2025-02-05 22:21:34,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 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 22:21:34,225 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:21:34,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:21:34,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-05 22:21:34,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-02-05 22:21:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 57 states have internal predecessors, (82), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-05 22:21:34,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 116 transitions. [2025-02-05 22:21:34,249 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 116 transitions. Word has length 125 [2025-02-05 22:21:34,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:21:34,250 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 116 transitions. [2025-02-05 22:21:34,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 22:21:34,250 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 116 transitions. [2025-02-05 22:21:34,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 22:21:34,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:21:34,253 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:21:34,260 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 22:21:34,457 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 22:21:34,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:21:34,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:21:34,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1975782004, now seen corresponding path program 1 times [2025-02-05 22:21:34,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:21:34,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131437198] [2025-02-05 22:21:34,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:21:34,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:21:34,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 22:21:34,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 22:21:34,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:21:34,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:21:34,777 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:21:34,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:21:34,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131437198] [2025-02-05 22:21:34,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131437198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:21:34,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:21:34,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:21:34,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949692934] [2025-02-05 22:21:34,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:21:34,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:21:34,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:21:34,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:21:34,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:21:34,779 INFO L87 Difference]: Start difference. First operand 76 states and 116 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:21:34,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:21:34,959 INFO L93 Difference]: Finished difference Result 272 states and 416 transitions. [2025-02-05 22:21:34,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:21:34,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 125 [2025-02-05 22:21:34,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:21:34,961 INFO L225 Difference]: With dead ends: 272 [2025-02-05 22:21:34,961 INFO L226 Difference]: Without dead ends: 199 [2025-02-05 22:21:34,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:21:34,962 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 137 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:21:34,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 341 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:21:34,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-05 22:21:34,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 147. [2025-02-05 22:21:34,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 110 states have (on average 1.4363636363636363) internal successors, (158), 110 states have internal predecessors, (158), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 22:21:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 226 transitions. [2025-02-05 22:21:34,988 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 226 transitions. Word has length 125 [2025-02-05 22:21:34,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:21:34,988 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 226 transitions. [2025-02-05 22:21:34,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:21:34,989 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 226 transitions. [2025-02-05 22:21:34,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 22:21:34,992 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:21:34,992 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:21:34,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:21:34,992 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:21:34,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:21:34,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1842580357, now seen corresponding path program 1 times [2025-02-05 22:21:34,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:21:34,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555008581] [2025-02-05 22:21:34,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:21:34,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:21:35,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 22:21:35,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 22:21:35,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:21:35,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:21:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:21:35,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:21:35,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555008581] [2025-02-05 22:21:35,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555008581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:21:35,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:21:35,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:21:35,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438655142] [2025-02-05 22:21:35,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:21:35,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:21:35,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:21:35,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:21:35,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:21:35,172 INFO L87 Difference]: Start difference. First operand 147 states and 226 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:21:35,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:21:35,311 INFO L93 Difference]: Finished difference Result 468 states and 720 transitions. [2025-02-05 22:21:35,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:21:35,312 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2025-02-05 22:21:35,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:21:35,314 INFO L225 Difference]: With dead ends: 468 [2025-02-05 22:21:35,314 INFO L226 Difference]: Without dead ends: 324 [2025-02-05 22:21:35,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:21:35,316 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 249 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:21:35,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 417 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:21:35,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-02-05 22:21:35,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 285. [2025-02-05 22:21:35,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 212 states have (on average 1.4245283018867925) internal successors, (302), 212 states have internal predecessors, (302), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 22:21:35,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 438 transitions. [2025-02-05 22:21:35,351 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 438 transitions. Word has length 126 [2025-02-05 22:21:35,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:21:35,351 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 438 transitions. [2025-02-05 22:21:35,352 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:21:35,352 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 438 transitions. [2025-02-05 22:21:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 22:21:35,353 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:21:35,353 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:21:35,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:21:35,353 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:21:35,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:21:35,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1346141790, now seen corresponding path program 1 times [2025-02-05 22:21:35,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:21:35,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415476630] [2025-02-05 22:21:35,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:21:35,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:21:35,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 22:21:35,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 22:21:35,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:21:35,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:21:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:21:35,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:21:35,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415476630] [2025-02-05 22:21:35,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415476630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:21:35,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:21:35,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:21:35,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787775640] [2025-02-05 22:21:35,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:21:35,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:21:35,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:21:35,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:21:35,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:21:35,438 INFO L87 Difference]: Start difference. First operand 285 states and 438 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:21:35,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:21:35,500 INFO L93 Difference]: Finished difference Result 761 states and 1162 transitions. [2025-02-05 22:21:35,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:21:35,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2025-02-05 22:21:35,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:21:35,505 INFO L225 Difference]: With dead ends: 761 [2025-02-05 22:21:35,505 INFO L226 Difference]: Without dead ends: 479 [2025-02-05 22:21:35,506 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 22:21:35,507 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 72 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:21:35,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 204 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:21:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-02-05 22:21:35,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 297. [2025-02-05 22:21:35,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 224 states have (on average 1.4107142857142858) internal successors, (316), 224 states have internal predecessors, (316), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 22:21:35,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 452 transitions. [2025-02-05 22:21:35,537 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 452 transitions. Word has length 126 [2025-02-05 22:21:35,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:21:35,537 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 452 transitions. [2025-02-05 22:21:35,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:21:35,537 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 452 transitions. [2025-02-05 22:21:35,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 22:21:35,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:21:35,539 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:21:35,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:21:35,539 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:21:35,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:21:35,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1207622458, now seen corresponding path program 1 times [2025-02-05 22:21:35,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:21:35,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582349297] [2025-02-05 22:21:35,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:21:35,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:21:35,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 22:21:35,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 22:21:35,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:21:35,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:21:35,740 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:21:35,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:21:35,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582349297] [2025-02-05 22:21:35,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582349297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:21:35,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:21:35,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:21:35,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3328258] [2025-02-05 22:21:35,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:21:35,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:21:35,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:21:35,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:21:35,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:21:35,742 INFO L87 Difference]: Start difference. First operand 297 states and 452 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:21:35,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:21:35,893 INFO L93 Difference]: Finished difference Result 885 states and 1350 transitions. [2025-02-05 22:21:35,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:21:35,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2025-02-05 22:21:35,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:21:35,897 INFO L225 Difference]: With dead ends: 885 [2025-02-05 22:21:35,897 INFO L226 Difference]: Without dead ends: 591 [2025-02-05 22:21:35,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:21:35,899 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 174 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:21:35,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 401 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:21:35,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-02-05 22:21:35,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 303. [2025-02-05 22:21:35,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 230 states have (on average 1.4086956521739131) internal successors, (324), 230 states have internal predecessors, (324), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 22:21:35,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 460 transitions. [2025-02-05 22:21:35,931 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 460 transitions. Word has length 126 [2025-02-05 22:21:35,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:21:35,932 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 460 transitions. [2025-02-05 22:21:35,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:21:35,932 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 460 transitions. [2025-02-05 22:21:35,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 22:21:35,933 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:21:35,933 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:21:35,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:21:35,933 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:21:35,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:21:35,934 INFO L85 PathProgramCache]: Analyzing trace with hash -29864730, now seen corresponding path program 1 times [2025-02-05 22:21:35,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:21:35,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864853715] [2025-02-05 22:21:35,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:21:35,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:21:35,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 22:21:35,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 22:21:35,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:21:35,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:21:35,999 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:21:36,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:21:36,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864853715] [2025-02-05 22:21:36,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864853715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:21:36,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:21:36,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:21:36,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598495945] [2025-02-05 22:21:36,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:21:36,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:21:36,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:21:36,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:21:36,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:21:36,001 INFO L87 Difference]: Start difference. First operand 303 states and 460 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:21:36,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:21:36,086 INFO L93 Difference]: Finished difference Result 883 states and 1338 transitions. [2025-02-05 22:21:36,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:21:36,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2025-02-05 22:21:36,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:21:36,090 INFO L225 Difference]: With dead ends: 883 [2025-02-05 22:21:36,090 INFO L226 Difference]: Without dead ends: 583 [2025-02-05 22:21:36,091 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 22:21:36,091 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 98 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:21:36,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 308 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:21:36,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-02-05 22:21:36,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 315. [2025-02-05 22:21:36,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 242 states have (on average 1.4049586776859504) internal successors, (340), 242 states have internal predecessors, (340), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 22:21:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 476 transitions. [2025-02-05 22:21:36,139 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 476 transitions. Word has length 126 [2025-02-05 22:21:36,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:21:36,139 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 476 transitions. [2025-02-05 22:21:36,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:21:36,140 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 476 transitions. [2025-02-05 22:21:36,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 22:21:36,141 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:21:36,141 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:21:36,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:21:36,141 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:21:36,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:21:36,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1214899751, now seen corresponding path program 1 times [2025-02-05 22:21:36,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:21:36,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525051591] [2025-02-05 22:21:36,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:21:36,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:21:36,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 22:21:36,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 22:21:36,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:21:36,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:21:36,833 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:21:36,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:21:36,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525051591] [2025-02-05 22:21:36,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525051591] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:21:36,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:21:36,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 22:21:36,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467867075] [2025-02-05 22:21:36,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:21:36,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 22:21:36,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:21:36,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 22:21:36,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:21:36,835 INFO L87 Difference]: Start difference. First operand 315 states and 476 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 22:21:37,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:21:37,448 INFO L93 Difference]: Finished difference Result 887 states and 1340 transitions. [2025-02-05 22:21:37,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 22:21:37,449 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 126 [2025-02-05 22:21:37,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:21:37,451 INFO L225 Difference]: With dead ends: 887 [2025-02-05 22:21:37,452 INFO L226 Difference]: Without dead ends: 575 [2025-02-05 22:21:37,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-02-05 22:21:37,453 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 421 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:21:37,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 710 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 22:21:37,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-02-05 22:21:37,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 415. [2025-02-05 22:21:37,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 324 states have (on average 1.404320987654321) internal successors, (455), 324 states have internal predecessors, (455), 85 states have call successors, (85), 5 states have call predecessors, (85), 5 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-02-05 22:21:37,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 625 transitions. [2025-02-05 22:21:37,505 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 625 transitions. Word has length 126 [2025-02-05 22:21:37,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:21:37,505 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 625 transitions. [2025-02-05 22:21:37,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 22:21:37,506 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 625 transitions. [2025-02-05 22:21:37,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 22:21:37,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:21:37,508 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:21:37,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:21:37,508 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:21:37,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:21:37,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1176602651, now seen corresponding path program 1 times [2025-02-05 22:21:37,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:21:37,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103055723] [2025-02-05 22:21:37,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:21:37,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:21:37,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 22:21:37,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 22:21:37,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:21:37,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:21:37,721 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:21:37,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:21:37,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103055723] [2025-02-05 22:21:37,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103055723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:21:37,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:21:37,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 22:21:37,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906422704] [2025-02-05 22:21:37,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:21:37,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:21:37,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:21:37,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:21:37,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:21:37,724 INFO L87 Difference]: Start difference. First operand 415 states and 625 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 22:21:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:21:38,128 INFO L93 Difference]: Finished difference Result 1643 states and 2477 transitions. [2025-02-05 22:21:38,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 22:21:38,129 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 126 [2025-02-05 22:21:38,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:21:38,134 INFO L225 Difference]: With dead ends: 1643 [2025-02-05 22:21:38,134 INFO L226 Difference]: Without dead ends: 1331 [2025-02-05 22:21:38,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-02-05 22:21:38,135 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 828 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:21:38,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 972 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:21:38,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-02-05 22:21:38,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 975. [2025-02-05 22:21:38,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 812 states have (on average 1.4470443349753694) internal successors, (1175), 812 states have internal predecessors, (1175), 153 states have call successors, (153), 9 states have call predecessors, (153), 9 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2025-02-05 22:21:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1481 transitions. [2025-02-05 22:21:38,206 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1481 transitions. Word has length 126 [2025-02-05 22:21:38,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:21:38,207 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1481 transitions. [2025-02-05 22:21:38,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 22:21:38,207 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1481 transitions. [2025-02-05 22:21:38,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 22:21:38,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:21:38,208 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:21:38,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 22:21:38,209 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:21:38,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:21:38,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1245919558, now seen corresponding path program 1 times [2025-02-05 22:21:38,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:21:38,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859901467] [2025-02-05 22:21:38,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:21:38,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:21:38,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 22:21:38,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 22:21:38,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:21:38,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:21:38,286 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:21:38,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:21:38,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859901467] [2025-02-05 22:21:38,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859901467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:21:38,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:21:38,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:21:38,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217191726] [2025-02-05 22:21:38,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:21:38,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:21:38,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:21:38,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:21:38,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:21:38,288 INFO L87 Difference]: Start difference. First operand 975 states and 1481 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:21:38,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:21:38,396 INFO L93 Difference]: Finished difference Result 1275 states and 1934 transitions. [2025-02-05 22:21:38,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:21:38,397 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2025-02-05 22:21:38,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:21:38,399 INFO L225 Difference]: With dead ends: 1275 [2025-02-05 22:21:38,399 INFO L226 Difference]: Without dead ends: 403 [2025-02-05 22:21:38,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:21:38,401 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 144 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:21:38,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 168 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:21:38,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-02-05 22:21:38,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 261. [2025-02-05 22:21:38,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 206 states have (on average 1.3786407766990292) internal successors, (284), 206 states have internal predecessors, (284), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-05 22:21:38,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 386 transitions. [2025-02-05 22:21:38,421 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 386 transitions. Word has length 126 [2025-02-05 22:21:38,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:21:38,421 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 386 transitions. [2025-02-05 22:21:38,422 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:21:38,422 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 386 transitions. [2025-02-05 22:21:38,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 22:21:38,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:21:38,422 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:21:38,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 22:21:38,423 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:21:38,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:21:38,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1973540888, now seen corresponding path program 1 times [2025-02-05 22:21:38,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:21:38,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620643877] [2025-02-05 22:21:38,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:21:38,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:21:38,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 22:21:38,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 22:21:38,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:21:38,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:21:38,689 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:21:38,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:21:38,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620643877] [2025-02-05 22:21:38,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620643877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:21:38,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:21:38,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:21:38,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271426287] [2025-02-05 22:21:38,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:21:38,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:21:38,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:21:38,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:21:38,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:21:38,691 INFO L87 Difference]: Start difference. First operand 261 states and 386 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:21:38,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:21:38,835 INFO L93 Difference]: Finished difference Result 570 states and 828 transitions. [2025-02-05 22:21:38,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 22:21:38,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 127 [2025-02-05 22:21:38,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:21:38,837 INFO L225 Difference]: With dead ends: 570 [2025-02-05 22:21:38,837 INFO L226 Difference]: Without dead ends: 395 [2025-02-05 22:21:38,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:21:38,838 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 167 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:21:38,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 292 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:21:38,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-02-05 22:21:38,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 328. [2025-02-05 22:21:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 270 states have (on average 1.3703703703703705) internal successors, (370), 270 states have internal predecessors, (370), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-05 22:21:38,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 472 transitions. [2025-02-05 22:21:38,863 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 472 transitions. Word has length 127 [2025-02-05 22:21:38,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:21:38,863 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 472 transitions. [2025-02-05 22:21:38,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:21:38,863 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 472 transitions. [2025-02-05 22:21:38,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 22:21:38,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:21:38,864 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:21:38,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 22:21:38,864 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:21:38,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:21:38,865 INFO L85 PathProgramCache]: Analyzing trace with hash 914231082, now seen corresponding path program 1 times [2025-02-05 22:21:38,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:21:38,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798279334] [2025-02-05 22:21:38,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:21:38,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:21:38,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 22:21:38,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 22:21:38,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:21:38,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:21:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:21:39,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:21:39,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798279334] [2025-02-05 22:21:39,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798279334] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:21:39,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:21:39,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:21:39,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666594974] [2025-02-05 22:21:39,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:21:39,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:21:39,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:21:39,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:21:39,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:21:39,232 INFO L87 Difference]: Start difference. First operand 328 states and 472 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:21:39,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:21:39,388 INFO L93 Difference]: Finished difference Result 671 states and 969 transitions. [2025-02-05 22:21:39,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:21:39,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 128 [2025-02-05 22:21:39,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:21:39,395 INFO L225 Difference]: With dead ends: 671 [2025-02-05 22:21:39,395 INFO L226 Difference]: Without dead ends: 430 [2025-02-05 22:21:39,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:21:39,396 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 164 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:21:39,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 309 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:21:39,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-02-05 22:21:39,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 353. [2025-02-05 22:21:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 295 states have (on average 1.3559322033898304) internal successors, (400), 295 states have internal predecessors, (400), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-05 22:21:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 502 transitions. [2025-02-05 22:21:39,424 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 502 transitions. Word has length 128 [2025-02-05 22:21:39,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:21:39,424 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 502 transitions. [2025-02-05 22:21:39,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:21:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 502 transitions. [2025-02-05 22:21:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 22:21:39,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:21:39,426 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:21:39,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 22:21:39,427 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:21:39,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:21:39,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1565731675, now seen corresponding path program 1 times [2025-02-05 22:21:39,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:21:39,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414295320] [2025-02-05 22:21:39,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:21:39,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:21:39,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 22:21:39,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 22:21:39,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:21:39,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:21:40,379 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:21:40,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:21:40,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414295320] [2025-02-05 22:21:40,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414295320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:21:40,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:21:40,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 22:21:40,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331644027] [2025-02-05 22:21:40,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:21:40,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 22:21:40,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:21:40,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 22:21:40,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-05 22:21:40,381 INFO L87 Difference]: Start difference. First operand 353 states and 502 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 22:21:41,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:21:41,303 INFO L93 Difference]: Finished difference Result 570 states and 809 transitions. [2025-02-05 22:21:41,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 22:21:41,303 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 128 [2025-02-05 22:21:41,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:21:41,305 INFO L225 Difference]: With dead ends: 570 [2025-02-05 22:21:41,305 INFO L226 Difference]: Without dead ends: 435 [2025-02-05 22:21:41,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2025-02-05 22:21:41,306 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 343 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 22:21:41,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 828 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 22:21:41,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-02-05 22:21:41,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 383. [2025-02-05 22:21:41,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 320 states have (on average 1.35625) internal successors, (434), 321 states have internal predecessors, (434), 55 states have call successors, (55), 7 states have call predecessors, (55), 7 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2025-02-05 22:21:41,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 544 transitions. [2025-02-05 22:21:41,331 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 544 transitions. Word has length 128 [2025-02-05 22:21:41,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:21:41,331 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 544 transitions. [2025-02-05 22:21:41,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 22:21:41,331 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 544 transitions. [2025-02-05 22:21:41,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 22:21:41,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:21:41,332 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:21:41,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 22:21:41,332 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:21:41,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:21:41,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1859134682, now seen corresponding path program 1 times [2025-02-05 22:21:41,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:21:41,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972240707] [2025-02-05 22:21:41,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:21:41,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:21:41,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 22:21:41,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 22:21:41,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:21:41,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:21:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:21:41,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:21:41,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972240707] [2025-02-05 22:21:41,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972240707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:21:41,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:21:41,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 22:21:41,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150429981] [2025-02-05 22:21:41,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:21:41,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 22:21:41,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:21:41,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 22:21:41,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:21:41,855 INFO L87 Difference]: Start difference. First operand 383 states and 544 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 22:21:42,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:21:42,361 INFO L93 Difference]: Finished difference Result 563 states and 800 transitions. [2025-02-05 22:21:42,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 22:21:42,362 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 128 [2025-02-05 22:21:42,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:21:42,364 INFO L225 Difference]: With dead ends: 563 [2025-02-05 22:21:42,364 INFO L226 Difference]: Without dead ends: 381 [2025-02-05 22:21:42,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-02-05 22:21:42,365 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 307 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:21:42,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 652 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 22:21:42,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-02-05 22:21:42,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 333. [2025-02-05 22:21:42,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 275 states have (on average 1.3527272727272728) internal successors, (372), 275 states have internal predecessors, (372), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-05 22:21:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 474 transitions. [2025-02-05 22:21:42,385 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 474 transitions. Word has length 128 [2025-02-05 22:21:42,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:21:42,386 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 474 transitions. [2025-02-05 22:21:42,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 22:21:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 474 transitions. [2025-02-05 22:21:42,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 22:21:42,387 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:21:42,387 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:21:42,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 22:21:42,387 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:21:42,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:21:42,387 INFO L85 PathProgramCache]: Analyzing trace with hash -311117455, now seen corresponding path program 1 times [2025-02-05 22:21:42,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:21:42,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129286276] [2025-02-05 22:21:42,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:21:42,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:21:42,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 22:21:42,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 22:21:42,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:21:42,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:21:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:21:42,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:21:42,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129286276] [2025-02-05 22:21:42,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129286276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:21:42,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:21:42,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:21:42,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136356288] [2025-02-05 22:21:42,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:21:42,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:21:42,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:21:42,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:21:42,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:21:42,739 INFO L87 Difference]: Start difference. First operand 333 states and 474 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:21:42,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:21:42,938 INFO L93 Difference]: Finished difference Result 863 states and 1248 transitions. [2025-02-05 22:21:42,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:21:42,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 129 [2025-02-05 22:21:42,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:21:42,941 INFO L225 Difference]: With dead ends: 863 [2025-02-05 22:21:42,941 INFO L226 Difference]: Without dead ends: 615 [2025-02-05 22:21:42,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:21:42,942 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 78 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:21:42,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 307 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:21:42,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-02-05 22:21:42,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 597. [2025-02-05 22:21:42,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 501 states have (on average 1.3672654690618762) internal successors, (685), 501 states have internal predecessors, (685), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-02-05 22:21:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 855 transitions. [2025-02-05 22:21:42,973 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 855 transitions. Word has length 129 [2025-02-05 22:21:42,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:21:42,973 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 855 transitions. [2025-02-05 22:21:42,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:21:42,973 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 855 transitions. [2025-02-05 22:21:42,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 22:21:42,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:21:42,974 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:21:42,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 22:21:42,974 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:21:42,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:21:42,975 INFO L85 PathProgramCache]: Analyzing trace with hash -821651632, now seen corresponding path program 1 times [2025-02-05 22:21:42,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:21:42,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232599635] [2025-02-05 22:21:42,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:21:42,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:21:42,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 22:21:43,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 22:21:43,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:21:43,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:21:43,904 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:21:43,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:21:43,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232599635] [2025-02-05 22:21:43,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232599635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:21:43,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:21:43,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 22:21:43,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900886889] [2025-02-05 22:21:43,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:21:43,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 22:21:43,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:21:43,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 22:21:43,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-05 22:21:43,906 INFO L87 Difference]: Start difference. First operand 597 states and 855 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 22:21:44,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:21:44,581 INFO L93 Difference]: Finished difference Result 1154 states and 1650 transitions. [2025-02-05 22:21:44,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 22:21:44,581 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 129 [2025-02-05 22:21:44,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:21:44,584 INFO L225 Difference]: With dead ends: 1154 [2025-02-05 22:21:44,584 INFO L226 Difference]: Without dead ends: 661 [2025-02-05 22:21:44,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-02-05 22:21:44,586 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 295 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 22:21:44,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 689 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 22:21:44,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-02-05 22:21:44,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 608. [2025-02-05 22:21:44,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 512 states have (on average 1.365234375) internal successors, (699), 512 states have internal predecessors, (699), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-02-05 22:21:44,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 869 transitions. [2025-02-05 22:21:44,620 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 869 transitions. Word has length 129 [2025-02-05 22:21:44,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:21:44,620 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 869 transitions. [2025-02-05 22:21:44,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 22:21:44,620 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 869 transitions. [2025-02-05 22:21:44,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 22:21:44,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:21:44,622 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:21:44,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 22:21:44,622 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:21:44,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:21:44,623 INFO L85 PathProgramCache]: Analyzing trace with hash 202001999, now seen corresponding path program 1 times [2025-02-05 22:21:44,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:21:44,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16384707] [2025-02-05 22:21:44,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:21:44,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:21:44,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 22:21:44,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 22:21:44,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:21:44,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:21:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:21:56,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:21:56,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16384707] [2025-02-05 22:21:56,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16384707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:21:56,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:21:56,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-05 22:21:56,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845934833] [2025-02-05 22:21:56,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:21:56,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 22:21:56,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:21:56,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 22:21:56,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-02-05 22:21:56,436 INFO L87 Difference]: Start difference. First operand 608 states and 869 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 22:21:57,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:21:57,852 INFO L93 Difference]: Finished difference Result 1153 states and 1650 transitions. [2025-02-05 22:21:57,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 22:21:57,853 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 129 [2025-02-05 22:21:57,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:21:57,857 INFO L225 Difference]: With dead ends: 1153 [2025-02-05 22:21:57,857 INFO L226 Difference]: Without dead ends: 609 [2025-02-05 22:21:57,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-02-05 22:21:57,859 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 192 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:21:57,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 627 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 22:21:57,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-02-05 22:21:57,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 579. [2025-02-05 22:21:57,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 483 states have (on average 1.360248447204969) internal successors, (657), 483 states have internal predecessors, (657), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-02-05 22:21:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 827 transitions. [2025-02-05 22:21:57,899 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 827 transitions. Word has length 129 [2025-02-05 22:21:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:21:57,899 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 827 transitions. [2025-02-05 22:21:57,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 22:21:57,899 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 827 transitions. [2025-02-05 22:21:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 22:21:57,901 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:21:57,902 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:21:57,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 22:21:57,902 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:21:57,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:21:57,902 INFO L85 PathProgramCache]: Analyzing trace with hash 246697767, now seen corresponding path program 1 times [2025-02-05 22:21:57,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:21:57,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208567800] [2025-02-05 22:21:57,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:21:57,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:21:57,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 22:21:57,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 22:21:57,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:21:57,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:21:58,308 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:21:58,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:21:58,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208567800] [2025-02-05 22:21:58,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208567800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:21:58,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:21:58,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 22:21:58,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36277609] [2025-02-05 22:21:58,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:21:58,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 22:21:58,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:21:58,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 22:21:58,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:21:58,310 INFO L87 Difference]: Start difference. First operand 579 states and 827 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:21:58,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:21:58,825 INFO L93 Difference]: Finished difference Result 1220 states and 1762 transitions. [2025-02-05 22:21:58,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 22:21:58,825 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2025-02-05 22:21:58,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:21:58,829 INFO L225 Difference]: With dead ends: 1220 [2025-02-05 22:21:58,829 INFO L226 Difference]: Without dead ends: 975 [2025-02-05 22:21:58,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-05 22:21:58,831 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 252 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:21:58,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 570 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:21:58,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-02-05 22:21:58,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 611. [2025-02-05 22:21:58,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 515 states have (on average 1.3689320388349515) internal successors, (705), 515 states have internal predecessors, (705), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-02-05 22:21:58,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 875 transitions. [2025-02-05 22:21:58,867 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 875 transitions. Word has length 130 [2025-02-05 22:21:58,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:21:58,868 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 875 transitions. [2025-02-05 22:21:58,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:21:58,869 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 875 transitions. [2025-02-05 22:21:58,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 22:21:58,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:21:58,870 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:21:58,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 22:21:58,870 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:21:58,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:21:58,870 INFO L85 PathProgramCache]: Analyzing trace with hash -263836410, now seen corresponding path program 1 times [2025-02-05 22:21:58,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:21:58,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823769966] [2025-02-05 22:21:58,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:21:58,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:21:58,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 22:21:58,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 22:21:58,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:21:58,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:22:01,198 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:22:01,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:22:01,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823769966] [2025-02-05 22:22:01,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823769966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:22:01,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:22:01,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 22:22:01,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664808330] [2025-02-05 22:22:01,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:22:01,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 22:22:01,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:22:01,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 22:22:01,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-02-05 22:22:01,200 INFO L87 Difference]: Start difference. First operand 611 states and 875 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 22:22:04,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:22:04,328 INFO L93 Difference]: Finished difference Result 953 states and 1360 transitions. [2025-02-05 22:22:04,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 22:22:04,328 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 130 [2025-02-05 22:22:04,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:22:04,331 INFO L225 Difference]: With dead ends: 953 [2025-02-05 22:22:04,331 INFO L226 Difference]: Without dead ends: 677 [2025-02-05 22:22:04,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-02-05 22:22:04,333 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 534 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:22:04,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 591 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 22:22:04,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-02-05 22:22:04,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 610. [2025-02-05 22:22:04,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 514 states have (on average 1.367704280155642) internal successors, (703), 514 states have internal predecessors, (703), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-02-05 22:22:04,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 873 transitions. [2025-02-05 22:22:04,373 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 873 transitions. Word has length 130 [2025-02-05 22:22:04,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:22:04,373 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 873 transitions. [2025-02-05 22:22:04,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 22:22:04,373 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 873 transitions. [2025-02-05 22:22:04,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 22:22:04,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:22:04,374 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:22:04,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 22:22:04,374 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:22:04,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:22:04,375 INFO L85 PathProgramCache]: Analyzing trace with hash -396714770, now seen corresponding path program 1 times [2025-02-05 22:22:04,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:22:04,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989184370] [2025-02-05 22:22:04,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:22:04,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:22:04,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 22:22:04,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 22:22:04,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:22:04,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:22:05,198 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:22:05,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:22:05,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989184370] [2025-02-05 22:22:05,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989184370] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:22:05,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:22:05,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 22:22:05,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064122628] [2025-02-05 22:22:05,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:22:05,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 22:22:05,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:22:05,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 22:22:05,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-05 22:22:05,201 INFO L87 Difference]: Start difference. First operand 610 states and 873 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 22:22:05,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:22:05,904 INFO L93 Difference]: Finished difference Result 1151 states and 1652 transitions. [2025-02-05 22:22:05,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 22:22:05,904 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 130 [2025-02-05 22:22:05,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:22:05,910 INFO L225 Difference]: With dead ends: 1151 [2025-02-05 22:22:05,910 INFO L226 Difference]: Without dead ends: 624 [2025-02-05 22:22:05,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-02-05 22:22:05,912 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 272 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 22:22:05,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 820 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 22:22:05,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-02-05 22:22:05,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 608. [2025-02-05 22:22:05,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 512 states have (on average 1.365234375) internal successors, (699), 512 states have internal predecessors, (699), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-02-05 22:22:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 869 transitions. [2025-02-05 22:22:05,949 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 869 transitions. Word has length 130 [2025-02-05 22:22:05,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:22:05,950 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 869 transitions. [2025-02-05 22:22:05,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 22:22:05,950 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 869 transitions. [2025-02-05 22:22:05,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 22:22:05,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:22:05,951 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:22:05,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 22:22:05,952 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:22:05,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:22:05,952 INFO L85 PathProgramCache]: Analyzing trace with hash -284312072, now seen corresponding path program 1 times [2025-02-05 22:22:05,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:22:05,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405147787] [2025-02-05 22:22:05,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:22:05,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:22:05,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 22:22:05,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 22:22:05,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:22:05,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:22:06,911 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:22:06,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:22:06,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405147787] [2025-02-05 22:22:06,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405147787] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:22:06,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:22:06,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 22:22:06,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604639191] [2025-02-05 22:22:06,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:22:06,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 22:22:06,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:22:06,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 22:22:06,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:22:06,913 INFO L87 Difference]: Start difference. First operand 608 states and 869 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 22:22:07,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:22:07,456 INFO L93 Difference]: Finished difference Result 917 states and 1310 transitions. [2025-02-05 22:22:07,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 22:22:07,457 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 131 [2025-02-05 22:22:07,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:22:07,461 INFO L225 Difference]: With dead ends: 917 [2025-02-05 22:22:07,461 INFO L226 Difference]: Without dead ends: 639 [2025-02-05 22:22:07,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-02-05 22:22:07,462 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 358 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:22:07,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 463 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 22:22:07,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-02-05 22:22:07,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 607. [2025-02-05 22:22:07,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 511 states have (on average 1.3639921722113504) internal successors, (697), 511 states have internal predecessors, (697), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-02-05 22:22:07,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 867 transitions. [2025-02-05 22:22:07,498 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 867 transitions. Word has length 131 [2025-02-05 22:22:07,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:22:07,498 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 867 transitions. [2025-02-05 22:22:07,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 22:22:07,498 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 867 transitions. [2025-02-05 22:22:07,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 22:22:07,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:22:07,499 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:22:07,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 22:22:07,500 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:22:07,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:22:07,500 INFO L85 PathProgramCache]: Analyzing trace with hash -449539831, now seen corresponding path program 1 times [2025-02-05 22:22:07,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:22:07,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778354615] [2025-02-05 22:22:07,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:22:07,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:22:07,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 22:22:07,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 22:22:07,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:22:07,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:22:09,671 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:22:09,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:22:09,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778354615] [2025-02-05 22:22:09,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778354615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:22:09,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:22:09,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 22:22:09,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707382010] [2025-02-05 22:22:09,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:22:09,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 22:22:09,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:22:09,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 22:22:09,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-02-05 22:22:09,673 INFO L87 Difference]: Start difference. First operand 607 states and 867 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 22:22:11,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:22:11,221 INFO L93 Difference]: Finished difference Result 1174 states and 1681 transitions. [2025-02-05 22:22:11,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 22:22:11,221 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 131 [2025-02-05 22:22:11,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:22:11,224 INFO L225 Difference]: With dead ends: 1174 [2025-02-05 22:22:11,224 INFO L226 Difference]: Without dead ends: 653 [2025-02-05 22:22:11,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2025-02-05 22:22:11,225 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 708 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 22:22:11,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 503 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 22:22:11,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-02-05 22:22:11,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 615. [2025-02-05 22:22:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 519 states have (on average 1.3622350674373795) internal successors, (707), 519 states have internal predecessors, (707), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-02-05 22:22:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 877 transitions. [2025-02-05 22:22:11,258 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 877 transitions. Word has length 131 [2025-02-05 22:22:11,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:22:11,259 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 877 transitions. [2025-02-05 22:22:11,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 22:22:11,259 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 877 transitions. [2025-02-05 22:22:11,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 22:22:11,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:22:11,259 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:22:11,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 22:22:11,260 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:22:11,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:22:11,260 INFO L85 PathProgramCache]: Analyzing trace with hash -960074008, now seen corresponding path program 1 times [2025-02-05 22:22:11,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:22:11,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609447635] [2025-02-05 22:22:11,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:22:11,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:22:11,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 22:22:11,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 22:22:11,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:22:11,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:22:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:22:24,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:22:24,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609447635] [2025-02-05 22:22:24,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609447635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:22:24,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:22:24,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-02-05 22:22:24,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129974559] [2025-02-05 22:22:24,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:22:24,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 22:22:24,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:22:24,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 22:22:24,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-02-05 22:22:24,220 INFO L87 Difference]: Start difference. First operand 615 states and 877 transitions. Second operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2025-02-05 22:22:29,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:22:29,256 INFO L93 Difference]: Finished difference Result 718 states and 1012 transitions. [2025-02-05 22:22:29,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 22:22:29,259 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 131 [2025-02-05 22:22:29,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:22:29,262 INFO L225 Difference]: With dead ends: 718 [2025-02-05 22:22:29,262 INFO L226 Difference]: Without dead ends: 716 [2025-02-05 22:22:29,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=285, Invalid=1047, Unknown=0, NotChecked=0, Total=1332 [2025-02-05 22:22:29,268 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 1025 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 22:22:29,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 627 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 22:22:29,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-02-05 22:22:29,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 631. [2025-02-05 22:22:29,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 535 states have (on average 1.360747663551402) internal successors, (728), 535 states have internal predecessors, (728), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-02-05 22:22:29,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 898 transitions. [2025-02-05 22:22:29,338 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 898 transitions. Word has length 131 [2025-02-05 22:22:29,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:22:29,338 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 898 transitions. [2025-02-05 22:22:29,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2025-02-05 22:22:29,338 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 898 transitions. [2025-02-05 22:22:29,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 22:22:29,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:22:29,339 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:22:29,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 22:22:29,339 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:22:29,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:22:29,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1056632341, now seen corresponding path program 1 times [2025-02-05 22:22:29,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:22:29,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629072879] [2025-02-05 22:22:29,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:22:29,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:22:29,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 22:22:29,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 22:22:29,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:22:29,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:22:33,749 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:22:33,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:22:33,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629072879] [2025-02-05 22:22:33,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629072879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:22:33,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:22:33,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-05 22:22:33,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201272498] [2025-02-05 22:22:33,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:22:33,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 22:22:33,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:22:33,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 22:22:33,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-02-05 22:22:33,751 INFO L87 Difference]: Start difference. First operand 631 states and 898 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 22:22:35,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:22:35,278 INFO L93 Difference]: Finished difference Result 707 states and 995 transitions. [2025-02-05 22:22:35,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 22:22:35,279 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 131 [2025-02-05 22:22:35,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:22:35,281 INFO L225 Difference]: With dead ends: 707 [2025-02-05 22:22:35,281 INFO L226 Difference]: Without dead ends: 705 [2025-02-05 22:22:35,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2025-02-05 22:22:35,282 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 442 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 22:22:35,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 760 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 22:22:35,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-02-05 22:22:35,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 635. [2025-02-05 22:22:35,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 539 states have (on average 1.3617810760667903) internal successors, (734), 539 states have internal predecessors, (734), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-02-05 22:22:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 904 transitions. [2025-02-05 22:22:35,334 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 904 transitions. Word has length 131 [2025-02-05 22:22:35,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:22:35,335 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 904 transitions. [2025-02-05 22:22:35,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 22:22:35,335 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 904 transitions. [2025-02-05 22:22:35,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 22:22:35,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:22:35,336 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:22:35,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 22:22:35,336 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:22:35,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:22:35,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1260023489, now seen corresponding path program 1 times [2025-02-05 22:22:35,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:22:35,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379164197] [2025-02-05 22:22:35,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:22:35,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:22:35,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 22:22:35,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 22:22:35,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:22:35,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:22:35,553 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:22:35,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:22:35,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379164197] [2025-02-05 22:22:35,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379164197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:22:35,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:22:35,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 22:22:35,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596239996] [2025-02-05 22:22:35,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:22:35,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 22:22:35,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:22:35,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 22:22:35,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:22:35,554 INFO L87 Difference]: Start difference. First operand 635 states and 904 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:22:35,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:22:35,783 INFO L93 Difference]: Finished difference Result 1530 states and 2206 transitions. [2025-02-05 22:22:35,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 22:22:35,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-02-05 22:22:35,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:22:35,787 INFO L225 Difference]: With dead ends: 1530 [2025-02-05 22:22:35,788 INFO L226 Difference]: Without dead ends: 996 [2025-02-05 22:22:35,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-05 22:22:35,789 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 246 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:22:35,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 627 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:22:35,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2025-02-05 22:22:35,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 657. [2025-02-05 22:22:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 561 states have (on average 1.35650623885918) internal successors, (761), 561 states have internal predecessors, (761), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-02-05 22:22:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 931 transitions. [2025-02-05 22:22:35,830 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 931 transitions. Word has length 132 [2025-02-05 22:22:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:22:35,831 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 931 transitions. [2025-02-05 22:22:35,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:22:35,831 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 931 transitions. [2025-02-05 22:22:35,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 22:22:35,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:22:35,831 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:22:35,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 22:22:35,832 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:22:35,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:22:35,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1770557666, now seen corresponding path program 1 times [2025-02-05 22:22:35,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:22:35,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75279652] [2025-02-05 22:22:35,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:22:35,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:22:35,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 22:22:35,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 22:22:35,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:22:35,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:22:42,350 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:22:42,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:22:42,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75279652] [2025-02-05 22:22:42,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75279652] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:22:42,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:22:42,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 22:22:42,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035288815] [2025-02-05 22:22:42,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:22:42,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 22:22:42,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:22:42,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 22:22:42,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-02-05 22:22:42,352 INFO L87 Difference]: Start difference. First operand 657 states and 931 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:22:44,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:22:44,261 INFO L93 Difference]: Finished difference Result 1037 states and 1456 transitions. [2025-02-05 22:22:44,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 22:22:44,264 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-02-05 22:22:44,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:22:44,266 INFO L225 Difference]: With dead ends: 1037 [2025-02-05 22:22:44,266 INFO L226 Difference]: Without dead ends: 495 [2025-02-05 22:22:44,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=221, Invalid=591, Unknown=0, NotChecked=0, Total=812 [2025-02-05 22:22:44,267 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 371 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:22:44,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 372 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 22:22:44,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-02-05 22:22:44,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 341. [2025-02-05 22:22:44,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 283 states have (on average 1.2720848056537102) internal successors, (360), 283 states have internal predecessors, (360), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-05 22:22:44,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 462 transitions. [2025-02-05 22:22:44,297 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 462 transitions. Word has length 132 [2025-02-05 22:22:44,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:22:44,298 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 462 transitions. [2025-02-05 22:22:44,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:22:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 462 transitions. [2025-02-05 22:22:44,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 22:22:44,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:22:44,299 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:22:44,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 22:22:44,299 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:22:44,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:22:44,299 INFO L85 PathProgramCache]: Analyzing trace with hash -392841130, now seen corresponding path program 1 times [2025-02-05 22:22:44,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:22:44,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367067512] [2025-02-05 22:22:44,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:22:44,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:22:44,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 22:22:44,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 22:22:44,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:22:44,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:22:51,144 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 22:22:51,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:22:51,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367067512] [2025-02-05 22:22:51,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367067512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:22:51,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:22:51,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 22:22:51,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136388357] [2025-02-05 22:22:51,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:22:51,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 22:22:51,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:22:51,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 22:22:51,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-02-05 22:22:51,145 INFO L87 Difference]: Start difference. First operand 341 states and 462 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:22:54,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:22:54,634 INFO L93 Difference]: Finished difference Result 506 states and 685 transitions. [2025-02-05 22:22:54,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-05 22:22:54,634 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-02-05 22:22:54,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:22:54,636 INFO L225 Difference]: With dead ends: 506 [2025-02-05 22:22:54,636 INFO L226 Difference]: Without dead ends: 504 [2025-02-05 22:22:54,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=437, Invalid=1369, Unknown=0, NotChecked=0, Total=1806 [2025-02-05 22:22:54,637 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 747 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:22:54,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 515 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 22:22:54,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-02-05 22:22:54,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 355. [2025-02-05 22:22:54,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 297 states have (on average 1.2861952861952861) internal successors, (382), 297 states have internal predecessors, (382), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-05 22:22:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 484 transitions. [2025-02-05 22:22:54,665 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 484 transitions. Word has length 132 [2025-02-05 22:22:54,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:22:54,665 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 484 transitions. [2025-02-05 22:22:54,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 22:22:54,665 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 484 transitions. [2025-02-05 22:22:54,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 22:22:54,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:22:54,666 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:22:54,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 22:22:54,666 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:22:54,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:22:54,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1777547871, now seen corresponding path program 1 times [2025-02-05 22:22:54,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:22:54,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922244640] [2025-02-05 22:22:54,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:22:54,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:22:54,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 22:22:54,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 22:22:54,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:22:54,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat