./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-52.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 fb963e37b33825ce0294e2e8f217c8677b17169f1936b98a544da3476a4e00cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:59:15,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:59:15,514 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:59:15,520 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:59:15,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:59:15,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:59:15,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:59:15,539 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:59:15,539 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:59:15,539 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:59:15,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:59:15,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:59:15,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:59:15,539 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:59:15,540 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:59:15,540 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:59:15,540 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:59:15,540 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:59:15,540 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:59:15,540 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:59:15,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:59:15,540 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:59:15,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:59:15,540 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:59:15,541 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:59:15,541 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:59:15,541 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:59:15,541 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:59:15,541 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:59:15,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:59:15,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:59:15,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:59:15,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:59:15,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:59:15,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:59:15,542 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:59:15,542 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:59:15,542 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:59:15,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:59:15,542 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:59:15,542 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:59:15,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:59:15,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:59:15,542 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/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 -> fb963e37b33825ce0294e2e8f217c8677b17169f1936b98a544da3476a4e00cd [2025-03-08 10:59:15,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:59:15,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:59:15,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:59:15,784 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:59:15,784 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:59:15,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-52.i [2025-03-08 10:59:16,928 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70a4d15c7/0a0dfab71d4540128e38c3d00f817774/FLAG20b9274ba [2025-03-08 10:59:17,210 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:59:17,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-52.i [2025-03-08 10:59:17,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70a4d15c7/0a0dfab71d4540128e38c3d00f817774/FLAG20b9274ba [2025-03-08 10:59:17,239 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70a4d15c7/0a0dfab71d4540128e38c3d00f817774 [2025-03-08 10:59:17,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:59:17,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:59:17,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:59:17,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:59:17,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:59:17,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:59:17" (1/1) ... [2025-03-08 10:59:17,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19af76e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:17, skipping insertion in model container [2025-03-08 10:59:17,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:59:17" (1/1) ... [2025-03-08 10:59:17,276 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:59:17,375 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-52.i[916,929] [2025-03-08 10:59:17,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:59:17,469 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:59:17,476 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-52.i[916,929] [2025-03-08 10:59:17,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:59:17,534 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:59:17,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:17 WrapperNode [2025-03-08 10:59:17,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:59:17,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:59:17,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:59:17,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:59:17,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:17" (1/1) ... [2025-03-08 10:59:17,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:17" (1/1) ... [2025-03-08 10:59:17,594 INFO L138 Inliner]: procedures = 26, calls = 86, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 530 [2025-03-08 10:59:17,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:59:17,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:59:17,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:59:17,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:59:17,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:17" (1/1) ... [2025-03-08 10:59:17,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:17" (1/1) ... [2025-03-08 10:59:17,613 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:17" (1/1) ... [2025-03-08 10:59:17,637 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-03-08 10:59:17,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:17" (1/1) ... [2025-03-08 10:59:17,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:17" (1/1) ... [2025-03-08 10:59:17,655 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:17" (1/1) ... [2025-03-08 10:59:17,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:17" (1/1) ... [2025-03-08 10:59:17,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:17" (1/1) ... [2025-03-08 10:59:17,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:17" (1/1) ... [2025-03-08 10:59:17,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:59:17,673 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:59:17,673 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:59:17,673 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:59:17,674 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:17" (1/1) ... [2025-03-08 10:59:17,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:59:17,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:59:17,698 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:59:17,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:59:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:59:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:59:17,718 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:59:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:59:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:59:17,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:59:17,793 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:59:17,795 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:59:18,472 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-08 10:59:18,473 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:59:18,498 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:59:18,498 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:59:18,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:59:18 BoogieIcfgContainer [2025-03-08 10:59:18,499 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:59:18,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:59:18,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:59:18,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:59:18,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:59:17" (1/3) ... [2025-03-08 10:59:18,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f1e720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:59:18, skipping insertion in model container [2025-03-08 10:59:18,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:17" (2/3) ... [2025-03-08 10:59:18,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f1e720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:59:18, skipping insertion in model container [2025-03-08 10:59:18,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:59:18" (3/3) ... [2025-03-08 10:59:18,505 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-52.i [2025-03-08 10:59:18,513 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:59:18,516 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-52.i that has 2 procedures, 220 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:59:18,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:59:18,571 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;@32089882, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:59:18,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:59:18,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 220 states, 144 states have (on average 1.5347222222222223) internal successors, (221), 145 states have internal predecessors, (221), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-08 10:59:18,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-08 10:59:18,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:18,589 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:59:18,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:18,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:18,593 INFO L85 PathProgramCache]: Analyzing trace with hash -782458791, now seen corresponding path program 1 times [2025-03-08 10:59:18,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:18,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301632710] [2025-03-08 10:59:18,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:18,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:18,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-08 10:59:18,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-08 10:59:18,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:18,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:19,032 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2025-03-08 10:59:19,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:19,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301632710] [2025-03-08 10:59:19,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301632710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:59:19,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513066988] [2025-03-08 10:59:19,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:19,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:59:19,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:59:19,037 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:59:19,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 10:59:19,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-08 10:59:19,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-08 10:59:19,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:19,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:19,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:59:19,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:59:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2025-03-08 10:59:19,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:59:19,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513066988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:19,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:59:19,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:59:19,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295572549] [2025-03-08 10:59:19,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:19,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:59:19,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:19,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:59:19,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:59:19,367 INFO L87 Difference]: Start difference. First operand has 220 states, 144 states have (on average 1.5347222222222223) internal successors, (221), 145 states have internal predecessors, (221), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 2 states, 2 states have (on average 49.5) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-08 10:59:19,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:19,425 INFO L93 Difference]: Finished difference Result 434 states and 802 transitions. [2025-03-08 10:59:19,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:59:19,429 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 49.5) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) Word has length 459 [2025-03-08 10:59:19,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:19,434 INFO L225 Difference]: With dead ends: 434 [2025-03-08 10:59:19,435 INFO L226 Difference]: Without dead ends: 217 [2025-03-08 10:59:19,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 460 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-03-08 10:59:19,442 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:19,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 353 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:59:19,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-08 10:59:19,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-03-08 10:59:19,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 142 states have internal predecessors, (215), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-08 10:59:19,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 361 transitions. [2025-03-08 10:59:19,505 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 361 transitions. Word has length 459 [2025-03-08 10:59:19,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:19,505 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 361 transitions. [2025-03-08 10:59:19,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.5) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-08 10:59:19,506 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 361 transitions. [2025-03-08 10:59:19,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-08 10:59:19,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:19,515 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:59:19,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 10:59:19,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 10:59:19,716 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:19,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:19,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1835558968, now seen corresponding path program 1 times [2025-03-08 10:59:19,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:19,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901717485] [2025-03-08 10:59:19,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:19,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:19,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-08 10:59:19,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-08 10:59:19,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:19,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:20,265 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 10:59:20,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:20,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901717485] [2025-03-08 10:59:20,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901717485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:20,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:20,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:59:20,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431835323] [2025-03-08 10:59:20,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:20,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:59:20,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:20,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:59:20,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:59:20,272 INFO L87 Difference]: Start difference. First operand 217 states and 361 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:59:20,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:20,390 INFO L93 Difference]: Finished difference Result 645 states and 1077 transitions. [2025-03-08 10:59:20,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:59:20,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 459 [2025-03-08 10:59:20,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:20,398 INFO L225 Difference]: With dead ends: 645 [2025-03-08 10:59:20,398 INFO L226 Difference]: Without dead ends: 431 [2025-03-08 10:59:20,400 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-03-08 10:59:20,400 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 220 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:20,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 743 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:59:20,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-03-08 10:59:20,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 428. [2025-03-08 10:59:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 279 states have (on average 1.5125448028673836) internal successors, (422), 279 states have internal predecessors, (422), 146 states have call successors, (146), 2 states have call predecessors, (146), 2 states have return successors, (146), 146 states have call predecessors, (146), 146 states have call successors, (146) [2025-03-08 10:59:20,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 714 transitions. [2025-03-08 10:59:20,485 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 714 transitions. Word has length 459 [2025-03-08 10:59:20,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:20,488 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 714 transitions. [2025-03-08 10:59:20,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:59:20,488 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 714 transitions. [2025-03-08 10:59:20,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-08 10:59:20,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:20,496 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:59:20,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:59:20,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:20,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:20,497 INFO L85 PathProgramCache]: Analyzing trace with hash -227150770, now seen corresponding path program 1 times [2025-03-08 10:59:20,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:20,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573565378] [2025-03-08 10:59:20,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:20,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:20,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 10:59:20,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 10:59:20,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:20,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:20,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 10:59:20,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:20,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573565378] [2025-03-08 10:59:20,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573565378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:20,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:20,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:59:20,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720222618] [2025-03-08 10:59:20,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:20,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:59:20,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:20,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:59:20,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:59:20,823 INFO L87 Difference]: Start difference. First operand 428 states and 714 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:59:20,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:20,924 INFO L93 Difference]: Finished difference Result 1246 states and 2074 transitions. [2025-03-08 10:59:20,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:59:20,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 460 [2025-03-08 10:59:20,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:20,932 INFO L225 Difference]: With dead ends: 1246 [2025-03-08 10:59:20,932 INFO L226 Difference]: Without dead ends: 821 [2025-03-08 10:59:20,934 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-03-08 10:59:20,935 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 310 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:20,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 915 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:59:20,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2025-03-08 10:59:21,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 486. [2025-03-08 10:59:21,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 337 states have (on average 1.5608308605341246) internal successors, (526), 337 states have internal predecessors, (526), 146 states have call successors, (146), 2 states have call predecessors, (146), 2 states have return successors, (146), 146 states have call predecessors, (146), 146 states have call successors, (146) [2025-03-08 10:59:21,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 818 transitions. [2025-03-08 10:59:21,033 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 818 transitions. Word has length 460 [2025-03-08 10:59:21,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:21,037 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 818 transitions. [2025-03-08 10:59:21,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:59:21,037 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 818 transitions. [2025-03-08 10:59:21,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-08 10:59:21,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:21,043 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:59:21,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:59:21,043 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:21,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:21,044 INFO L85 PathProgramCache]: Analyzing trace with hash 2029760237, now seen corresponding path program 1 times [2025-03-08 10:59:21,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:21,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360193427] [2025-03-08 10:59:21,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:21,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:21,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 10:59:21,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 10:59:21,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:21,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 10:59:21,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:21,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360193427] [2025-03-08 10:59:21,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360193427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:21,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:21,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:59:21,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128177541] [2025-03-08 10:59:21,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:21,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:59:21,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:21,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:59:21,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:59:21,389 INFO L87 Difference]: Start difference. First operand 486 states and 818 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:59:21,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:21,983 INFO L93 Difference]: Finished difference Result 1756 states and 2966 transitions. [2025-03-08 10:59:21,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:59:21,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 460 [2025-03-08 10:59:21,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:21,990 INFO L225 Difference]: With dead ends: 1756 [2025-03-08 10:59:21,990 INFO L226 Difference]: Without dead ends: 1273 [2025-03-08 10:59:21,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:59:21,992 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 522 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:21,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1215 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:59:21,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2025-03-08 10:59:22,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1264. [2025-03-08 10:59:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 919 states have (on average 1.589771490750816) internal successors, (1461), 921 states have internal predecessors, (1461), 338 states have call successors, (338), 6 states have call predecessors, (338), 6 states have return successors, (338), 336 states have call predecessors, (338), 338 states have call successors, (338) [2025-03-08 10:59:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 2137 transitions. [2025-03-08 10:59:22,084 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 2137 transitions. Word has length 460 [2025-03-08 10:59:22,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:22,085 INFO L471 AbstractCegarLoop]: Abstraction has 1264 states and 2137 transitions. [2025-03-08 10:59:22,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:59:22,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 2137 transitions. [2025-03-08 10:59:22,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-08 10:59:22,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:22,089 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:59:22,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:59:22,089 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:22,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:22,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1473211348, now seen corresponding path program 1 times [2025-03-08 10:59:22,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:22,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832059686] [2025-03-08 10:59:22,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:22,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:22,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 10:59:22,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 10:59:22,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:22,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:22,292 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 10:59:22,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:22,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832059686] [2025-03-08 10:59:22,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832059686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:22,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:22,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:59:22,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033460295] [2025-03-08 10:59:22,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:22,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:59:22,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:22,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:59:22,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:59:22,294 INFO L87 Difference]: Start difference. First operand 1264 states and 2137 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:59:22,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:22,524 INFO L93 Difference]: Finished difference Result 2674 states and 4517 transitions. [2025-03-08 10:59:22,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:59:22,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 460 [2025-03-08 10:59:22,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:22,534 INFO L225 Difference]: With dead ends: 2674 [2025-03-08 10:59:22,534 INFO L226 Difference]: Without dead ends: 1413 [2025-03-08 10:59:22,538 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-03-08 10:59:22,538 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 403 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:22,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1304 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:59:22,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2025-03-08 10:59:22,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1405. [2025-03-08 10:59:22,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1036 states have (on average 1.5916988416988418) internal successors, (1649), 1039 states have internal predecessors, (1649), 361 states have call successors, (361), 7 states have call predecessors, (361), 7 states have return successors, (361), 358 states have call predecessors, (361), 361 states have call successors, (361) [2025-03-08 10:59:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 2371 transitions. [2025-03-08 10:59:22,627 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 2371 transitions. Word has length 460 [2025-03-08 10:59:22,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:22,627 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 2371 transitions. [2025-03-08 10:59:22,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:59:22,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 2371 transitions. [2025-03-08 10:59:22,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-08 10:59:22,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:22,631 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:59:22,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 10:59:22,631 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:22,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:22,632 INFO L85 PathProgramCache]: Analyzing trace with hash -305661162, now seen corresponding path program 1 times [2025-03-08 10:59:22,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:22,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052020598] [2025-03-08 10:59:22,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:22,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:22,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-08 10:59:22,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-08 10:59:22,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:22,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 10:59:22,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:22,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052020598] [2025-03-08 10:59:22,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052020598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:22,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:22,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:59:22,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003788755] [2025-03-08 10:59:22,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:22,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:59:22,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:22,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:59:22,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:59:22,898 INFO L87 Difference]: Start difference. First operand 1405 states and 2371 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:59:23,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:23,038 INFO L93 Difference]: Finished difference Result 3831 states and 6482 transitions. [2025-03-08 10:59:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:59:23,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 461 [2025-03-08 10:59:23,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:23,052 INFO L225 Difference]: With dead ends: 3831 [2025-03-08 10:59:23,052 INFO L226 Difference]: Without dead ends: 2429 [2025-03-08 10:59:23,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-03-08 10:59:23,058 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 205 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:23,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 879 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:59:23,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2025-03-08 10:59:23,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 2420. [2025-03-08 10:59:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2420 states, 1918 states have (on average 1.6230448383733056) internal successors, (3113), 1928 states have internal predecessors, (3113), 487 states have call successors, (487), 14 states have call predecessors, (487), 14 states have return successors, (487), 477 states have call predecessors, (487), 487 states have call successors, (487) [2025-03-08 10:59:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 4087 transitions. [2025-03-08 10:59:23,169 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 4087 transitions. Word has length 461 [2025-03-08 10:59:23,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:23,169 INFO L471 AbstractCegarLoop]: Abstraction has 2420 states and 4087 transitions. [2025-03-08 10:59:23,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:59:23,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 4087 transitions. [2025-03-08 10:59:23,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-08 10:59:23,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:23,174 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:59:23,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 10:59:23,174 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:23,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:23,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1861451649, now seen corresponding path program 1 times [2025-03-08 10:59:23,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:23,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191943793] [2025-03-08 10:59:23,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:23,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:23,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-08 10:59:23,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-08 10:59:23,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:23,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:25,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 10:59:25,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:25,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191943793] [2025-03-08 10:59:25,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191943793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:25,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:25,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 10:59:25,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29228270] [2025-03-08 10:59:25,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:25,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 10:59:25,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:25,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 10:59:25,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:59:25,068 INFO L87 Difference]: Start difference. First operand 2420 states and 4087 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:59:27,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:27,349 INFO L93 Difference]: Finished difference Result 4593 states and 7779 transitions. [2025-03-08 10:59:27,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 10:59:27,349 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 462 [2025-03-08 10:59:27,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:27,365 INFO L225 Difference]: With dead ends: 4593 [2025-03-08 10:59:27,365 INFO L226 Difference]: Without dead ends: 3506 [2025-03-08 10:59:27,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-08 10:59:27,369 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 960 mSDsluCounter, 2195 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 960 SdHoareTripleChecker+Valid, 2826 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:27,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [960 Valid, 2826 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 10:59:27,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2025-03-08 10:59:27,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3093. [2025-03-08 10:59:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3093 states, 2502 states have (on average 1.6378896882494005) internal successors, (4098), 2516 states have internal predecessors, (4098), 571 states have call successors, (571), 19 states have call predecessors, (571), 19 states have return successors, (571), 557 states have call predecessors, (571), 571 states have call successors, (571) [2025-03-08 10:59:27,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3093 states to 3093 states and 5240 transitions. [2025-03-08 10:59:27,541 INFO L78 Accepts]: Start accepts. Automaton has 3093 states and 5240 transitions. Word has length 462 [2025-03-08 10:59:27,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:27,542 INFO L471 AbstractCegarLoop]: Abstraction has 3093 states and 5240 transitions. [2025-03-08 10:59:27,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:59:27,543 INFO L276 IsEmpty]: Start isEmpty. Operand 3093 states and 5240 transitions. [2025-03-08 10:59:27,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-08 10:59:27,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:27,548 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:59:27,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 10:59:27,548 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:27,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:27,548 INFO L85 PathProgramCache]: Analyzing trace with hash -74208638, now seen corresponding path program 1 times [2025-03-08 10:59:27,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:27,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902138837] [2025-03-08 10:59:27,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:27,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:27,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-08 10:59:27,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-08 10:59:27,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:27,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 10:59:28,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:28,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902138837] [2025-03-08 10:59:28,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902138837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:28,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:28,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:59:28,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296423962] [2025-03-08 10:59:28,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:28,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:59:28,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:28,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:59:28,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:59:28,018 INFO L87 Difference]: Start difference. First operand 3093 states and 5240 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-08 10:59:28,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:28,382 INFO L93 Difference]: Finished difference Result 7511 states and 12738 transitions. [2025-03-08 10:59:28,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:59:28,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) Word has length 462 [2025-03-08 10:59:28,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:28,408 INFO L225 Difference]: With dead ends: 7511 [2025-03-08 10:59:28,409 INFO L226 Difference]: Without dead ends: 4421 [2025-03-08 10:59:28,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:59:28,420 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 573 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:28,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 586 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:59:28,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4421 states. [2025-03-08 10:59:28,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4421 to 3093. [2025-03-08 10:59:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3093 states, 2502 states have (on average 1.6378896882494005) internal successors, (4098), 2516 states have internal predecessors, (4098), 571 states have call successors, (571), 19 states have call predecessors, (571), 19 states have return successors, (571), 557 states have call predecessors, (571), 571 states have call successors, (571) [2025-03-08 10:59:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3093 states to 3093 states and 5240 transitions. [2025-03-08 10:59:28,643 INFO L78 Accepts]: Start accepts. Automaton has 3093 states and 5240 transitions. Word has length 462 [2025-03-08 10:59:28,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:28,645 INFO L471 AbstractCegarLoop]: Abstraction has 3093 states and 5240 transitions. [2025-03-08 10:59:28,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-08 10:59:28,645 INFO L276 IsEmpty]: Start isEmpty. Operand 3093 states and 5240 transitions. [2025-03-08 10:59:28,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-08 10:59:28,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:28,651 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:59:28,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 10:59:28,651 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:28,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:28,652 INFO L85 PathProgramCache]: Analyzing trace with hash -43188831, now seen corresponding path program 1 times [2025-03-08 10:59:28,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:28,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319045963] [2025-03-08 10:59:28,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:28,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:28,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-08 10:59:28,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-08 10:59:28,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:28,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:29,049 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 10:59:29,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:29,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319045963] [2025-03-08 10:59:29,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319045963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:29,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:29,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:59:29,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102950322] [2025-03-08 10:59:29,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:29,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:59:29,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:29,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:59:29,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:59:29,051 INFO L87 Difference]: Start difference. First operand 3093 states and 5240 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:59:29,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:29,626 INFO L93 Difference]: Finished difference Result 14037 states and 23652 transitions. [2025-03-08 10:59:29,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:59:29,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 462 [2025-03-08 10:59:29,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:29,671 INFO L225 Difference]: With dead ends: 14037 [2025-03-08 10:59:29,671 INFO L226 Difference]: Without dead ends: 10947 [2025-03-08 10:59:29,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-03-08 10:59:29,682 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 737 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:29,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 1290 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:59:29,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10947 states. [2025-03-08 10:59:30,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10947 to 10933. [2025-03-08 10:59:30,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10933 states, 8908 states have (on average 1.6151773686573867) internal successors, (14388), 8972 states have internal predecessors, (14388), 1948 states have call successors, (1948), 76 states have call predecessors, (1948), 76 states have return successors, (1948), 1884 states have call predecessors, (1948), 1948 states have call successors, (1948) [2025-03-08 10:59:30,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10933 states to 10933 states and 18284 transitions. [2025-03-08 10:59:30,269 INFO L78 Accepts]: Start accepts. Automaton has 10933 states and 18284 transitions. Word has length 462 [2025-03-08 10:59:30,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:30,270 INFO L471 AbstractCegarLoop]: Abstraction has 10933 states and 18284 transitions. [2025-03-08 10:59:30,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:59:30,271 INFO L276 IsEmpty]: Start isEmpty. Operand 10933 states and 18284 transitions. [2025-03-08 10:59:30,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-08 10:59:30,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:30,280 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:59:30,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 10:59:30,280 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:30,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:30,281 INFO L85 PathProgramCache]: Analyzing trace with hash -887660702, now seen corresponding path program 1 times [2025-03-08 10:59:30,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:30,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72947913] [2025-03-08 10:59:30,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:30,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:30,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-08 10:59:30,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-08 10:59:30,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:30,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:32,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 10:59:32,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:32,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72947913] [2025-03-08 10:59:32,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72947913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:32,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:32,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 10:59:32,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457535892] [2025-03-08 10:59:32,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:32,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 10:59:32,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:32,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 10:59:32,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:59:32,157 INFO L87 Difference]: Start difference. First operand 10933 states and 18284 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-08 10:59:36,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:36,509 INFO L93 Difference]: Finished difference Result 16676 states and 27909 transitions. [2025-03-08 10:59:36,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 10:59:36,510 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) Word has length 462 [2025-03-08 10:59:36,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:36,555 INFO L225 Difference]: With dead ends: 16676 [2025-03-08 10:59:36,555 INFO L226 Difference]: Without dead ends: 12866 [2025-03-08 10:59:36,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2025-03-08 10:59:36,572 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 1303 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 1736 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1303 SdHoareTripleChecker+Valid, 2211 SdHoareTripleChecker+Invalid, 2027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:36,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1303 Valid, 2211 Invalid, 2027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1736 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-08 10:59:36,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12866 states. [2025-03-08 10:59:37,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12866 to 11215. [2025-03-08 10:59:37,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11215 states, 9164 states have (on average 1.620253164556962) internal successors, (14848), 9229 states have internal predecessors, (14848), 1973 states have call successors, (1973), 77 states have call predecessors, (1973), 77 states have return successors, (1973), 1908 states have call predecessors, (1973), 1973 states have call successors, (1973) [2025-03-08 10:59:37,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11215 states to 11215 states and 18794 transitions. [2025-03-08 10:59:37,163 INFO L78 Accepts]: Start accepts. Automaton has 11215 states and 18794 transitions. Word has length 462 [2025-03-08 10:59:37,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:37,163 INFO L471 AbstractCegarLoop]: Abstraction has 11215 states and 18794 transitions. [2025-03-08 10:59:37,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-08 10:59:37,164 INFO L276 IsEmpty]: Start isEmpty. Operand 11215 states and 18794 transitions. [2025-03-08 10:59:37,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-08 10:59:37,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:37,173 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:59:37,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 10:59:37,173 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:37,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:37,174 INFO L85 PathProgramCache]: Analyzing trace with hash -2063620414, now seen corresponding path program 1 times [2025-03-08 10:59:37,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:37,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937130646] [2025-03-08 10:59:37,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:37,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:37,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-08 10:59:37,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-08 10:59:37,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:37,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:37,781 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 10:59:37,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:37,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937130646] [2025-03-08 10:59:37,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937130646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:37,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:37,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 10:59:37,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000867813] [2025-03-08 10:59:37,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:37,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 10:59:37,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:37,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 10:59:37,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:59:37,783 INFO L87 Difference]: Start difference. First operand 11215 states and 18794 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-08 10:59:39,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:39,965 INFO L93 Difference]: Finished difference Result 43767 states and 73207 transitions. [2025-03-08 10:59:39,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 10:59:39,966 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) Word has length 462 [2025-03-08 10:59:39,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:40,061 INFO L225 Difference]: With dead ends: 43767 [2025-03-08 10:59:40,061 INFO L226 Difference]: Without dead ends: 32597 [2025-03-08 10:59:40,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-08 10:59:40,093 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 1511 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:40,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1511 Valid, 1879 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 10:59:40,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32597 states. [2025-03-08 10:59:41,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32597 to 21305. [2025-03-08 10:59:41,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21305 states, 18029 states have (on average 1.6363081701702813) internal successors, (29501), 18166 states have internal predecessors, (29501), 3125 states have call successors, (3125), 150 states have call predecessors, (3125), 150 states have return successors, (3125), 2988 states have call predecessors, (3125), 3125 states have call successors, (3125) [2025-03-08 10:59:41,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21305 states to 21305 states and 35751 transitions. [2025-03-08 10:59:41,406 INFO L78 Accepts]: Start accepts. Automaton has 21305 states and 35751 transitions. Word has length 462 [2025-03-08 10:59:41,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:41,407 INFO L471 AbstractCegarLoop]: Abstraction has 21305 states and 35751 transitions. [2025-03-08 10:59:41,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-08 10:59:41,407 INFO L276 IsEmpty]: Start isEmpty. Operand 21305 states and 35751 transitions. [2025-03-08 10:59:41,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-08 10:59:41,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:41,420 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:59:41,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 10:59:41,421 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:41,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:41,421 INFO L85 PathProgramCache]: Analyzing trace with hash 295686595, now seen corresponding path program 1 times [2025-03-08 10:59:41,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:41,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845901641] [2025-03-08 10:59:41,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:41,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:41,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-08 10:59:41,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-08 10:59:41,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:41,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 10:59:50,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:50,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845901641] [2025-03-08 10:59:50,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845901641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:50,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:50,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 10:59:50,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288285344] [2025-03-08 10:59:50,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:50,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 10:59:50,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:50,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 10:59:50,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2025-03-08 10:59:50,559 INFO L87 Difference]: Start difference. First operand 21305 states and 35751 transitions. Second operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 4 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 4 states have call successors, (73) [2025-03-08 10:59:55,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:55,106 INFO L93 Difference]: Finished difference Result 35759 states and 58893 transitions. [2025-03-08 10:59:55,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 10:59:55,113 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 4 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 4 states have call successors, (73) Word has length 462 [2025-03-08 10:59:55,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:55,239 INFO L225 Difference]: With dead ends: 35759 [2025-03-08 10:59:55,239 INFO L226 Difference]: Without dead ends: 35757 [2025-03-08 10:59:55,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 10:59:55,257 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 595 mSDsluCounter, 2206 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 2532 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:55,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 2532 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 10:59:55,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35757 states. [2025-03-08 10:59:56,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35757 to 30783. [2025-03-08 10:59:56,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30783 states, 27458 states have (on average 1.653980624954476) internal successors, (45415), 27594 states have internal predecessors, (45415), 3173 states have call successors, (3173), 151 states have call predecessors, (3173), 151 states have return successors, (3173), 3037 states have call predecessors, (3173), 3173 states have call successors, (3173) [2025-03-08 10:59:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30783 states to 30783 states and 51761 transitions. [2025-03-08 10:59:57,078 INFO L78 Accepts]: Start accepts. Automaton has 30783 states and 51761 transitions. Word has length 462 [2025-03-08 10:59:57,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:57,082 INFO L471 AbstractCegarLoop]: Abstraction has 30783 states and 51761 transitions. [2025-03-08 10:59:57,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 4 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 4 states have call successors, (73) [2025-03-08 10:59:57,083 INFO L276 IsEmpty]: Start isEmpty. Operand 30783 states and 51761 transitions. [2025-03-08 10:59:57,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-08 10:59:57,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:57,113 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:59:57,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 10:59:57,114 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:57,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:57,117 INFO L85 PathProgramCache]: Analyzing trace with hash 424769314, now seen corresponding path program 1 times [2025-03-08 10:59:57,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:57,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100453190] [2025-03-08 10:59:57,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:57,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:57,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-08 10:59:57,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-08 10:59:57,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:57,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:58,226 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 10:59:58,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:58,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100453190] [2025-03-08 10:59:58,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100453190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:58,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:58,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:59:58,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89586566] [2025-03-08 10:59:58,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:58,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:59:58,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:58,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:59:58,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:59:58,233 INFO L87 Difference]: Start difference. First operand 30783 states and 51761 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 11:00:00,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:00,237 INFO L93 Difference]: Finished difference Result 77579 states and 129563 transitions. [2025-03-08 11:00:00,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:00:00,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 462 [2025-03-08 11:00:00,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:00,394 INFO L225 Difference]: With dead ends: 77579 [2025-03-08 11:00:00,395 INFO L226 Difference]: Without dead ends: 54703 [2025-03-08 11:00:00,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:00:00,465 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 374 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:00,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1538 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:00:00,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54703 states. [2025-03-08 11:00:02,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54703 to 31215. [2025-03-08 11:00:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31215 states, 27890 states have (on average 1.6451416278235926) internal successors, (45883), 28026 states have internal predecessors, (45883), 3173 states have call successors, (3173), 151 states have call predecessors, (3173), 151 states have return successors, (3173), 3037 states have call predecessors, (3173), 3173 states have call successors, (3173) [2025-03-08 11:00:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31215 states to 31215 states and 52229 transitions. [2025-03-08 11:00:02,792 INFO L78 Accepts]: Start accepts. Automaton has 31215 states and 52229 transitions. Word has length 462 [2025-03-08 11:00:02,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:02,794 INFO L471 AbstractCegarLoop]: Abstraction has 31215 states and 52229 transitions. [2025-03-08 11:00:02,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 11:00:02,794 INFO L276 IsEmpty]: Start isEmpty. Operand 31215 states and 52229 transitions. [2025-03-08 11:00:02,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-08 11:00:02,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:02,813 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 11:00:02,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 11:00:02,815 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:02,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:02,818 INFO L85 PathProgramCache]: Analyzing trace with hash 260449026, now seen corresponding path program 1 times [2025-03-08 11:00:02,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:02,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56681455] [2025-03-08 11:00:02,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:02,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:02,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-08 11:00:03,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-08 11:00:03,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:03,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:09,254 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 11:00:09,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:09,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56681455] [2025-03-08 11:00:09,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56681455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:09,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:00:09,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 11:00:09,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469664406] [2025-03-08 11:00:09,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:09,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 11:00:09,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:09,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 11:00:09,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-08 11:00:09,257 INFO L87 Difference]: Start difference. First operand 31215 states and 52229 transitions. Second operand has 15 states, 15 states have (on average 6.666666666666667) internal successors, (100), 15 states have internal predecessors, (100), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-08 11:00:13,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:13,898 INFO L93 Difference]: Finished difference Result 86049 states and 140981 transitions. [2025-03-08 11:00:13,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 11:00:13,899 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.666666666666667) internal successors, (100), 15 states have internal predecessors, (100), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) Word has length 462 [2025-03-08 11:00:13,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:14,072 INFO L225 Difference]: With dead ends: 86049 [2025-03-08 11:00:14,072 INFO L226 Difference]: Without dead ends: 62741 [2025-03-08 11:00:14,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-03-08 11:00:14,111 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 685 mSDsluCounter, 2587 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 2933 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:14,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 2933 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 11:00:14,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62741 states. [2025-03-08 11:00:17,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62741 to 58125. [2025-03-08 11:00:17,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58125 states, 50543 states have (on average 1.5936529291890074) internal successors, (80548), 50959 states have internal predecessors, (80548), 7137 states have call successors, (7137), 444 states have call predecessors, (7137), 444 states have return successors, (7137), 6721 states have call predecessors, (7137), 7137 states have call successors, (7137) [2025-03-08 11:00:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58125 states to 58125 states and 94822 transitions. [2025-03-08 11:00:17,480 INFO L78 Accepts]: Start accepts. Automaton has 58125 states and 94822 transitions. Word has length 462 [2025-03-08 11:00:17,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:17,480 INFO L471 AbstractCegarLoop]: Abstraction has 58125 states and 94822 transitions. [2025-03-08 11:00:17,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.666666666666667) internal successors, (100), 15 states have internal predecessors, (100), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-08 11:00:17,481 INFO L276 IsEmpty]: Start isEmpty. Operand 58125 states and 94822 transitions. [2025-03-08 11:00:17,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-08 11:00:17,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:17,500 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 11:00:17,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 11:00:17,500 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:17,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:17,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1803238404, now seen corresponding path program 1 times [2025-03-08 11:00:17,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:17,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962490112] [2025-03-08 11:00:17,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:17,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:17,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-08 11:00:17,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-08 11:00:17,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:17,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 11:00:17,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:17,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962490112] [2025-03-08 11:00:17,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962490112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:17,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:00:17,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:00:17,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964470710] [2025-03-08 11:00:17,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:17,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:00:17,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:17,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:00:17,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:00:17,692 INFO L87 Difference]: Start difference. First operand 58125 states and 94822 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 11:00:20,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:20,303 INFO L93 Difference]: Finished difference Result 79381 states and 130357 transitions. [2025-03-08 11:00:20,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:00:20,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 462 [2025-03-08 11:00:20,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:20,465 INFO L225 Difference]: With dead ends: 79381 [2025-03-08 11:00:20,466 INFO L226 Difference]: Without dead ends: 57693 [2025-03-08 11:00:20,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:00:20,523 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 343 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:20,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 539 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:00:20,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57693 states.