./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e9f5cbcd9b5e7070eed068152e26dc672bc2b60288a251274726ceb1bf0c8d9b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:23:20,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:23:20,179 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:23:20,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:23:20,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:23:20,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:23:20,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:23:20,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:23:20,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:23:20,207 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:23:20,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:23:20,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:23:20,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:23:20,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:23:20,208 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:23:20,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:23:20,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:23:20,208 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:23:20,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:23:20,208 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:23:20,208 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:23:20,208 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:23:20,208 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:23:20,208 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:23:20,208 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:23:20,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:23:20,208 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:23:20,208 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:23:20,209 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:23:20,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:23:20,209 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:23:20,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:23:20,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:23:20,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:23:20,209 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:23:20,209 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:23:20,210 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:23:20,210 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:23:20,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:23:20,210 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:23:20,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:23:20,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:23:20,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:23:20,210 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 -> e9f5cbcd9b5e7070eed068152e26dc672bc2b60288a251274726ceb1bf0c8d9b [2025-02-05 22:23:20,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:23:20,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:23:20,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:23:20,451 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:23:20,451 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:23:20,452 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i [2025-02-05 22:23:21,654 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84d4ce7ba/a07221e9d1ad4073be10014706e76d05/FLAG7aaa4560b [2025-02-05 22:23:21,904 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:23:21,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i [2025-02-05 22:23:21,928 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84d4ce7ba/a07221e9d1ad4073be10014706e76d05/FLAG7aaa4560b [2025-02-05 22:23:22,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84d4ce7ba/a07221e9d1ad4073be10014706e76d05 [2025-02-05 22:23:22,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:23:22,222 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:23:22,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:23:22,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:23:22,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:23:22,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:23:22" (1/1) ... [2025-02-05 22:23:22,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@476cee48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:23:22, skipping insertion in model container [2025-02-05 22:23:22,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:23:22" (1/1) ... [2025-02-05 22:23:22,241 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:23:22,338 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i[919,932] [2025-02-05 22:23:22,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:23:22,394 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:23:22,404 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i[919,932] [2025-02-05 22:23:22,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:23:22,464 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:23:22,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:23:22 WrapperNode [2025-02-05 22:23:22,464 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:23:22,465 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:23:22,466 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:23:22,466 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:23:22,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:23:22" (1/1) ... [2025-02-05 22:23:22,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:23:22" (1/1) ... [2025-02-05 22:23:22,510 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2025-02-05 22:23:22,514 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:23:22,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:23:22,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:23:22,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:23:22,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:23:22" (1/1) ... [2025-02-05 22:23:22,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:23:22" (1/1) ... [2025-02-05 22:23:22,524 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:23:22" (1/1) ... [2025-02-05 22:23:22,548 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 22:23:22,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:23:22" (1/1) ... [2025-02-05 22:23:22,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:23:22" (1/1) ... [2025-02-05 22:23:22,555 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:23:22" (1/1) ... [2025-02-05 22:23:22,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:23:22" (1/1) ... [2025-02-05 22:23:22,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:23:22" (1/1) ... [2025-02-05 22:23:22,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:23:22" (1/1) ... [2025-02-05 22:23:22,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:23:22,563 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:23:22,563 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:23:22,563 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:23:22,563 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:23:22" (1/1) ... [2025-02-05 22:23:22,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:23:22,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:23:22,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:23:22,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:23:22,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:23:22,617 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:23:22,617 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:23:22,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:23:22,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:23:22,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:23:22,681 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:23:22,683 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:23:22,935 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-05 22:23:22,935 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:23:22,942 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:23:22,942 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:23:22,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:23:22 BoogieIcfgContainer [2025-02-05 22:23:22,942 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:23:22,944 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:23:22,944 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:23:22,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:23:22,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:23:22" (1/3) ... [2025-02-05 22:23:22,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@648be4a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:23:22, skipping insertion in model container [2025-02-05 22:23:22,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:23:22" (2/3) ... [2025-02-05 22:23:22,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@648be4a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:23:22, skipping insertion in model container [2025-02-05 22:23:22,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:23:22" (3/3) ... [2025-02-05 22:23:22,949 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i [2025-02-05 22:23:22,958 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:23:22,959 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:23:22,997 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:23:23,006 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;@27c6b9c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:23:23,007 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:23:23,009 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-05 22:23:23,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 22:23:23,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:23:23,025 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:23:23,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:23:23,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:23:23,029 INFO L85 PathProgramCache]: Analyzing trace with hash -62546371, now seen corresponding path program 1 times [2025-02-05 22:23:23,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:23:23,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694516115] [2025-02-05 22:23:23,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:23:23,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:23:23,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 22:23:23,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 22:23:23,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:23:23,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:23:23,274 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-02-05 22:23:23,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:23:23,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694516115] [2025-02-05 22:23:23,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694516115] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:23:23,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696342524] [2025-02-05 22:23:23,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:23:23,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:23:23,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:23:23,284 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:23:23,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 22:23:23,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 22:23:23,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 22:23:23,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:23:23,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:23:23,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:23:23,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:23:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-02-05 22:23:23,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:23:23,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696342524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:23:23,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:23:23,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:23:23,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246384561] [2025-02-05 22:23:23,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:23:23,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:23:23,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:23:23,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:23:23,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:23:23,452 INFO L87 Difference]: Start difference. First operand has 80 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 22:23:23,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:23:23,476 INFO L93 Difference]: Finished difference Result 154 states and 269 transitions. [2025-02-05 22:23:23,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:23:23,478 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 149 [2025-02-05 22:23:23,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:23:23,484 INFO L225 Difference]: With dead ends: 154 [2025-02-05 22:23:23,484 INFO L226 Difference]: Without dead ends: 77 [2025-02-05 22:23:23,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:23:23,490 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:23:23,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:23:23,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-05 22:23:23,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-05 22:23:23,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 53 states have internal predecessors, (77), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-05 22:23:23,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 121 transitions. [2025-02-05 22:23:23,533 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 121 transitions. Word has length 149 [2025-02-05 22:23:23,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:23:23,534 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 121 transitions. [2025-02-05 22:23:23,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 22:23:23,534 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 121 transitions. [2025-02-05 22:23:23,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 22:23:23,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:23:23,537 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:23:23,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 22:23:23,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 22:23:23,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:23:23,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:23:23,741 INFO L85 PathProgramCache]: Analyzing trace with hash 569304379, now seen corresponding path program 1 times [2025-02-05 22:23:23,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:23:23,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126878434] [2025-02-05 22:23:23,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:23:23,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:23:23,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 22:23:23,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 22:23:23,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:23:23,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:23:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 22:23:24,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:23:24,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126878434] [2025-02-05 22:23:24,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126878434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:23:24,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:23:24,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:23:24,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352233517] [2025-02-05 22:23:24,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:23:24,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:23:24,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:23:24,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:23:24,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:23:24,044 INFO L87 Difference]: Start difference. First operand 77 states and 121 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 22:23:24,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:23:24,183 INFO L93 Difference]: Finished difference Result 189 states and 295 transitions. [2025-02-05 22:23:24,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:23:24,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 149 [2025-02-05 22:23:24,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:23:24,185 INFO L225 Difference]: With dead ends: 189 [2025-02-05 22:23:24,185 INFO L226 Difference]: Without dead ends: 115 [2025-02-05 22:23:24,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:23:24,186 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 139 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:23:24,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 213 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:23:24,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-05 22:23:24,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2025-02-05 22:23:24,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 78 states have internal predecessors, (109), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 22:23:24,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2025-02-05 22:23:24,201 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 149 [2025-02-05 22:23:24,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:23:24,202 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2025-02-05 22:23:24,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 22:23:24,202 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2025-02-05 22:23:24,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 22:23:24,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:23:24,203 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:23:24,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:23:24,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:23:24,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:23:24,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1238150084, now seen corresponding path program 1 times [2025-02-05 22:23:24,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:23:24,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064584000] [2025-02-05 22:23:24,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:23:24,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:23:24,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 22:23:24,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 22:23:24,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:23:24,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:23:24,617 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 22:23:24,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:23:24,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064584000] [2025-02-05 22:23:24,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064584000] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:23:24,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:23:24,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 22:23:24,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903930728] [2025-02-05 22:23:24,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:23:24,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 22:23:24,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:23:24,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 22:23:24,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:23:24,621 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 22:23:25,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:23:25,069 INFO L93 Difference]: Finished difference Result 407 states and 590 transitions. [2025-02-05 22:23:25,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 22:23:25,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2025-02-05 22:23:25,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:23:25,072 INFO L225 Difference]: With dead ends: 407 [2025-02-05 22:23:25,072 INFO L226 Difference]: Without dead ends: 298 [2025-02-05 22:23:25,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-02-05 22:23:25,074 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 263 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:23:25,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 582 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:23:25,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-02-05 22:23:25,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 177. [2025-02-05 22:23:25,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 136 states have (on average 1.4558823529411764) internal successors, (198), 139 states have internal predecessors, (198), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-05 22:23:25,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 270 transitions. [2025-02-05 22:23:25,090 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 270 transitions. Word has length 149 [2025-02-05 22:23:25,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:23:25,090 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 270 transitions. [2025-02-05 22:23:25,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 22:23:25,090 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 270 transitions. [2025-02-05 22:23:25,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 22:23:25,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:23:25,092 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:23:25,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:23:25,092 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:23:25,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:23:25,093 INFO L85 PathProgramCache]: Analyzing trace with hash -936820241, now seen corresponding path program 1 times [2025-02-05 22:23:25,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:23:25,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738201065] [2025-02-05 22:23:25,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:23:25,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:23:25,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 22:23:25,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 22:23:25,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:23:25,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:23:25,422 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 24 proven. 39 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-02-05 22:23:25,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:23:25,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738201065] [2025-02-05 22:23:25,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738201065] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:23:25,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953864191] [2025-02-05 22:23:25,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:23:25,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:23:25,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:23:25,426 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:23:25,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 22:23:25,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 22:23:25,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 22:23:25,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:23:25,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:23:25,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 22:23:25,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:23:25,721 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 481 proven. 33 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2025-02-05 22:23:25,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:23:25,952 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-02-05 22:23:25,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953864191] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:23:25,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:23:25,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2025-02-05 22:23:25,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528520618] [2025-02-05 22:23:25,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:23:25,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 22:23:25,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:23:25,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 22:23:25,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:23:25,954 INFO L87 Difference]: Start difference. First operand 177 states and 270 transitions. Second operand has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 4 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2025-02-05 22:23:26,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:23:26,365 INFO L93 Difference]: Finished difference Result 365 states and 550 transitions. [2025-02-05 22:23:26,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 22:23:26,367 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 4 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) Word has length 150 [2025-02-05 22:23:26,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:23:26,369 INFO L225 Difference]: With dead ends: 365 [2025-02-05 22:23:26,369 INFO L226 Difference]: Without dead ends: 183 [2025-02-05 22:23:26,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2025-02-05 22:23:26,370 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 298 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:23:26,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 262 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:23:26,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-05 22:23:26,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 178. [2025-02-05 22:23:26,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 139 states have (on average 1.4028776978417266) internal successors, (195), 142 states have internal predecessors, (195), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 22:23:26,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 259 transitions. [2025-02-05 22:23:26,387 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 259 transitions. Word has length 150 [2025-02-05 22:23:26,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:23:26,387 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 259 transitions. [2025-02-05 22:23:26,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 4 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2025-02-05 22:23:26,388 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 259 transitions. [2025-02-05 22:23:26,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 22:23:26,389 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:23:26,389 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:23:26,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 22:23:26,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:23:26,590 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:23:26,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:23:26,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1618730038, now seen corresponding path program 1 times [2025-02-05 22:23:26,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:23:26,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369552656] [2025-02-05 22:23:26,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:23:26,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:23:26,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 22:23:26,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 22:23:26,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:23:26,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:23:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 22:23:26,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:23:26,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369552656] [2025-02-05 22:23:26,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369552656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:23:26,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:23:26,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:23:26,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550585763] [2025-02-05 22:23:26,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:23:26,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:23:26,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:23:26,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:23:26,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:23:26,886 INFO L87 Difference]: Start difference. First operand 178 states and 259 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 22:23:27,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:23:27,036 INFO L93 Difference]: Finished difference Result 656 states and 947 transitions. [2025-02-05 22:23:27,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:23:27,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-02-05 22:23:27,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:23:27,039 INFO L225 Difference]: With dead ends: 656 [2025-02-05 22:23:27,039 INFO L226 Difference]: Without dead ends: 481 [2025-02-05 22:23:27,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:23:27,040 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 186 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:23:27,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 237 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:23:27,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-02-05 22:23:27,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 398. [2025-02-05 22:23:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 331 states have (on average 1.4169184290030212) internal successors, (469), 338 states have internal predecessors, (469), 54 states have call successors, (54), 12 states have call predecessors, (54), 12 states have return successors, (54), 47 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 22:23:27,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 577 transitions. [2025-02-05 22:23:27,072 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 577 transitions. Word has length 150 [2025-02-05 22:23:27,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:23:27,072 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 577 transitions. [2025-02-05 22:23:27,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 22:23:27,073 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 577 transitions. [2025-02-05 22:23:27,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 22:23:27,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:23:27,074 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:23:27,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:23:27,075 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:23:27,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:23:27,075 INFO L85 PathProgramCache]: Analyzing trace with hash 879285899, now seen corresponding path program 1 times [2025-02-05 22:23:27,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:23:27,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969019064] [2025-02-05 22:23:27,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:23:27,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:23:27,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 22:23:27,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 22:23:27,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:23:27,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:23:35,905 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 22:23:35,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:23:35,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969019064] [2025-02-05 22:23:35,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969019064] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:23:35,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:23:35,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-05 22:23:35,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740047209] [2025-02-05 22:23:35,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:23:35,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 22:23:35,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:23:35,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 22:23:35,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-02-05 22:23:35,907 INFO L87 Difference]: Start difference. First operand 398 states and 577 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 22:23:38,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:23:38,757 INFO L93 Difference]: Finished difference Result 1027 states and 1468 transitions. [2025-02-05 22:23:38,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 22:23:38,757 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-02-05 22:23:38,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:23:38,761 INFO L225 Difference]: With dead ends: 1027 [2025-02-05 22:23:38,762 INFO L226 Difference]: Without dead ends: 1025 [2025-02-05 22:23:38,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=241, Invalid=571, Unknown=0, NotChecked=0, Total=812 [2025-02-05 22:23:38,763 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 574 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:23:38,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 577 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 22:23:38,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2025-02-05 22:23:38,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 746. [2025-02-05 22:23:38,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 647 states have (on average 1.4358578052550233) internal successors, (929), 662 states have internal predecessors, (929), 78 states have call successors, (78), 20 states have call predecessors, (78), 20 states have return successors, (78), 63 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-05 22:23:38,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1085 transitions. [2025-02-05 22:23:38,802 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1085 transitions. Word has length 150 [2025-02-05 22:23:38,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:23:38,803 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1085 transitions. [2025-02-05 22:23:38,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 22:23:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1085 transitions. [2025-02-05 22:23:38,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 22:23:38,805 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:23:38,805 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:23:38,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:23:38,805 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:23:38,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:23:38,806 INFO L85 PathProgramCache]: Analyzing trace with hash 585882892, now seen corresponding path program 1 times [2025-02-05 22:23:38,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:23:38,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85243618] [2025-02-05 22:23:38,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:23:38,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:23:38,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 22:23:38,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 22:23:38,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:23:38,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:23:45,220 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 22:23:45,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:23:45,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85243618] [2025-02-05 22:23:45,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85243618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:23:45,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:23:45,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-05 22:23:45,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399016328] [2025-02-05 22:23:45,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:23:45,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 22:23:45,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:23:45,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 22:23:45,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-02-05 22:23:45,223 INFO L87 Difference]: Start difference. First operand 746 states and 1085 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 22:23:48,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:23:48,381 INFO L93 Difference]: Finished difference Result 1189 states and 1674 transitions. [2025-02-05 22:23:48,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 22:23:48,382 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-02-05 22:23:48,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:23:48,389 INFO L225 Difference]: With dead ends: 1189 [2025-02-05 22:23:48,389 INFO L226 Difference]: Without dead ends: 1187 [2025-02-05 22:23:48,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=277, Invalid=653, Unknown=0, NotChecked=0, Total=930 [2025-02-05 22:23:48,394 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 734 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:23:48,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 603 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 22:23:48,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2025-02-05 22:23:48,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 706. [2025-02-05 22:23:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 607 states have (on average 1.4250411861614498) internal successors, (865), 622 states have internal predecessors, (865), 78 states have call successors, (78), 20 states have call predecessors, (78), 20 states have return successors, (78), 63 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-05 22:23:48,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1021 transitions. [2025-02-05 22:23:48,445 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1021 transitions. Word has length 150 [2025-02-05 22:23:48,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:23:48,446 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 1021 transitions. [2025-02-05 22:23:48,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 22:23:48,446 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1021 transitions. [2025-02-05 22:23:48,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 22:23:48,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:23:48,450 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:23:48,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:23:48,450 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:23:48,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:23:48,451 INFO L85 PathProgramCache]: Analyzing trace with hash -474023798, now seen corresponding path program 1 times [2025-02-05 22:23:48,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:23:48,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726329965] [2025-02-05 22:23:48,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:23:48,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:23:48,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 22:23:48,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 22:23:48,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:23:48,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:23:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 22:23:53,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:23:53,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726329965] [2025-02-05 22:23:53,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726329965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:23:53,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:23:53,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-05 22:23:53,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107362359] [2025-02-05 22:23:53,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:23:53,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 22:23:53,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:23:53,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 22:23:53,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-02-05 22:23:53,494 INFO L87 Difference]: Start difference. First operand 706 states and 1021 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 22:23:58,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:23:58,205 INFO L93 Difference]: Finished difference Result 1161 states and 1638 transitions. [2025-02-05 22:23:58,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 22:23:58,205 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 150 [2025-02-05 22:23:58,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:23:58,211 INFO L225 Difference]: With dead ends: 1161 [2025-02-05 22:23:58,211 INFO L226 Difference]: Without dead ends: 1159 [2025-02-05 22:23:58,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 22:23:58,212 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 751 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 22:23:58,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 518 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 22:23:58,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-02-05 22:23:58,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 709. [2025-02-05 22:23:58,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 610 states have (on average 1.4262295081967213) internal successors, (870), 625 states have internal predecessors, (870), 78 states have call successors, (78), 20 states have call predecessors, (78), 20 states have return successors, (78), 63 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-05 22:23:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1026 transitions. [2025-02-05 22:23:58,249 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1026 transitions. Word has length 150 [2025-02-05 22:23:58,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:23:58,249 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 1026 transitions. [2025-02-05 22:23:58,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 22:23:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1026 transitions. [2025-02-05 22:23:58,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 22:23:58,251 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:23:58,251 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:23:58,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 22:23:58,251 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:23:58,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:23:58,252 INFO L85 PathProgramCache]: Analyzing trace with hash -767426805, now seen corresponding path program 1 times [2025-02-05 22:23:58,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:23:58,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315324882] [2025-02-05 22:23:58,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:23:58,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:23:58,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 22:23:58,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 22:23:58,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:23:58,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:24:02,344 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 22:24:02,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:24:02,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315324882] [2025-02-05 22:24:02,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315324882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:24:02,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:24:02,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 22:24:02,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567309308] [2025-02-05 22:24:02,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:24:02,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 22:24:02,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:24:02,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 22:24:02,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-02-05 22:24:02,346 INFO L87 Difference]: Start difference. First operand 709 states and 1026 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 22:24:05,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:24:05,049 INFO L93 Difference]: Finished difference Result 1187 states and 1682 transitions. [2025-02-05 22:24:05,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 22:24:05,050 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-02-05 22:24:05,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:24:05,055 INFO L225 Difference]: With dead ends: 1187 [2025-02-05 22:24:05,056 INFO L226 Difference]: Without dead ends: 1185 [2025-02-05 22:24:05,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=208, Invalid=494, Unknown=0, NotChecked=0, Total=702 [2025-02-05 22:24:05,058 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 437 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:24:05,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 714 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 22:24:05,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2025-02-05 22:24:05,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 705. [2025-02-05 22:24:05,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 606 states have (on average 1.4257425742574257) internal successors, (864), 621 states have internal predecessors, (864), 78 states have call successors, (78), 20 states have call predecessors, (78), 20 states have return successors, (78), 63 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-05 22:24:05,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1020 transitions. [2025-02-05 22:24:05,107 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1020 transitions. Word has length 150 [2025-02-05 22:24:05,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:24:05,108 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 1020 transitions. [2025-02-05 22:24:05,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 22:24:05,108 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1020 transitions. [2025-02-05 22:24:05,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 22:24:05,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:24:05,110 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:24:05,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 22:24:05,110 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:24:05,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:24:05,110 INFO L85 PathProgramCache]: Analyzing trace with hash 470461674, now seen corresponding path program 1 times [2025-02-05 22:24:05,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:24:05,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401333407] [2025-02-05 22:24:05,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:24:05,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:24:05,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 22:24:05,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 22:24:05,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:24:05,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:24:05,151 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 22:24:05,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:24:05,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401333407] [2025-02-05 22:24:05,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401333407] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:24:05,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:24:05,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:24:05,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909887889] [2025-02-05 22:24:05,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:24:05,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:24:05,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:24:05,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:24:05,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:24:05,152 INFO L87 Difference]: Start difference. First operand 705 states and 1020 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 22:24:05,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:24:05,245 INFO L93 Difference]: Finished difference Result 1893 states and 2717 transitions. [2025-02-05 22:24:05,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:24:05,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-02-05 22:24:05,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:24:05,250 INFO L225 Difference]: With dead ends: 1893 [2025-02-05 22:24:05,250 INFO L226 Difference]: Without dead ends: 1183 [2025-02-05 22:24:05,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:24:05,254 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 102 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:24:05,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 310 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:24:05,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-02-05 22:24:05,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1181. [2025-02-05 22:24:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 984 states have (on average 1.350609756097561) internal successors, (1329), 1014 states have internal predecessors, (1329), 156 states have call successors, (156), 40 states have call predecessors, (156), 40 states have return successors, (156), 126 states have call predecessors, (156), 156 states have call successors, (156) [2025-02-05 22:24:05,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1641 transitions. [2025-02-05 22:24:05,331 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1641 transitions. Word has length 150 [2025-02-05 22:24:05,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:24:05,332 INFO L471 AbstractCegarLoop]: Abstraction has 1181 states and 1641 transitions. [2025-02-05 22:24:05,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 22:24:05,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1641 transitions. [2025-02-05 22:24:05,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 22:24:05,335 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:24:05,335 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:24:05,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 22:24:05,335 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:24:05,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:24:05,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1756878856, now seen corresponding path program 1 times [2025-02-05 22:24:05,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:24:05,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068682429] [2025-02-05 22:24:05,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:24:05,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:24:05,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 22:24:05,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 22:24:05,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:24:05,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:24:09,136 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 22:24:09,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:24:09,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068682429] [2025-02-05 22:24:09,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068682429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:24:09,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:24:09,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-05 22:24:09,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662451768] [2025-02-05 22:24:09,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:24:09,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 22:24:09,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:24:09,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 22:24:09,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-02-05 22:24:09,139 INFO L87 Difference]: Start difference. First operand 1181 states and 1641 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-02-05 22:24:11,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:24:11,988 INFO L93 Difference]: Finished difference Result 3390 states and 4655 transitions. [2025-02-05 22:24:11,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 22:24:11,988 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 150 [2025-02-05 22:24:11,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:24:11,995 INFO L225 Difference]: With dead ends: 3390 [2025-02-05 22:24:11,996 INFO L226 Difference]: Without dead ends: 2212 [2025-02-05 22:24:11,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=293, Invalid=577, Unknown=0, NotChecked=0, Total=870 [2025-02-05 22:24:11,999 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1083 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:24:11,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 748 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 22:24:12,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2212 states. [2025-02-05 22:24:12,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2212 to 1945. [2025-02-05 22:24:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1945 states, 1600 states have (on average 1.333125) internal successors, (2133), 1649 states have internal predecessors, (2133), 272 states have call successors, (272), 72 states have call predecessors, (272), 72 states have return successors, (272), 223 states have call predecessors, (272), 272 states have call successors, (272) [2025-02-05 22:24:12,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 2677 transitions. [2025-02-05 22:24:12,133 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 2677 transitions. Word has length 150 [2025-02-05 22:24:12,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:24:12,134 INFO L471 AbstractCegarLoop]: Abstraction has 1945 states and 2677 transitions. [2025-02-05 22:24:12,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-02-05 22:24:12,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 2677 transitions. [2025-02-05 22:24:12,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 22:24:12,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:24:12,137 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:24:12,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 22:24:12,137 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:24:12,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:24:12,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1463475849, now seen corresponding path program 1 times [2025-02-05 22:24:12,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:24:12,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831764047] [2025-02-05 22:24:12,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:24:12,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:24:12,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 22:24:12,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 22:24:12,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:24:12,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:24:15,586 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 22:24:15,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:24:15,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831764047] [2025-02-05 22:24:15,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831764047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:24:15,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:24:15,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 22:24:15,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687105398] [2025-02-05 22:24:15,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:24:15,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 22:24:15,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:24:15,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 22:24:15,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-02-05 22:24:15,589 INFO L87 Difference]: Start difference. First operand 1945 states and 2677 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 22:24:17,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:24:17,214 INFO L93 Difference]: Finished difference Result 3876 states and 5322 transitions. [2025-02-05 22:24:17,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 22:24:17,216 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-02-05 22:24:17,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:24:17,224 INFO L225 Difference]: With dead ends: 3876 [2025-02-05 22:24:17,225 INFO L226 Difference]: Without dead ends: 2002 [2025-02-05 22:24:17,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-02-05 22:24:17,229 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 527 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:24:17,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 694 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 22:24:17,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2025-02-05 22:24:17,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1925. [2025-02-05 22:24:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1580 states have (on average 1.330379746835443) internal successors, (2102), 1629 states have internal predecessors, (2102), 272 states have call successors, (272), 72 states have call predecessors, (272), 72 states have return successors, (272), 223 states have call predecessors, (272), 272 states have call successors, (272) [2025-02-05 22:24:17,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2646 transitions. [2025-02-05 22:24:17,359 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2646 transitions. Word has length 150 [2025-02-05 22:24:17,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:24:17,359 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2646 transitions. [2025-02-05 22:24:17,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 22:24:17,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2646 transitions. [2025-02-05 22:24:17,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 22:24:17,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:24:17,361 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:24:17,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 22:24:17,361 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:24:17,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:24:17,362 INFO L85 PathProgramCache]: Analyzing trace with hash 403569159, now seen corresponding path program 1 times [2025-02-05 22:24:17,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:24:17,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082795205] [2025-02-05 22:24:17,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:24:17,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:24:17,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 22:24:17,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 22:24:17,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:24:17,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:24:17,441 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 22:24:17,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:24:17,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082795205] [2025-02-05 22:24:17,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082795205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:24:17,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:24:17,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:24:17,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093235056] [2025-02-05 22:24:17,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:24:17,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:24:17,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:24:17,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:24:17,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:24:17,443 INFO L87 Difference]: Start difference. First operand 1925 states and 2646 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 22:24:17,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:24:17,745 INFO L93 Difference]: Finished difference Result 4133 states and 5665 transitions. [2025-02-05 22:24:17,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:24:17,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-02-05 22:24:17,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:24:17,752 INFO L225 Difference]: With dead ends: 4133 [2025-02-05 22:24:17,753 INFO L226 Difference]: Without dead ends: 2279 [2025-02-05 22:24:17,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:24:17,755 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 107 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:24:17,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 447 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:24:17,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2025-02-05 22:24:17,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 1985. [2025-02-05 22:24:17,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1985 states, 1639 states have (on average 1.3276388041488714) internal successors, (2176), 1688 states have internal predecessors, (2176), 272 states have call successors, (272), 73 states have call predecessors, (272), 73 states have return successors, (272), 223 states have call predecessors, (272), 272 states have call successors, (272) [2025-02-05 22:24:17,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 2720 transitions. [2025-02-05 22:24:17,880 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 2720 transitions. Word has length 150 [2025-02-05 22:24:17,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:24:17,881 INFO L471 AbstractCegarLoop]: Abstraction has 1985 states and 2720 transitions. [2025-02-05 22:24:17,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-05 22:24:17,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2720 transitions. [2025-02-05 22:24:17,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 22:24:17,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:24:17,883 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:24:17,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 22:24:17,883 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:24:17,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:24:17,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1407379125, now seen corresponding path program 1 times [2025-02-05 22:24:17,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:24:17,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512233286] [2025-02-05 22:24:17,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:24:17,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:24:17,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 22:24:17,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 22:24:17,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:24:17,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:24:18,056 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 22:24:18,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:24:18,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512233286] [2025-02-05 22:24:18,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512233286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:24:18,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:24:18,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 22:24:18,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128480676] [2025-02-05 22:24:18,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:24:18,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 22:24:18,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:24:18,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 22:24:18,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:24:18,059 INFO L87 Difference]: Start difference. First operand 1985 states and 2720 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 22:24:18,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:24:18,385 INFO L93 Difference]: Finished difference Result 3988 states and 5455 transitions. [2025-02-05 22:24:18,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 22:24:18,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 150 [2025-02-05 22:24:18,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:24:18,392 INFO L225 Difference]: With dead ends: 3988 [2025-02-05 22:24:18,392 INFO L226 Difference]: Without dead ends: 1970 [2025-02-05 22:24:18,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:24:18,395 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 207 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:24:18,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 283 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:24:18,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2025-02-05 22:24:18,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1835. [2025-02-05 22:24:18,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1494 states have (on average 1.3152610441767068) internal successors, (1965), 1541 states have internal predecessors, (1965), 268 states have call successors, (268), 72 states have call predecessors, (268), 72 states have return successors, (268), 221 states have call predecessors, (268), 268 states have call successors, (268) [2025-02-05 22:24:18,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2501 transitions. [2025-02-05 22:24:18,514 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2501 transitions. Word has length 150 [2025-02-05 22:24:18,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:24:18,515 INFO L471 AbstractCegarLoop]: Abstraction has 1835 states and 2501 transitions. [2025-02-05 22:24:18,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 22:24:18,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2501 transitions. [2025-02-05 22:24:18,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 22:24:18,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:24:18,516 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:24:18,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 22:24:18,517 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:24:18,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:24:18,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1630576440, now seen corresponding path program 1 times [2025-02-05 22:24:18,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:24:18,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977751141] [2025-02-05 22:24:18,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:24:18,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:24:18,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 22:24:18,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 22:24:18,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:24:18,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 22:24:18,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [242637523] [2025-02-05 22:24:18,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:24:18,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:24:18,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:24:18,582 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:24:18,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 22:24:18,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 22:24:18,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 22:24:18,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:24:18,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:24:18,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-05 22:24:18,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:24:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 457 proven. 126 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2025-02-05 22:24:19,462 INFO L312 TraceCheckSpWp]: Computing backward predicates...