./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-27.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_floatingpointinfluence_no-floats_file-27.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 a5c5d56cba99a6aed857c914dae8c8b6ecbf5d7f26fcada2d40cfcad19c68691 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:33:26,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:33:26,074 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 00:33:26,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:33:26,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:33:26,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:33:26,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:33:26,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:33:26,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:33:26,092 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:33:26,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:33:26,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:33:26,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:33:26,092 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:33:26,093 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:33:26,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:33:26,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:33:26,093 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:33:26,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 00:33:26,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:33:26,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:33:26,093 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:33:26,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:33:26,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:33:26,093 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:33:26,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:33:26,094 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:33:26,094 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:33:26,094 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:33:26,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:33:26,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:33:26,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:33:26,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:33:26,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:33:26,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:33:26,094 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:33:26,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:33:26,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 00:33:26,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 00:33:26,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:33:26,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:33:26,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:33:26,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:33:26,095 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 -> a5c5d56cba99a6aed857c914dae8c8b6ecbf5d7f26fcada2d40cfcad19c68691 [2025-02-06 00:33:26,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:33:26,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:33:26,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:33:26,331 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:33:26,331 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:33:26,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-27.i [2025-02-06 00:33:27,465 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1619aee23/d42349808dcb4e20a1a0290277b48a6b/FLAG173fed2a9 [2025-02-06 00:33:27,708 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:33:27,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-27.i [2025-02-06 00:33:27,713 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1619aee23/d42349808dcb4e20a1a0290277b48a6b/FLAG173fed2a9 [2025-02-06 00:33:27,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1619aee23/d42349808dcb4e20a1a0290277b48a6b [2025-02-06 00:33:27,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:33:27,725 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:33:27,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:33:27,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:33:27,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:33:27,730 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:33:27" (1/1) ... [2025-02-06 00:33:27,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f928799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:27, skipping insertion in model container [2025-02-06 00:33:27,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:33:27" (1/1) ... [2025-02-06 00:33:27,745 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:33:27,846 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_floatingpointinfluence_no-floats_file-27.i[916,929] [2025-02-06 00:33:27,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:33:27,891 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:33:27,898 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_floatingpointinfluence_no-floats_file-27.i[916,929] [2025-02-06 00:33:27,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:33:27,933 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:33:27,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:27 WrapperNode [2025-02-06 00:33:27,934 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:33:27,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:33:27,935 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:33:27,935 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:33:27,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:27" (1/1) ... [2025-02-06 00:33:27,944 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:27" (1/1) ... [2025-02-06 00:33:27,959 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2025-02-06 00:33:27,959 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:33:27,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:33:27,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:33:27,960 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:33:27,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:27" (1/1) ... [2025-02-06 00:33:27,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:27" (1/1) ... [2025-02-06 00:33:27,967 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:27" (1/1) ... [2025-02-06 00:33:27,975 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 00:33:27,976 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:27" (1/1) ... [2025-02-06 00:33:27,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:27" (1/1) ... [2025-02-06 00:33:27,978 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:27" (1/1) ... [2025-02-06 00:33:27,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:27" (1/1) ... [2025-02-06 00:33:27,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:27" (1/1) ... [2025-02-06 00:33:27,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:27" (1/1) ... [2025-02-06 00:33:27,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:33:27,981 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:33:27,982 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:33:27,982 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:33:27,982 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:27" (1/1) ... [2025-02-06 00:33:27,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:33:27,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:33:28,003 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 00:33:28,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 00:33:28,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:33:28,021 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:33:28,022 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:33:28,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 00:33:28,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:33:28,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:33:28,070 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:33:28,072 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:33:28,221 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-06 00:33:28,221 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:33:28,229 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:33:28,229 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:33:28,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:33:28 BoogieIcfgContainer [2025-02-06 00:33:28,230 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:33:28,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:33:28,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:33:28,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:33:28,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:33:27" (1/3) ... [2025-02-06 00:33:28,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b6ff7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:33:28, skipping insertion in model container [2025-02-06 00:33:28,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:27" (2/3) ... [2025-02-06 00:33:28,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b6ff7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:33:28, skipping insertion in model container [2025-02-06 00:33:28,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:33:28" (3/3) ... [2025-02-06 00:33:28,237 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-27.i [2025-02-06 00:33:28,247 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:33:28,248 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-27.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:33:28,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:33:28,291 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;@3e2654f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:33:28,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:33:28,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 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-06 00:33:28,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 00:33:28,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:33:28,301 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] [2025-02-06 00:33:28,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:33:28,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:33:28,305 INFO L85 PathProgramCache]: Analyzing trace with hash 958172990, now seen corresponding path program 1 times [2025-02-06 00:33:28,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:33:28,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619291640] [2025-02-06 00:33:28,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:33:28,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:33:28,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 00:33:28,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 00:33:28,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:33:28,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:33:28,507 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-06 00:33:28,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:33:28,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619291640] [2025-02-06 00:33:28,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619291640] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:33:28,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107240641] [2025-02-06 00:33:28,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:33:28,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:33:28,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:33:28,510 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:33:28,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 00:33:28,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 00:33:28,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 00:33:28,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:33:28,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:33:28,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:33:28,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:33:28,641 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-06 00:33:28,642 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:33:28,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107240641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:33:28,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 00:33:28,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 00:33:28,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045308155] [2025-02-06 00:33:28,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:33:28,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:33:28,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:33:28,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:33:28,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:33:28,661 INFO L87 Difference]: Start difference. First operand has 52 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-06 00:33:28,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:33:28,677 INFO L93 Difference]: Finished difference Result 98 states and 164 transitions. [2025-02-06 00:33:28,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:33:28,679 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 109 [2025-02-06 00:33:28,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:33:28,683 INFO L225 Difference]: With dead ends: 98 [2025-02-06 00:33:28,683 INFO L226 Difference]: Without dead ends: 49 [2025-02-06 00:33:28,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:33:28,687 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:33:28,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:33:28,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-06 00:33:28,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-06 00:33:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 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-06 00:33:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2025-02-06 00:33:28,713 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 109 [2025-02-06 00:33:28,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:33:28,714 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2025-02-06 00:33:28,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-06 00:33:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2025-02-06 00:33:28,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 00:33:28,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:33:28,717 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] [2025-02-06 00:33:28,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 00:33:28,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 00:33:28,921 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:33:28,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:33:28,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1540454017, now seen corresponding path program 1 times [2025-02-06 00:33:28,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:33:28,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846064874] [2025-02-06 00:33:28,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:33:28,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:33:28,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 00:33:29,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 00:33:29,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:33:29,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:33:32,385 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-06 00:33:32,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:33:32,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846064874] [2025-02-06 00:33:32,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846064874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:33:32,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:33:32,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 00:33:32,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108822685] [2025-02-06 00:33:32,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:33:32,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 00:33:32,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:33:32,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 00:33:32,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 00:33:32,387 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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-06 00:33:32,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:33:32,740 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2025-02-06 00:33:32,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 00:33:32,740 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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 109 [2025-02-06 00:33:32,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:33:32,741 INFO L225 Difference]: With dead ends: 97 [2025-02-06 00:33:32,741 INFO L226 Difference]: Without dead ends: 95 [2025-02-06 00:33:32,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-02-06 00:33:32,742 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 99 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:33:32,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 275 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 00:33:32,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-06 00:33:32,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 64. [2025-02-06 00:33:32,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 00:33:32,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2025-02-06 00:33:32,760 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 109 [2025-02-06 00:33:32,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:33:32,762 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2025-02-06 00:33:32,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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-06 00:33:32,762 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2025-02-06 00:33:32,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 00:33:32,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:33:32,763 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] [2025-02-06 00:33:32,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 00:33:32,764 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:33:32,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:33:32,764 INFO L85 PathProgramCache]: Analyzing trace with hash -652950336, now seen corresponding path program 1 times [2025-02-06 00:33:32,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:33:32,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561576626] [2025-02-06 00:33:32,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:33:32,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:33:32,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 00:33:32,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 00:33:32,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:33:32,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:33:34,623 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-06 00:33:34,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:33:34,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561576626] [2025-02-06 00:33:34,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561576626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:33:34,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:33:34,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 00:33:34,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590733227] [2025-02-06 00:33:34,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:33:34,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 00:33:34,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:33:34,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 00:33:34,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 00:33:34,625 INFO L87 Difference]: Start difference. First operand 64 states and 89 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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-06 00:33:34,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:33:34,998 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2025-02-06 00:33:34,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 00:33:34,999 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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 109 [2025-02-06 00:33:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:33:35,000 INFO L225 Difference]: With dead ends: 95 [2025-02-06 00:33:35,000 INFO L226 Difference]: Without dead ends: 93 [2025-02-06 00:33:35,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-02-06 00:33:35,001 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 57 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:33:35,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 362 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 00:33:35,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-06 00:33:35,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 64. [2025-02-06 00:33:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 00:33:35,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2025-02-06 00:33:35,016 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 109 [2025-02-06 00:33:35,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:33:35,016 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2025-02-06 00:33:35,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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-06 00:33:35,016 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2025-02-06 00:33:35,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 00:33:35,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:33:35,019 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] [2025-02-06 00:33:35,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 00:33:35,019 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:33:35,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:33:35,020 INFO L85 PathProgramCache]: Analyzing trace with hash -479820058, now seen corresponding path program 1 times [2025-02-06 00:33:35,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:33:35,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424279262] [2025-02-06 00:33:35,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:33:35,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:33:35,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 00:33:35,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 00:33:35,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:33:35,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:33:41,093 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-06 00:33:41,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:33:41,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424279262] [2025-02-06 00:33:41,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424279262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:33:41,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:33:41,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 00:33:41,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122697938] [2025-02-06 00:33:41,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:33:41,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 00:33:41,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:33:41,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 00:33:41,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-06 00:33:41,095 INFO L87 Difference]: Start difference. First operand 64 states and 89 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 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-06 00:33:44,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:33:44,583 INFO L93 Difference]: Finished difference Result 139 states and 178 transitions. [2025-02-06 00:33:44,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 00:33:44,583 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 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 110 [2025-02-06 00:33:44,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:33:44,585 INFO L225 Difference]: With dead ends: 139 [2025-02-06 00:33:44,585 INFO L226 Difference]: Without dead ends: 137 [2025-02-06 00:33:44,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-02-06 00:33:44,586 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 99 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:33:44,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 448 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 00:33:44,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-06 00:33:44,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 71. [2025-02-06 00:33:44,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 50 states have internal predecessors, (62), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 00:33:44,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2025-02-06 00:33:44,595 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 110 [2025-02-06 00:33:44,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:33:44,595 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2025-02-06 00:33:44,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 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-06 00:33:44,595 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2025-02-06 00:33:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 00:33:44,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:33:44,600 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] [2025-02-06 00:33:44,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 00:33:44,600 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:33:44,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:33:44,601 INFO L85 PathProgramCache]: Analyzing trace with hash -478896537, now seen corresponding path program 1 times [2025-02-06 00:33:44,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:33:44,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156153041] [2025-02-06 00:33:44,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:33:44,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:33:44,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 00:33:44,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 00:33:44,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:33:44,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:33:56,294 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-06 00:33:56,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:33:56,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156153041] [2025-02-06 00:33:56,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156153041] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:33:56,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:33:56,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-06 00:33:56,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201904517] [2025-02-06 00:33:56,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:33:56,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 00:33:56,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:33:56,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 00:33:56,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-02-06 00:33:56,297 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 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-06 00:33:59,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:33:59,106 INFO L93 Difference]: Finished difference Result 118 states and 150 transitions. [2025-02-06 00:33:59,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 00:33:59,107 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 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 110 [2025-02-06 00:33:59,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:33:59,108 INFO L225 Difference]: With dead ends: 118 [2025-02-06 00:33:59,108 INFO L226 Difference]: Without dead ends: 116 [2025-02-06 00:33:59,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2025-02-06 00:33:59,109 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 216 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:33:59,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 324 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 00:33:59,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-06 00:33:59,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 84. [2025-02-06 00:33:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 00:33:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 114 transitions. [2025-02-06 00:33:59,120 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 114 transitions. Word has length 110 [2025-02-06 00:33:59,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:33:59,121 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 114 transitions. [2025-02-06 00:33:59,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 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-06 00:33:59,121 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 114 transitions. [2025-02-06 00:33:59,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 00:33:59,121 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:33:59,122 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] [2025-02-06 00:33:59,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 00:33:59,122 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:33:59,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:33:59,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1262990277, now seen corresponding path program 1 times [2025-02-06 00:33:59,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:33:59,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400619876] [2025-02-06 00:33:59,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:33:59,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:33:59,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 00:33:59,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 00:33:59,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:33:59,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:34:03,515 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-06 00:34:03,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:34:03,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400619876] [2025-02-06 00:34:03,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400619876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:34:03,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:34:03,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 00:34:03,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225882436] [2025-02-06 00:34:03,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:34:03,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 00:34:03,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:34:03,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 00:34:03,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-02-06 00:34:03,517 INFO L87 Difference]: Start difference. First operand 84 states and 114 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 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-06 00:34:05,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:34:05,469 INFO L93 Difference]: Finished difference Result 151 states and 190 transitions. [2025-02-06 00:34:05,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 00:34:05,469 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 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 110 [2025-02-06 00:34:05,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:34:05,470 INFO L225 Difference]: With dead ends: 151 [2025-02-06 00:34:05,470 INFO L226 Difference]: Without dead ends: 149 [2025-02-06 00:34:05,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2025-02-06 00:34:05,471 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 149 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 00:34:05,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 407 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 00:34:05,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-02-06 00:34:05,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 83. [2025-02-06 00:34:05,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 61 states have internal predecessors, (79), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 00:34:05,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 113 transitions. [2025-02-06 00:34:05,484 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 113 transitions. Word has length 110 [2025-02-06 00:34:05,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:34:05,485 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 113 transitions. [2025-02-06 00:34:05,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 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-06 00:34:05,485 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 113 transitions. [2025-02-06 00:34:05,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 00:34:05,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:34:05,488 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] [2025-02-06 00:34:05,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 00:34:05,488 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:34:05,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:34:05,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1263913798, now seen corresponding path program 1 times [2025-02-06 00:34:05,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:34:05,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655003387] [2025-02-06 00:34:05,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:34:05,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:34:05,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 00:34:05,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 00:34:05,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:34:05,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:34:10,611 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-06 00:34:10,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:34:10,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655003387] [2025-02-06 00:34:10,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655003387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:34:10,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:34:10,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 00:34:10,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096911576] [2025-02-06 00:34:10,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:34:10,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 00:34:10,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:34:10,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 00:34:10,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-02-06 00:34:10,612 INFO L87 Difference]: Start difference. First operand 83 states and 113 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 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-06 00:34:13,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:34:13,503 INFO L93 Difference]: Finished difference Result 141 states and 179 transitions. [2025-02-06 00:34:13,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 00:34:13,504 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 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 110 [2025-02-06 00:34:13,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:34:13,505 INFO L225 Difference]: With dead ends: 141 [2025-02-06 00:34:13,505 INFO L226 Difference]: Without dead ends: 139 [2025-02-06 00:34:13,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-02-06 00:34:13,506 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 58 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 00:34:13,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 473 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 00:34:13,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-06 00:34:13,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 80. [2025-02-06 00:34:13,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 58 states have internal predecessors, (74), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 00:34:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 108 transitions. [2025-02-06 00:34:13,517 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 108 transitions. Word has length 110 [2025-02-06 00:34:13,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:34:13,520 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 108 transitions. [2025-02-06 00:34:13,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 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-06 00:34:13,520 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 108 transitions. [2025-02-06 00:34:13,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 00:34:13,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:34:13,521 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] [2025-02-06 00:34:13,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 00:34:13,521 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:34:13,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:34:13,522 INFO L85 PathProgramCache]: Analyzing trace with hash -2088123418, now seen corresponding path program 1 times [2025-02-06 00:34:13,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:34:13,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294767364] [2025-02-06 00:34:13,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:34:13,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:34:13,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 00:34:13,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 00:34:13,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:34:13,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:34:14,973 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-06 00:34:14,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:34:14,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294767364] [2025-02-06 00:34:14,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294767364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:34:14,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:34:14,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 00:34:14,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980966577] [2025-02-06 00:34:14,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:34:14,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 00:34:14,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:34:14,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 00:34:14,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 00:34:14,975 INFO L87 Difference]: Start difference. First operand 80 states and 108 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 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-06 00:34:15,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:34:15,582 INFO L93 Difference]: Finished difference Result 256 states and 336 transitions. [2025-02-06 00:34:15,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 00:34:15,583 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 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 110 [2025-02-06 00:34:15,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:34:15,584 INFO L225 Difference]: With dead ends: 256 [2025-02-06 00:34:15,585 INFO L226 Difference]: Without dead ends: 179 [2025-02-06 00:34:15,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2025-02-06 00:34:15,586 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 106 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 00:34:15,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 421 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 00:34:15,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-02-06 00:34:15,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 144. [2025-02-06 00:34:15,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 101 states have (on average 1.2277227722772277) internal successors, (124), 101 states have internal predecessors, (124), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 00:34:15,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 192 transitions. [2025-02-06 00:34:15,605 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 192 transitions. Word has length 110 [2025-02-06 00:34:15,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:34:15,605 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 192 transitions. [2025-02-06 00:34:15,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 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-06 00:34:15,605 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 192 transitions. [2025-02-06 00:34:15,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 00:34:15,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:34:15,606 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] [2025-02-06 00:34:15,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 00:34:15,606 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:34:15,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:34:15,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1200619737, now seen corresponding path program 1 times [2025-02-06 00:34:15,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:34:15,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012996340] [2025-02-06 00:34:15,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:34:15,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:34:15,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 00:34:15,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 00:34:15,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:34:15,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:34:15,646 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-06 00:34:15,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:34:15,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012996340] [2025-02-06 00:34:15,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012996340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:34:15,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:34:15,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 00:34:15,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967098349] [2025-02-06 00:34:15,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:34:15,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:34:15,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:34:15,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:34:15,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:34:15,648 INFO L87 Difference]: Start difference. First operand 144 states and 192 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-06 00:34:15,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:34:15,691 INFO L93 Difference]: Finished difference Result 342 states and 456 transitions. [2025-02-06 00:34:15,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:34:15,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 110 [2025-02-06 00:34:15,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:34:15,694 INFO L225 Difference]: With dead ends: 342 [2025-02-06 00:34:15,694 INFO L226 Difference]: Without dead ends: 201 [2025-02-06 00:34:15,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:34:15,695 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 29 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:34:15,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 211 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:34:15,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-06 00:34:15,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-02-06 00:34:15,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 137 states have (on average 1.197080291970803) internal successors, (164), 137 states have internal predecessors, (164), 51 states have call successors, (51), 12 states have call predecessors, (51), 12 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-06 00:34:15,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 266 transitions. [2025-02-06 00:34:15,732 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 266 transitions. Word has length 110 [2025-02-06 00:34:15,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:34:15,732 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 266 transitions. [2025-02-06 00:34:15,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-06 00:34:15,733 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 266 transitions. [2025-02-06 00:34:15,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 00:34:15,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:34:15,733 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] [2025-02-06 00:34:15,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 00:34:15,734 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:34:15,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:34:15,734 INFO L85 PathProgramCache]: Analyzing trace with hash -350737339, now seen corresponding path program 1 times [2025-02-06 00:34:15,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:34:15,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041126848] [2025-02-06 00:34:15,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:34:15,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:34:15,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 00:34:15,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 00:34:15,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:34:15,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:34:15,764 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-06 00:34:15,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:34:15,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041126848] [2025-02-06 00:34:15,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041126848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:34:15,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:34:15,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:34:15,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415187303] [2025-02-06 00:34:15,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:34:15,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:34:15,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:34:15,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:34:15,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:34:15,766 INFO L87 Difference]: Start difference. First operand 201 states and 266 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-06 00:34:15,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:34:15,818 INFO L93 Difference]: Finished difference Result 391 states and 508 transitions. [2025-02-06 00:34:15,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:34:15,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 110 [2025-02-06 00:34:15,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:34:15,822 INFO L225 Difference]: With dead ends: 391 [2025-02-06 00:34:15,823 INFO L226 Difference]: Without dead ends: 250 [2025-02-06 00:34:15,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:34:15,825 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 34 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:34:15,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 138 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:34:15,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-02-06 00:34:15,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 245. [2025-02-06 00:34:15,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 167 states have (on average 1.1437125748502994) internal successors, (191), 168 states have internal predecessors, (191), 59 states have call successors, (59), 18 states have call predecessors, (59), 18 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-06 00:34:15,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 309 transitions. [2025-02-06 00:34:15,863 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 309 transitions. Word has length 110 [2025-02-06 00:34:15,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:34:15,866 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 309 transitions. [2025-02-06 00:34:15,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-06 00:34:15,866 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 309 transitions. [2025-02-06 00:34:15,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 00:34:15,867 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:34:15,867 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] [2025-02-06 00:34:15,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 00:34:15,867 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:34:15,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:34:15,868 INFO L85 PathProgramCache]: Analyzing trace with hash -81188800, now seen corresponding path program 1 times [2025-02-06 00:34:15,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:34:15,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475087129] [2025-02-06 00:34:15,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:34:15,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:34:15,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 00:34:15,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 00:34:15,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:34:15,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:34:18,620 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-06 00:34:18,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:34:18,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475087129] [2025-02-06 00:34:18,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475087129] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:34:18,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:34:18,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 00:34:18,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833291404] [2025-02-06 00:34:18,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:34:18,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 00:34:18,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:34:18,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 00:34:18,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-06 00:34:18,621 INFO L87 Difference]: Start difference. First operand 245 states and 309 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 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-06 00:34:19,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:34:19,593 INFO L93 Difference]: Finished difference Result 406 states and 505 transitions. [2025-02-06 00:34:19,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 00:34:19,594 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 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 111 [2025-02-06 00:34:19,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:34:19,595 INFO L225 Difference]: With dead ends: 406 [2025-02-06 00:34:19,596 INFO L226 Difference]: Without dead ends: 226 [2025-02-06 00:34:19,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-02-06 00:34:19,597 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 95 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 00:34:19,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 482 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 00:34:19,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-02-06 00:34:19,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 181. [2025-02-06 00:34:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 125 states have (on average 1.144) internal successors, (143), 126 states have internal predecessors, (143), 42 states have call successors, (42), 13 states have call predecessors, (42), 13 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 00:34:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 227 transitions. [2025-02-06 00:34:19,620 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 227 transitions. Word has length 111 [2025-02-06 00:34:19,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:34:19,620 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 227 transitions. [2025-02-06 00:34:19,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 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-06 00:34:19,620 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 227 transitions. [2025-02-06 00:34:19,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 00:34:19,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:34:19,621 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] [2025-02-06 00:34:19,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 00:34:19,621 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:34:19,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:34:19,622 INFO L85 PathProgramCache]: Analyzing trace with hash -80265279, now seen corresponding path program 1 times [2025-02-06 00:34:19,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:34:19,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67868652] [2025-02-06 00:34:19,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:34:19,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:34:19,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 00:34:19,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 00:34:19,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:34:19,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:34:21,266 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-06 00:34:21,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:34:21,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67868652] [2025-02-06 00:34:21,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67868652] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:34:21,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:34:21,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 00:34:21,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435770842] [2025-02-06 00:34:21,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:34:21,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 00:34:21,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:34:21,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 00:34:21,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-02-06 00:34:21,268 INFO L87 Difference]: Start difference. First operand 181 states and 227 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 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-06 00:34:21,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:34:21,908 INFO L93 Difference]: Finished difference Result 226 states and 274 transitions. [2025-02-06 00:34:21,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 00:34:21,909 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 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 111 [2025-02-06 00:34:21,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:34:21,911 INFO L225 Difference]: With dead ends: 226 [2025-02-06 00:34:21,911 INFO L226 Difference]: Without dead ends: 224 [2025-02-06 00:34:21,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-02-06 00:34:21,912 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 89 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 00:34:21,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 502 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 00:34:21,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-02-06 00:34:21,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 180. [2025-02-06 00:34:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 125 states have internal predecessors, (141), 42 states have call successors, (42), 13 states have call predecessors, (42), 13 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 00:34:21,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 225 transitions. [2025-02-06 00:34:21,937 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 225 transitions. Word has length 111 [2025-02-06 00:34:21,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:34:21,937 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 225 transitions. [2025-02-06 00:34:21,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 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-06 00:34:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 225 transitions. [2025-02-06 00:34:21,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 00:34:21,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:34:21,938 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] [2025-02-06 00:34:21,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 00:34:21,938 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:34:21,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:34:21,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1661621535, now seen corresponding path program 1 times [2025-02-06 00:34:21,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:34:21,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417921840] [2025-02-06 00:34:21,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:34:21,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:34:21,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 00:34:21,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 00:34:21,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:34:21,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:34:24,537 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-06 00:34:24,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:34:24,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417921840] [2025-02-06 00:34:24,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417921840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:34:24,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:34:24,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 00:34:24,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380193444] [2025-02-06 00:34:24,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:34:24,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 00:34:24,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:34:24,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 00:34:24,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-06 00:34:24,539 INFO L87 Difference]: Start difference. First operand 180 states and 225 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 00:34:27,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:34:27,455 INFO L93 Difference]: Finished difference Result 256 states and 306 transitions. [2025-02-06 00:34:27,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 00:34:27,455 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 111 [2025-02-06 00:34:27,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:34:27,457 INFO L225 Difference]: With dead ends: 256 [2025-02-06 00:34:27,457 INFO L226 Difference]: Without dead ends: 254 [2025-02-06 00:34:27,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2025-02-06 00:34:27,457 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 137 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 00:34:27,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 481 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 00:34:27,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-02-06 00:34:27,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 180. [2025-02-06 00:34:27,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 125 states have internal predecessors, (141), 42 states have call successors, (42), 13 states have call predecessors, (42), 13 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 00:34:27,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 225 transitions. [2025-02-06 00:34:27,483 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 225 transitions. Word has length 111 [2025-02-06 00:34:27,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:34:27,483 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 225 transitions. [2025-02-06 00:34:27,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 00:34:27,483 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 225 transitions. [2025-02-06 00:34:27,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 00:34:27,484 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:34:27,484 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] [2025-02-06 00:34:27,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 00:34:27,484 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:34:27,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:34:27,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1662545056, now seen corresponding path program 1 times [2025-02-06 00:34:27,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:34:27,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470012288] [2025-02-06 00:34:27,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:34:27,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:34:27,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 00:34:27,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 00:34:27,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:34:27,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:34:29,560 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-06 00:34:29,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:34:29,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470012288] [2025-02-06 00:34:29,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470012288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:34:29,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:34:29,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 00:34:29,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084381752] [2025-02-06 00:34:29,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:34:29,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 00:34:29,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:34:29,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 00:34:29,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-02-06 00:34:29,561 INFO L87 Difference]: Start difference. First operand 180 states and 225 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 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-06 00:34:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:34:30,845 INFO L93 Difference]: Finished difference Result 251 states and 301 transitions. [2025-02-06 00:34:30,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 00:34:30,846 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 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 111 [2025-02-06 00:34:30,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:34:30,848 INFO L225 Difference]: With dead ends: 251 [2025-02-06 00:34:30,848 INFO L226 Difference]: Without dead ends: 249 [2025-02-06 00:34:30,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-02-06 00:34:30,848 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 75 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 00:34:30,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 407 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 00:34:30,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-02-06 00:34:30,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 174. [2025-02-06 00:34:30,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 118 states have (on average 1.1271186440677967) internal successors, (133), 119 states have internal predecessors, (133), 42 states have call successors, (42), 13 states have call predecessors, (42), 13 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 00:34:30,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 217 transitions. [2025-02-06 00:34:30,875 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 217 transitions. Word has length 111 [2025-02-06 00:34:30,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:34:30,875 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 217 transitions. [2025-02-06 00:34:30,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 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-06 00:34:30,875 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 217 transitions. [2025-02-06 00:34:30,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-02-06 00:34:30,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:34:30,876 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:34:30,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 00:34:30,877 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:34:30,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:34:30,877 INFO L85 PathProgramCache]: Analyzing trace with hash 34007713, now seen corresponding path program 1 times [2025-02-06 00:34:30,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:34:30,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205739386] [2025-02-06 00:34:30,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:34:30,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:34:30,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-06 00:34:30,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-06 00:34:30,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:34:30,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:34:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2281 backedges. 31 proven. 6 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-06 00:34:32,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:34:32,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205739386] [2025-02-06 00:34:32,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205739386] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:34:32,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447801366] [2025-02-06 00:34:32,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:34:32,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:34:32,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:34:32,405 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:34:32,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 00:34:32,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-06 00:34:32,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-06 00:34:32,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:34:32,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:34:32,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 00:34:32,562 INFO L279 TraceCheckSpWp]: Computing forward predicates...