./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-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_has-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 c02d96b2e66c5d16a70019b8ee62d80e443fba6c783a0dd61954285e06f10d7d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:21:31,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:21:31,554 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:21:31,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:21:31,559 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:21:31,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:21:31,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:21:31,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:21:31,581 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:21:31,581 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:21:31,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:21:31,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:21:31,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:21:31,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:21:31,583 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:21:31,583 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:21:31,583 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:21:31,583 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:21:31,583 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 00:21:31,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:21:31,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:21:31,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:21:31,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:21:31,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:21:31,584 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:21:31,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:21:31,584 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:21:31,584 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:21:31,584 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:21:31,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:21:31,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:21:31,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:21:31,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:21:31,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:21:31,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:21:31,585 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:21:31,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:21:31,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 00:21:31,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 00:21:31,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:21:31,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:21:31,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:21:31,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:21:31,586 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 -> c02d96b2e66c5d16a70019b8ee62d80e443fba6c783a0dd61954285e06f10d7d [2025-02-06 00:21:31,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:21:31,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:21:31,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:21:31,832 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:21:31,832 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:21:31,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-27.i [2025-02-06 00:21:33,009 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1684d9d66/cf20d3f266964e70ba2beecb45ea2378/FLAG8befe510f [2025-02-06 00:21:33,238 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:21:33,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-27.i [2025-02-06 00:21:33,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1684d9d66/cf20d3f266964e70ba2beecb45ea2378/FLAG8befe510f [2025-02-06 00:21:33,574 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1684d9d66/cf20d3f266964e70ba2beecb45ea2378 [2025-02-06 00:21:33,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:21:33,577 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:21:33,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:21:33,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:21:33,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:21:33,583 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:21:33" (1/1) ... [2025-02-06 00:21:33,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ff88aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:21:33, skipping insertion in model container [2025-02-06 00:21:33,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:21:33" (1/1) ... [2025-02-06 00:21:33,602 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:21:33,709 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_has-floats_file-27.i[917,930] [2025-02-06 00:21:33,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:21:33,756 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:21:33,766 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_has-floats_file-27.i[917,930] [2025-02-06 00:21:33,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:21:33,809 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:21:33,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:21:33 WrapperNode [2025-02-06 00:21:33,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:21:33,815 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:21:33,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:21:33,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:21:33,820 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:21:33" (1/1) ... [2025-02-06 00:21:33,829 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:21:33" (1/1) ... [2025-02-06 00:21:33,852 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2025-02-06 00:21:33,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:21:33,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:21:33,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:21:33,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:21:33,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:21:33" (1/1) ... [2025-02-06 00:21:33,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:21:33" (1/1) ... [2025-02-06 00:21:33,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:21:33" (1/1) ... [2025-02-06 00:21:33,877 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:21:33,879 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:21:33" (1/1) ... [2025-02-06 00:21:33,879 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:21:33" (1/1) ... [2025-02-06 00:21:33,884 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:21:33" (1/1) ... [2025-02-06 00:21:33,887 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:21:33" (1/1) ... [2025-02-06 00:21:33,888 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:21:33" (1/1) ... [2025-02-06 00:21:33,889 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:21:33" (1/1) ... [2025-02-06 00:21:33,890 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:21:33,890 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:21:33,890 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:21:33,890 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:21:33,893 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:21:33" (1/1) ... [2025-02-06 00:21:33,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:21:33,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:21:33,923 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:21:33,926 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:21:33,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:21:33,946 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:21:33,946 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:21:33,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 00:21:33,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:21:33,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:21:33,989 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:21:33,991 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:21:34,191 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-06 00:21:34,191 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:21:34,201 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:21:34,202 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:21:34,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:21:34 BoogieIcfgContainer [2025-02-06 00:21:34,202 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:21:34,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:21:34,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:21:34,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:21:34,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:21:33" (1/3) ... [2025-02-06 00:21:34,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f392d3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:21:34, skipping insertion in model container [2025-02-06 00:21:34,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:21:33" (2/3) ... [2025-02-06 00:21:34,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f392d3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:21:34, skipping insertion in model container [2025-02-06 00:21:34,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:21:34" (3/3) ... [2025-02-06 00:21:34,211 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-27.i [2025-02-06 00:21:34,220 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:21:34,221 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-27.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:21:34,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:21:34,272 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;@676bad7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:21:34,273 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:21:34,276 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:21:34,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 00:21:34,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:21:34,287 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:21:34,287 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:21:34,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:21:34,291 INFO L85 PathProgramCache]: Analyzing trace with hash 958172990, now seen corresponding path program 1 times [2025-02-06 00:21:34,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:21:34,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818299455] [2025-02-06 00:21:34,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:21:34,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:21:34,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 00:21:34,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 00:21:34,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:21:34,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:21:34,486 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:21:34,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:21:34,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818299455] [2025-02-06 00:21:34,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818299455] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:21:34,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544903304] [2025-02-06 00:21:34,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:21:34,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:21:34,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:21:34,493 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:21:34,495 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:21:34,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 00:21:34,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 00:21:34,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:21:34,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:21:34,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:21:34,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:21:34,640 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:21:34,641 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:21:34,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544903304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:21:34,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 00:21:34,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 00:21:34,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689537965] [2025-02-06 00:21:34,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:21:34,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:21:34,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:21:34,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:21:34,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:21:34,668 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:21:34,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:21:34,686 INFO L93 Difference]: Finished difference Result 98 states and 164 transitions. [2025-02-06 00:21:34,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:21:34,688 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:21:34,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:21:34,695 INFO L225 Difference]: With dead ends: 98 [2025-02-06 00:21:34,695 INFO L226 Difference]: Without dead ends: 49 [2025-02-06 00:21:34,698 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:21:34,700 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:21:34,701 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:21:34,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-06 00:21:34,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-06 00:21:34,724 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:21:34,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2025-02-06 00:21:34,729 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 109 [2025-02-06 00:21:34,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:21:34,730 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2025-02-06 00:21:34,730 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:21:34,730 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2025-02-06 00:21:34,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 00:21:34,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:21:34,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] [2025-02-06 00:21:34,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 00:21:34,934 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:21:34,934 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:21:34,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:21:34,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1540454017, now seen corresponding path program 1 times [2025-02-06 00:21:34,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:21:34,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476657655] [2025-02-06 00:21:34,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:21:34,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:21:34,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 00:21:35,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 00:21:35,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:21:35,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:21:38,571 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:21:38,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:21:38,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476657655] [2025-02-06 00:21:38,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476657655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:21:38,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:21:38,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 00:21:38,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595257044] [2025-02-06 00:21:38,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:21:38,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 00:21:38,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:21:38,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 00:21:38,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 00:21:38,574 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:21:38,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:21:38,908 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2025-02-06 00:21:38,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 00:21:38,909 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:21:38,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:21:38,910 INFO L225 Difference]: With dead ends: 97 [2025-02-06 00:21:38,910 INFO L226 Difference]: Without dead ends: 95 [2025-02-06 00:21:38,911 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:21:38,911 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:21:38,911 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:21:38,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-06 00:21:38,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 64. [2025-02-06 00:21:38,921 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:21:38,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2025-02-06 00:21:38,922 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 109 [2025-02-06 00:21:38,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:21:38,922 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2025-02-06 00:21:38,922 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:21:38,923 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2025-02-06 00:21:38,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 00:21:38,923 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:21:38,924 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:21:38,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 00:21:38,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:21:38,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:21:38,925 INFO L85 PathProgramCache]: Analyzing trace with hash -652950336, now seen corresponding path program 1 times [2025-02-06 00:21:38,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:21:38,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669291247] [2025-02-06 00:21:38,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:21:38,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:21:38,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 00:21:38,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 00:21:38,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:21:38,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:21:40,624 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:21:40,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:21:40,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669291247] [2025-02-06 00:21:40,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669291247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:21:40,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:21:40,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 00:21:40,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960217897] [2025-02-06 00:21:40,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:21:40,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 00:21:40,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:21:40,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 00:21:40,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 00:21:40,628 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:21:41,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:21:41,058 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2025-02-06 00:21:41,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 00:21:41,059 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:21:41,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:21:41,060 INFO L225 Difference]: With dead ends: 95 [2025-02-06 00:21:41,062 INFO L226 Difference]: Without dead ends: 93 [2025-02-06 00:21:41,063 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:21:41,063 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.3s IncrementalHoareTripleChecker+Time [2025-02-06 00:21:41,063 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.3s Time] [2025-02-06 00:21:41,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-06 00:21:41,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 64. [2025-02-06 00:21:41,073 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:21:41,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2025-02-06 00:21:41,076 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 109 [2025-02-06 00:21:41,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:21:41,077 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2025-02-06 00:21:41,077 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:21:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2025-02-06 00:21:41,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 00:21:41,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:21:41,078 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:21:41,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 00:21:41,078 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:21:41,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:21:41,078 INFO L85 PathProgramCache]: Analyzing trace with hash -479820058, now seen corresponding path program 1 times [2025-02-06 00:21:41,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:21:41,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032137705] [2025-02-06 00:21:41,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:21:41,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:21:41,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 00:21:41,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 00:21:41,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:21:41,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:21:46,925 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:21:46,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:21:46,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032137705] [2025-02-06 00:21:46,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032137705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:21:46,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:21:46,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 00:21:46,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133829211] [2025-02-06 00:21:46,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:21:46,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 00:21:46,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:21:46,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 00:21:46,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-06 00:21:46,927 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:21:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:21:50,563 INFO L93 Difference]: Finished difference Result 139 states and 178 transitions. [2025-02-06 00:21:50,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 00:21:50,564 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:21:50,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:21:50,566 INFO L225 Difference]: With dead ends: 139 [2025-02-06 00:21:50,566 INFO L226 Difference]: Without dead ends: 137 [2025-02-06 00:21:50,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-02-06 00:21:50,566 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 99 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:21:50,567 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.1s Time] [2025-02-06 00:21:50,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-06 00:21:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 71. [2025-02-06 00:21:50,575 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:21:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2025-02-06 00:21:50,576 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 110 [2025-02-06 00:21:50,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:21:50,576 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2025-02-06 00:21:50,576 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:21:50,576 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2025-02-06 00:21:50,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 00:21:50,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:21:50,577 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:21:50,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 00:21:50,578 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:21:50,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:21:50,578 INFO L85 PathProgramCache]: Analyzing trace with hash -478896537, now seen corresponding path program 1 times [2025-02-06 00:21:50,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:21:50,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762911717] [2025-02-06 00:21:50,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:21:50,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:21:50,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 00:21:50,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 00:21:50,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:21:50,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:21:57,892 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:21:57,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:21:57,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762911717] [2025-02-06 00:21:57,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762911717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:21:57,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:21:57,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-06 00:21:57,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118204076] [2025-02-06 00:21:57,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:21:57,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 00:21:57,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:21:57,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 00:21:57,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-02-06 00:21:57,893 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:22:00,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:22:00,352 INFO L93 Difference]: Finished difference Result 118 states and 150 transitions. [2025-02-06 00:22:00,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 00:22:00,353 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:22:00,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:22:00,354 INFO L225 Difference]: With dead ends: 118 [2025-02-06 00:22:00,354 INFO L226 Difference]: Without dead ends: 116 [2025-02-06 00:22:00,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2025-02-06 00:22:00,355 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 216 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:22:00,355 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.1s Time] [2025-02-06 00:22:00,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-06 00:22:00,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 84. [2025-02-06 00:22:00,365 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:22:00,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 114 transitions. [2025-02-06 00:22:00,366 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 114 transitions. Word has length 110 [2025-02-06 00:22:00,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:22:00,366 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 114 transitions. [2025-02-06 00:22:00,366 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:22:00,366 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 114 transitions. [2025-02-06 00:22:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 00:22:00,367 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:22:00,367 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:22:00,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 00:22:00,368 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:22:00,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:22:00,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1262990277, now seen corresponding path program 1 times [2025-02-06 00:22:00,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:22:00,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915338639] [2025-02-06 00:22:00,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:22:00,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:22:00,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 00:22:00,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 00:22:00,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:22:00,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:22:03,653 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:22:03,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:22:03,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915338639] [2025-02-06 00:22:03,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915338639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:22:03,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:22:03,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 00:22:03,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538603309] [2025-02-06 00:22:03,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:22:03,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 00:22:03,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:22:03,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 00:22:03,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-02-06 00:22:03,655 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:22:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:22:05,771 INFO L93 Difference]: Finished difference Result 151 states and 190 transitions. [2025-02-06 00:22:05,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 00:22:05,772 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:22:05,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:22:05,773 INFO L225 Difference]: With dead ends: 151 [2025-02-06 00:22:05,773 INFO L226 Difference]: Without dead ends: 149 [2025-02-06 00:22:05,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2025-02-06 00:22:05,774 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 149 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2025-02-06 00:22:05,774 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.9s Time] [2025-02-06 00:22:05,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-02-06 00:22:05,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 83. [2025-02-06 00:22:05,786 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:22:05,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 113 transitions. [2025-02-06 00:22:05,787 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 113 transitions. Word has length 110 [2025-02-06 00:22:05,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:22:05,787 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 113 transitions. [2025-02-06 00:22:05,788 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:22:05,789 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 113 transitions. [2025-02-06 00:22:05,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 00:22:05,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:22:05,790 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:22:05,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 00:22:05,790 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:22:05,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:22:05,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1263913798, now seen corresponding path program 1 times [2025-02-06 00:22:05,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:22:05,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837761302] [2025-02-06 00:22:05,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:22:05,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:22:05,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 00:22:05,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 00:22:05,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:22:05,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:22:10,617 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:22:10,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:22:10,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837761302] [2025-02-06 00:22:10,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837761302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:22:10,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:22:10,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 00:22:10,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035340568] [2025-02-06 00:22:10,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:22:10,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 00:22:10,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:22:10,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 00:22:10,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-02-06 00:22:10,621 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:22:14,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:22:14,956 INFO L93 Difference]: Finished difference Result 141 states and 179 transitions. [2025-02-06 00:22:14,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 00:22:14,956 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:22:14,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:22:14,957 INFO L225 Difference]: With dead ends: 141 [2025-02-06 00:22:14,957 INFO L226 Difference]: Without dead ends: 139 [2025-02-06 00:22:14,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-02-06 00:22:14,959 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.7s IncrementalHoareTripleChecker+Time [2025-02-06 00:22:14,959 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.7s Time] [2025-02-06 00:22:14,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-06 00:22:14,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 80. [2025-02-06 00:22:14,971 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:22:14,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 108 transitions. [2025-02-06 00:22:14,972 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 108 transitions. Word has length 110 [2025-02-06 00:22:14,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:22:14,972 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 108 transitions. [2025-02-06 00:22:14,972 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:22:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 108 transitions. [2025-02-06 00:22:14,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 00:22:14,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:22:14,973 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:22:14,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 00:22:14,974 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:22:14,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:22:14,974 INFO L85 PathProgramCache]: Analyzing trace with hash -2088123418, now seen corresponding path program 1 times [2025-02-06 00:22:14,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:22:14,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405960262] [2025-02-06 00:22:14,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:22:14,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:22:14,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 00:22:15,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 00:22:15,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:22:15,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:22:16,480 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:22:16,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:22:16,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405960262] [2025-02-06 00:22:16,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405960262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:22:16,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:22:16,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 00:22:16,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283953947] [2025-02-06 00:22:16,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:22:16,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 00:22:16,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:22:16,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 00:22:16,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 00:22:16,483 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:22:17,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:22:17,087 INFO L93 Difference]: Finished difference Result 256 states and 336 transitions. [2025-02-06 00:22:17,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 00:22:17,091 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:22:17,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:22:17,092 INFO L225 Difference]: With dead ends: 256 [2025-02-06 00:22:17,093 INFO L226 Difference]: Without dead ends: 179 [2025-02-06 00:22:17,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2025-02-06 00:22:17,094 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:22:17,094 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:22:17,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-02-06 00:22:17,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 144. [2025-02-06 00:22:17,112 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:22:17,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 192 transitions. [2025-02-06 00:22:17,113 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 192 transitions. Word has length 110 [2025-02-06 00:22:17,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:22:17,114 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 192 transitions. [2025-02-06 00:22:17,114 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:22:17,114 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 192 transitions. [2025-02-06 00:22:17,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 00:22:17,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:22:17,115 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:22:17,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 00:22:17,115 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:22:17,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:22:17,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1200619737, now seen corresponding path program 1 times [2025-02-06 00:22:17,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:22:17,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777402447] [2025-02-06 00:22:17,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:22:17,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:22:17,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 00:22:17,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 00:22:17,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:22:17,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:22:17,150 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:22:17,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:22:17,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777402447] [2025-02-06 00:22:17,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777402447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:22:17,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:22:17,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 00:22:17,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280695060] [2025-02-06 00:22:17,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:22:17,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:22:17,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:22:17,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:22:17,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:22:17,152 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:22:17,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:22:17,188 INFO L93 Difference]: Finished difference Result 342 states and 456 transitions. [2025-02-06 00:22:17,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:22:17,197 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:22:17,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:22:17,198 INFO L225 Difference]: With dead ends: 342 [2025-02-06 00:22:17,198 INFO L226 Difference]: Without dead ends: 201 [2025-02-06 00:22:17,198 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:22:17,199 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:22:17,200 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:22:17,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-06 00:22:17,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-02-06 00:22:17,233 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:22:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 266 transitions. [2025-02-06 00:22:17,235 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 266 transitions. Word has length 110 [2025-02-06 00:22:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:22:17,235 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 266 transitions. [2025-02-06 00:22:17,235 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:22:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 266 transitions. [2025-02-06 00:22:17,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 00:22:17,236 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:22:17,236 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:22:17,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 00:22:17,236 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:22:17,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:22:17,236 INFO L85 PathProgramCache]: Analyzing trace with hash -350737339, now seen corresponding path program 1 times [2025-02-06 00:22:17,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:22:17,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023498081] [2025-02-06 00:22:17,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:22:17,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:22:17,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 00:22:17,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 00:22:17,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:22:17,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:22:17,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:22:17,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:22:17,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023498081] [2025-02-06 00:22:17,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023498081] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:22:17,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:22:17,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:22:17,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198747533] [2025-02-06 00:22:17,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:22:17,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:22:17,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:22:17,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:22:17,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:22:17,268 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:22:17,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:22:17,315 INFO L93 Difference]: Finished difference Result 391 states and 508 transitions. [2025-02-06 00:22:17,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:22:17,316 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:22:17,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:22:17,318 INFO L225 Difference]: With dead ends: 391 [2025-02-06 00:22:17,319 INFO L226 Difference]: Without dead ends: 250 [2025-02-06 00:22:17,320 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:22:17,320 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:22:17,320 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:22:17,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-02-06 00:22:17,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 245. [2025-02-06 00:22:17,356 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:22:17,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 309 transitions. [2025-02-06 00:22:17,359 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 309 transitions. Word has length 110 [2025-02-06 00:22:17,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:22:17,359 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 309 transitions. [2025-02-06 00:22:17,359 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:22:17,359 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 309 transitions. [2025-02-06 00:22:17,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 00:22:17,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:22:17,360 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:22:17,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 00:22:17,360 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:22:17,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:22:17,362 INFO L85 PathProgramCache]: Analyzing trace with hash -81188800, now seen corresponding path program 1 times [2025-02-06 00:22:17,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:22:17,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757174958] [2025-02-06 00:22:17,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:22:17,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:22:17,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 00:22:17,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 00:22:17,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:22:17,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:22:20,806 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:22:20,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:22:20,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757174958] [2025-02-06 00:22:20,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757174958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:22:20,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:22:20,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 00:22:20,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650777232] [2025-02-06 00:22:20,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:22:20,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 00:22:20,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:22:20,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 00:22:20,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-06 00:22:20,808 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:22:22,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:22:22,014 INFO L93 Difference]: Finished difference Result 406 states and 505 transitions. [2025-02-06 00:22:22,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 00:22:22,015 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:22:22,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:22:22,016 INFO L225 Difference]: With dead ends: 406 [2025-02-06 00:22:22,016 INFO L226 Difference]: Without dead ends: 226 [2025-02-06 00:22:22,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-02-06 00:22:22,017 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 95 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2025-02-06 00:22:22,017 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.4s Time] [2025-02-06 00:22:22,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-02-06 00:22:22,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 181. [2025-02-06 00:22:22,039 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:22:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 227 transitions. [2025-02-06 00:22:22,041 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 227 transitions. Word has length 111 [2025-02-06 00:22:22,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:22:22,041 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 227 transitions. [2025-02-06 00:22:22,041 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:22:22,041 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 227 transitions. [2025-02-06 00:22:22,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 00:22:22,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:22:22,043 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:22:22,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 00:22:22,043 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:22:22,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:22:22,044 INFO L85 PathProgramCache]: Analyzing trace with hash -80265279, now seen corresponding path program 1 times [2025-02-06 00:22:22,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:22:22,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571379023] [2025-02-06 00:22:22,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:22:22,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:22:22,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 00:22:22,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 00:22:22,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:22:22,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:22:23,919 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:22:23,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:22:23,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571379023] [2025-02-06 00:22:23,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571379023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:22:23,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:22:23,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 00:22:23,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278688160] [2025-02-06 00:22:23,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:22:23,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 00:22:23,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:22:23,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 00:22:23,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-02-06 00:22:23,921 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:22:24,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:22:24,810 INFO L93 Difference]: Finished difference Result 226 states and 274 transitions. [2025-02-06 00:22:24,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 00:22:24,811 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:22:24,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:22:24,812 INFO L225 Difference]: With dead ends: 226 [2025-02-06 00:22:24,812 INFO L226 Difference]: Without dead ends: 224 [2025-02-06 00:22:24,813 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:22:24,813 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 89 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2025-02-06 00:22:24,813 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.7s Time] [2025-02-06 00:22:24,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-02-06 00:22:24,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 180. [2025-02-06 00:22:24,836 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:22:24,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 225 transitions. [2025-02-06 00:22:24,837 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 225 transitions. Word has length 111 [2025-02-06 00:22:24,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:22:24,837 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 225 transitions. [2025-02-06 00:22:24,837 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:22:24,838 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 225 transitions. [2025-02-06 00:22:24,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 00:22:24,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:22:24,838 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:22:24,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 00:22:24,839 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:22:24,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:22:24,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1661621535, now seen corresponding path program 1 times [2025-02-06 00:22:24,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:22:24,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619778953] [2025-02-06 00:22:24,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:22:24,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:22:24,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 00:22:24,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 00:22:24,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:22:24,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:22:27,583 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:22:27,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:22:27,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619778953] [2025-02-06 00:22:27,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619778953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:22:27,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:22:27,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 00:22:27,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492838663] [2025-02-06 00:22:27,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:22:27,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 00:22:27,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:22:27,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 00:22:27,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-06 00:22:27,584 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:22:29,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:22:29,992 INFO L93 Difference]: Finished difference Result 256 states and 306 transitions. [2025-02-06 00:22:29,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 00:22:29,992 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:22:29,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:22:29,994 INFO L225 Difference]: With dead ends: 256 [2025-02-06 00:22:29,994 INFO L226 Difference]: Without dead ends: 254 [2025-02-06 00:22:29,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2025-02-06 00:22:29,994 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.6s IncrementalHoareTripleChecker+Time [2025-02-06 00:22:29,994 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.6s Time] [2025-02-06 00:22:29,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-02-06 00:22:30,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 180. [2025-02-06 00:22:30,018 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:22:30,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 225 transitions. [2025-02-06 00:22:30,020 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 225 transitions. Word has length 111 [2025-02-06 00:22:30,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:22:30,021 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 225 transitions. [2025-02-06 00:22:30,021 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:22:30,021 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 225 transitions. [2025-02-06 00:22:30,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 00:22:30,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:22:30,023 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:22:30,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 00:22:30,023 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:22:30,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:22:30,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1662545056, now seen corresponding path program 1 times [2025-02-06 00:22:30,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:22:30,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308149560] [2025-02-06 00:22:30,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:22:30,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:22:30,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 00:22:30,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 00:22:30,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:22:30,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:22:33,373 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:22:33,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:22:33,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308149560] [2025-02-06 00:22:33,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308149560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:22:33,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:22:33,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 00:22:33,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145022246] [2025-02-06 00:22:33,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:22:33,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 00:22:33,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:22:33,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 00:22:33,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-02-06 00:22:33,374 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:22:35,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:22:35,203 INFO L93 Difference]: Finished difference Result 251 states and 301 transitions. [2025-02-06 00:22:35,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 00:22:35,203 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:22:35,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:22:35,207 INFO L225 Difference]: With dead ends: 251 [2025-02-06 00:22:35,207 INFO L226 Difference]: Without dead ends: 249 [2025-02-06 00:22:35,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-02-06 00:22:35,208 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 75 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2025-02-06 00:22:35,208 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.6s Time] [2025-02-06 00:22:35,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-02-06 00:22:35,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 174. [2025-02-06 00:22:35,242 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:22:35,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 217 transitions. [2025-02-06 00:22:35,245 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 217 transitions. Word has length 111 [2025-02-06 00:22:35,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:22:35,245 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 217 transitions. [2025-02-06 00:22:35,245 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:22:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 217 transitions. [2025-02-06 00:22:35,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-02-06 00:22:35,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:22:35,248 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:22:35,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 00:22:35,248 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:22:35,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:22:35,249 INFO L85 PathProgramCache]: Analyzing trace with hash 34007713, now seen corresponding path program 1 times [2025-02-06 00:22:35,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:22:35,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954965823] [2025-02-06 00:22:35,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:22:35,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:22:35,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-06 00:22:35,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-06 00:22:35,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:22:35,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:22:36,905 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:22:36,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:22:36,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954965823] [2025-02-06 00:22:36,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954965823] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:22:36,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130958444] [2025-02-06 00:22:36,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:22:36,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:22:36,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:22:36,909 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:22:36,910 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:22:36,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-06 00:22:37,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-06 00:22:37,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:22:37,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:22:37,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 00:22:37,071 INFO L279 TraceCheckSpWp]: Computing forward predicates...