./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-51.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 183ff7e14885c1f89cae46f39f0bc46efaeb3ccc298d253cb5ddd39e2e379927 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:58:54,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:58:54,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:58:54,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:58:54,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:58:54,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:58:54,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:58:54,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:58:54,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:58:54,665 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:58:54,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:58:54,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:58:54,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:58:54,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:58:54,665 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:58:54,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:58:54,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:58:54,666 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:58:54,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:58:54,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:58:54,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:58:54,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:58:54,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:58:54,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:58:54,666 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:58:54,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:58:54,666 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:58:54,667 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:58:54,667 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:58:54,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:58:54,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:58:54,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:58:54,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:58:54,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:58:54,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:58:54,667 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:58:54,667 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:58:54,668 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:58:54,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:58:54,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:58:54,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:58:54,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:58:54,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:58:54,668 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 183ff7e14885c1f89cae46f39f0bc46efaeb3ccc298d253cb5ddd39e2e379927 [2025-02-05 21:58:54,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:58:54,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:58:54,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:58:54,907 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:58:54,907 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:58:54,908 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-51.i [2025-02-05 21:58:56,107 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/082779b6d/1903cd5ecac44311b109392af1ee1d3e/FLAGe6a7e23ab [2025-02-05 21:58:56,446 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:58:56,448 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-51.i [2025-02-05 21:58:56,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/082779b6d/1903cd5ecac44311b109392af1ee1d3e/FLAGe6a7e23ab [2025-02-05 21:58:56,697 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/082779b6d/1903cd5ecac44311b109392af1ee1d3e [2025-02-05 21:58:56,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:58:56,701 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:58:56,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:58:56,703 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:58:56,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:58:56,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:58:56" (1/1) ... [2025-02-05 21:58:56,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dbf557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:56, skipping insertion in model container [2025-02-05 21:58:56,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:58:56" (1/1) ... [2025-02-05 21:58:56,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:58:56,833 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-51.i[916,929] [2025-02-05 21:58:57,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:58:57,026 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:58:57,034 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-51.i[916,929] [2025-02-05 21:58:57,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:58:57,141 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:58:57,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:57 WrapperNode [2025-02-05 21:58:57,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:58:57,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:58:57,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:58:57,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:58:57,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:57" (1/1) ... [2025-02-05 21:58:57,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:57" (1/1) ... [2025-02-05 21:58:57,212 INFO L138 Inliner]: procedures = 26, calls = 114, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 841 [2025-02-05 21:58:57,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:58:57,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:58:57,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:58:57,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:58:57,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:57" (1/1) ... [2025-02-05 21:58:57,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:57" (1/1) ... [2025-02-05 21:58:57,234 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:57" (1/1) ... [2025-02-05 21:58:57,269 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:58:57,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:57" (1/1) ... [2025-02-05 21:58:57,273 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:57" (1/1) ... [2025-02-05 21:58:57,299 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:57" (1/1) ... [2025-02-05 21:58:57,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:57" (1/1) ... [2025-02-05 21:58:57,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:57" (1/1) ... [2025-02-05 21:58:57,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:57" (1/1) ... [2025-02-05 21:58:57,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:58:57,344 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:58:57,344 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:58:57,344 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:58:57,346 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:57" (1/1) ... [2025-02-05 21:58:57,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:58:57,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:58:57,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:58:57,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:58:57,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:58:57,394 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:58:57,394 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:58:57,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:58:57,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:58:57,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:58:57,485 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:58:57,486 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:58:58,435 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-05 21:58:58,435 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:58:58,471 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:58:58,471 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:58:58,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:58:58 BoogieIcfgContainer [2025-02-05 21:58:58,471 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:58:58,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:58:58,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:58:58,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:58:58,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:58:56" (1/3) ... [2025-02-05 21:58:58,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae34f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:58:58, skipping insertion in model container [2025-02-05 21:58:58,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:57" (2/3) ... [2025-02-05 21:58:58,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae34f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:58:58, skipping insertion in model container [2025-02-05 21:58:58,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:58:58" (3/3) ... [2025-02-05 21:58:58,479 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-51.i [2025-02-05 21:58:58,488 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:58:58,490 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-51.i that has 2 procedures, 347 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:58:58,540 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:58:58,550 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;@1a4f67c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:58:58,550 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:58:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 347 states, 243 states have (on average 1.617283950617284) internal successors, (393), 244 states have internal predecessors, (393), 101 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 101 states have call predecessors, (101), 101 states have call successors, (101) [2025-02-05 21:58:58,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-02-05 21:58:58,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:58,580 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:58:58,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:58,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:58,585 INFO L85 PathProgramCache]: Analyzing trace with hash 34818533, now seen corresponding path program 1 times [2025-02-05 21:58:58,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:58,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364704931] [2025-02-05 21:58:58,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:58,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:58,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-02-05 21:58:58,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-02-05 21:58:58,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:58,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 20000 trivial. 0 not checked. [2025-02-05 21:58:59,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:59,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364704931] [2025-02-05 21:58:59,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364704931] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:58:59,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60243489] [2025-02-05 21:58:59,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:59,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:58:59,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:58:59,097 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:58:59,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:58:59,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-02-05 21:58:59,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-02-05 21:58:59,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:59,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:59,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 1510 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:58:59,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:58:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 20000 trivial. 0 not checked. [2025-02-05 21:58:59,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:58:59,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60243489] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:59,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:58:59,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:58:59,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826687795] [2025-02-05 21:58:59,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:59,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:58:59,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:59,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:58:59,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:58:59,556 INFO L87 Difference]: Start difference. First operand has 347 states, 243 states have (on average 1.617283950617284) internal successors, (393), 244 states have internal predecessors, (393), 101 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 101 states have call predecessors, (101), 101 states have call successors, (101) Second operand has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (101), 2 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 2 states have call successors, (101) [2025-02-05 21:58:59,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:59,647 INFO L93 Difference]: Finished difference Result 684 states and 1279 transitions. [2025-02-05 21:58:59,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:58:59,649 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (101), 2 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 2 states have call successors, (101) Word has length 650 [2025-02-05 21:58:59,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:59,655 INFO L225 Difference]: With dead ends: 684 [2025-02-05 21:58:59,655 INFO L226 Difference]: Without dead ends: 340 [2025-02-05 21:58:59,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:58:59,660 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:59,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 563 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:58:59,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-02-05 21:58:59,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2025-02-05 21:58:59,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 237 states have (on average 1.590717299578059) internal successors, (377), 237 states have internal predecessors, (377), 101 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 101 states have call predecessors, (101), 101 states have call successors, (101) [2025-02-05 21:58:59,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 579 transitions. [2025-02-05 21:58:59,728 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 579 transitions. Word has length 650 [2025-02-05 21:58:59,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:59,728 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 579 transitions. [2025-02-05 21:58:59,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (101), 2 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 2 states have call successors, (101) [2025-02-05 21:58:59,729 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 579 transitions. [2025-02-05 21:58:59,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-02-05 21:58:59,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:59,739 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:58:59,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 21:58:59,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:58:59,940 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:59,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:59,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1348334980, now seen corresponding path program 1 times [2025-02-05 21:58:59,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:59,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495145488] [2025-02-05 21:58:59,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:59,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:59,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-02-05 21:59:00,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-02-05 21:59:00,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:00,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:00,625 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-02-05 21:59:00,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:00,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495145488] [2025-02-05 21:59:00,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495145488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:00,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:00,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:00,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149135223] [2025-02-05 21:59:00,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:00,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:00,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:00,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:00,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:00,632 INFO L87 Difference]: Start difference. First operand 340 states and 579 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:59:00,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:00,755 INFO L93 Difference]: Finished difference Result 915 states and 1566 transitions. [2025-02-05 21:59:00,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:00,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 650 [2025-02-05 21:59:00,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:00,768 INFO L225 Difference]: With dead ends: 915 [2025-02-05 21:59:00,768 INFO L226 Difference]: Without dead ends: 578 [2025-02-05 21:59:00,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:00,770 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 402 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:00,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1100 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:00,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-02-05 21:59:00,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 575. [2025-02-05 21:59:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 433 states have (on average 1.625866050808314) internal successors, (704), 434 states have internal predecessors, (704), 139 states have call successors, (139), 2 states have call predecessors, (139), 2 states have return successors, (139), 138 states have call predecessors, (139), 139 states have call successors, (139) [2025-02-05 21:59:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 982 transitions. [2025-02-05 21:59:00,857 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 982 transitions. Word has length 650 [2025-02-05 21:59:00,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:00,859 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 982 transitions. [2025-02-05 21:59:00,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:59:00,860 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 982 transitions. [2025-02-05 21:59:00,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-02-05 21:59:00,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:00,865 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:59:00,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:59:00,866 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:00,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:00,866 INFO L85 PathProgramCache]: Analyzing trace with hash 777083747, now seen corresponding path program 1 times [2025-02-05 21:59:00,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:00,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788017538] [2025-02-05 21:59:00,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:00,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:00,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-02-05 21:59:00,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-02-05 21:59:00,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:00,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:01,116 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-02-05 21:59:01,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:01,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788017538] [2025-02-05 21:59:01,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788017538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:01,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:01,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:01,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184466689] [2025-02-05 21:59:01,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:01,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:01,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:01,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:01,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:01,120 INFO L87 Difference]: Start difference. First operand 575 states and 982 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:59:01,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:01,230 INFO L93 Difference]: Finished difference Result 1588 states and 2716 transitions. [2025-02-05 21:59:01,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:01,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 650 [2025-02-05 21:59:01,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:01,241 INFO L225 Difference]: With dead ends: 1588 [2025-02-05 21:59:01,242 INFO L226 Difference]: Without dead ends: 1016 [2025-02-05 21:59:01,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:01,246 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 378 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:01,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1101 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:01,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2025-02-05 21:59:01,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1013. [2025-02-05 21:59:01,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 785 states have (on average 1.629299363057325) internal successors, (1279), 788 states have internal predecessors, (1279), 223 states have call successors, (223), 4 states have call predecessors, (223), 4 states have return successors, (223), 220 states have call predecessors, (223), 223 states have call successors, (223) [2025-02-05 21:59:01,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1725 transitions. [2025-02-05 21:59:01,339 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1725 transitions. Word has length 650 [2025-02-05 21:59:01,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:01,340 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1725 transitions. [2025-02-05 21:59:01,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:59:01,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1725 transitions. [2025-02-05 21:59:01,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-02-05 21:59:01,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:01,345 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:59:01,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:59:01,345 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:01,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:01,345 INFO L85 PathProgramCache]: Analyzing trace with hash -483859774, now seen corresponding path program 1 times [2025-02-05 21:59:01,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:01,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176743365] [2025-02-05 21:59:01,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:01,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:01,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-02-05 21:59:01,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-02-05 21:59:01,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:01,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-02-05 21:59:01,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:01,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176743365] [2025-02-05 21:59:01,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176743365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:01,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:01,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:01,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871981480] [2025-02-05 21:59:01,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:01,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:01,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:01,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:01,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:01,616 INFO L87 Difference]: Start difference. First operand 1013 states and 1725 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:59:01,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:01,731 INFO L93 Difference]: Finished difference Result 3031 states and 5165 transitions. [2025-02-05 21:59:01,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:01,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 650 [2025-02-05 21:59:01,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:01,743 INFO L225 Difference]: With dead ends: 3031 [2025-02-05 21:59:01,744 INFO L226 Difference]: Without dead ends: 2021 [2025-02-05 21:59:01,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:01,749 INFO L435 NwaCegarLoop]: 792 mSDtfsCounter, 566 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:01,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1342 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:59:01,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2025-02-05 21:59:01,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 2019. [2025-02-05 21:59:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2019 states, 1564 states have (on average 1.6278772378516624) internal successors, (2546), 1570 states have internal predecessors, (2546), 446 states have call successors, (446), 8 states have call predecessors, (446), 8 states have return successors, (446), 440 states have call predecessors, (446), 446 states have call successors, (446) [2025-02-05 21:59:01,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 3438 transitions. [2025-02-05 21:59:01,876 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 3438 transitions. Word has length 650 [2025-02-05 21:59:01,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:01,877 INFO L471 AbstractCegarLoop]: Abstraction has 2019 states and 3438 transitions. [2025-02-05 21:59:01,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:59:01,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 3438 transitions. [2025-02-05 21:59:01,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-02-05 21:59:01,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:01,883 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:59:01,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:59:01,883 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:01,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:01,884 INFO L85 PathProgramCache]: Analyzing trace with hash 285310241, now seen corresponding path program 1 times [2025-02-05 21:59:01,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:01,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117047693] [2025-02-05 21:59:01,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:01,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:01,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-02-05 21:59:01,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-02-05 21:59:01,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:01,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-02-05 21:59:02,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:02,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117047693] [2025-02-05 21:59:02,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117047693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:02,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:02,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:02,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464686464] [2025-02-05 21:59:02,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:02,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:02,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:02,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:02,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:02,168 INFO L87 Difference]: Start difference. First operand 2019 states and 3438 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:59:02,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:02,350 INFO L93 Difference]: Finished difference Result 6043 states and 10292 transitions. [2025-02-05 21:59:02,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:02,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 650 [2025-02-05 21:59:02,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:02,371 INFO L225 Difference]: With dead ends: 6043 [2025-02-05 21:59:02,371 INFO L226 Difference]: Without dead ends: 4027 [2025-02-05 21:59:02,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:02,379 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 561 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:02,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1602 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:02,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4027 states. [2025-02-05 21:59:02,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4027 to 4017. [2025-02-05 21:59:02,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4017 states, 3108 states have (on average 1.6216216216216217) internal successors, (5040), 3120 states have internal predecessors, (5040), 892 states have call successors, (892), 16 states have call predecessors, (892), 16 states have return successors, (892), 880 states have call predecessors, (892), 892 states have call successors, (892) [2025-02-05 21:59:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 6824 transitions. [2025-02-05 21:59:02,617 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 6824 transitions. Word has length 650 [2025-02-05 21:59:02,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:02,618 INFO L471 AbstractCegarLoop]: Abstraction has 4017 states and 6824 transitions. [2025-02-05 21:59:02,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:59:02,618 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 6824 transitions. [2025-02-05 21:59:02,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-02-05 21:59:02,624 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:02,624 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:59:02,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:59:02,624 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:02,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:02,625 INFO L85 PathProgramCache]: Analyzing trace with hash 218303488, now seen corresponding path program 1 times [2025-02-05 21:59:02,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:02,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402749461] [2025-02-05 21:59:02,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:02,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:02,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-02-05 21:59:02,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-02-05 21:59:02,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:02,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:03,139 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-02-05 21:59:03,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:03,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402749461] [2025-02-05 21:59:03,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402749461] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:03,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:03,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:59:03,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584928221] [2025-02-05 21:59:03,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:03,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:59:03,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:03,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:59:03,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:59:03,141 INFO L87 Difference]: Start difference. First operand 4017 states and 6824 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:59:04,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:04,451 INFO L93 Difference]: Finished difference Result 14437 states and 24488 transitions. [2025-02-05 21:59:04,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:59:04,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 650 [2025-02-05 21:59:04,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:04,506 INFO L225 Difference]: With dead ends: 14437 [2025-02-05 21:59:04,507 INFO L226 Difference]: Without dead ends: 10423 [2025-02-05 21:59:04,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:59:04,522 INFO L435 NwaCegarLoop]: 1035 mSDtfsCounter, 1223 mSDsluCounter, 2775 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 3810 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:04,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 3810 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 21:59:04,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10423 states. [2025-02-05 21:59:05,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10423 to 9065. [2025-02-05 21:59:05,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9065 states, 7284 states have (on average 1.6364634816035146) internal successors, (11920), 7320 states have internal predecessors, (11920), 1740 states have call successors, (1740), 40 states have call predecessors, (1740), 40 states have return successors, (1740), 1704 states have call predecessors, (1740), 1740 states have call successors, (1740) [2025-02-05 21:59:05,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9065 states to 9065 states and 15400 transitions. [2025-02-05 21:59:05,077 INFO L78 Accepts]: Start accepts. Automaton has 9065 states and 15400 transitions. Word has length 650 [2025-02-05 21:59:05,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:05,078 INFO L471 AbstractCegarLoop]: Abstraction has 9065 states and 15400 transitions. [2025-02-05 21:59:05,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:59:05,079 INFO L276 IsEmpty]: Start isEmpty. Operand 9065 states and 15400 transitions. [2025-02-05 21:59:05,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-02-05 21:59:05,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:05,088 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:59:05,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:59:05,088 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:05,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:05,089 INFO L85 PathProgramCache]: Analyzing trace with hash 231836289, now seen corresponding path program 1 times [2025-02-05 21:59:05,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:05,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139909109] [2025-02-05 21:59:05,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:05,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:05,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-02-05 21:59:05,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-02-05 21:59:05,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:05,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:05,463 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-02-05 21:59:05,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:05,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139909109] [2025-02-05 21:59:05,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139909109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:05,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:05,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:05,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451733709] [2025-02-05 21:59:05,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:05,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:05,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:05,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:05,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:05,469 INFO L87 Difference]: Start difference. First operand 9065 states and 15400 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:59:06,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:06,031 INFO L93 Difference]: Finished difference Result 26997 states and 45910 transitions. [2025-02-05 21:59:06,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:06,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 650 [2025-02-05 21:59:06,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:06,110 INFO L225 Difference]: With dead ends: 26997 [2025-02-05 21:59:06,110 INFO L226 Difference]: Without dead ends: 17935 [2025-02-05 21:59:06,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:06,133 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 510 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:06,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1367 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:06,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17935 states. [2025-02-05 21:59:07,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17935 to 17933. [2025-02-05 21:59:07,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17933 states, 14372 states have (on average 1.6301141107709436) internal successors, (23428), 14444 states have internal predecessors, (23428), 3480 states have call successors, (3480), 80 states have call predecessors, (3480), 80 states have return successors, (3480), 3408 states have call predecessors, (3480), 3480 states have call successors, (3480) [2025-02-05 21:59:07,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17933 states to 17933 states and 30388 transitions. [2025-02-05 21:59:07,130 INFO L78 Accepts]: Start accepts. Automaton has 17933 states and 30388 transitions. Word has length 650 [2025-02-05 21:59:07,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:07,131 INFO L471 AbstractCegarLoop]: Abstraction has 17933 states and 30388 transitions. [2025-02-05 21:59:07,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:59:07,132 INFO L276 IsEmpty]: Start isEmpty. Operand 17933 states and 30388 transitions. [2025-02-05 21:59:07,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-02-05 21:59:07,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:07,145 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:59:07,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:59:07,146 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:07,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:07,147 INFO L85 PathProgramCache]: Analyzing trace with hash 486572834, now seen corresponding path program 1 times [2025-02-05 21:59:07,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:07,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41866153] [2025-02-05 21:59:07,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:07,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:07,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-02-05 21:59:07,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-02-05 21:59:07,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:07,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-02-05 21:59:07,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:07,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41866153] [2025-02-05 21:59:07,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41866153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:07,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:07,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:07,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502429215] [2025-02-05 21:59:07,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:07,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:07,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:07,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:07,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:07,643 INFO L87 Difference]: Start difference. First operand 17933 states and 30388 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:59:08,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:08,336 INFO L93 Difference]: Finished difference Result 44869 states and 76086 transitions. [2025-02-05 21:59:08,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:08,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 650 [2025-02-05 21:59:08,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:08,420 INFO L225 Difference]: With dead ends: 44869 [2025-02-05 21:59:08,420 INFO L226 Difference]: Without dead ends: 26939 [2025-02-05 21:59:08,470 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-02-05 21:59:08,470 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 362 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:08,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1185 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:59:08,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26939 states. [2025-02-05 21:59:09,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26939 to 26897. [2025-02-05 21:59:09,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26897 states, 21556 states have (on average 1.6283169419187233) internal successors, (35100), 21664 states have internal predecessors, (35100), 5220 states have call successors, (5220), 120 states have call predecessors, (5220), 120 states have return successors, (5220), 5112 states have call predecessors, (5220), 5220 states have call successors, (5220) [2025-02-05 21:59:09,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26897 states to 26897 states and 45540 transitions. [2025-02-05 21:59:09,678 INFO L78 Accepts]: Start accepts. Automaton has 26897 states and 45540 transitions. Word has length 650 [2025-02-05 21:59:09,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:09,679 INFO L471 AbstractCegarLoop]: Abstraction has 26897 states and 45540 transitions. [2025-02-05 21:59:09,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:59:09,680 INFO L276 IsEmpty]: Start isEmpty. Operand 26897 states and 45540 transitions. [2025-02-05 21:59:09,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2025-02-05 21:59:09,697 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:09,698 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:59:09,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:59:09,698 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:09,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:09,699 INFO L85 PathProgramCache]: Analyzing trace with hash -966122104, now seen corresponding path program 1 times [2025-02-05 21:59:09,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:09,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242740990] [2025-02-05 21:59:09,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:09,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:09,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-02-05 21:59:09,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-02-05 21:59:09,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:09,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:10,331 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-02-05 21:59:10,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:10,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242740990] [2025-02-05 21:59:10,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242740990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:10,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:10,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:59:10,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114544207] [2025-02-05 21:59:10,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:10,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:59:10,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:10,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:59:10,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:59:10,334 INFO L87 Difference]: Start difference. First operand 26897 states and 45540 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:59:12,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:12,853 INFO L93 Difference]: Finished difference Result 80283 states and 134011 transitions. [2025-02-05 21:59:12,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:59:12,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 651 [2025-02-05 21:59:12,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:13,077 INFO L225 Difference]: With dead ends: 80283 [2025-02-05 21:59:13,078 INFO L226 Difference]: Without dead ends: 53389 [2025-02-05 21:59:13,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:59:13,144 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 790 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 1925 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:13,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 1925 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:59:13,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53389 states. [2025-02-05 21:59:15,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53389 to 42446. [2025-02-05 21:59:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42446 states, 32426 states have (on average 1.5833590328748535) internal successors, (51342), 32655 states have internal predecessors, (51342), 9776 states have call successors, (9776), 243 states have call predecessors, (9776), 243 states have return successors, (9776), 9547 states have call predecessors, (9776), 9776 states have call successors, (9776) [2025-02-05 21:59:15,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42446 states to 42446 states and 70894 transitions. [2025-02-05 21:59:15,891 INFO L78 Accepts]: Start accepts. Automaton has 42446 states and 70894 transitions. Word has length 651 [2025-02-05 21:59:15,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:15,892 INFO L471 AbstractCegarLoop]: Abstraction has 42446 states and 70894 transitions. [2025-02-05 21:59:15,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:59:15,893 INFO L276 IsEmpty]: Start isEmpty. Operand 42446 states and 70894 transitions. [2025-02-05 21:59:15,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2025-02-05 21:59:15,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:15,916 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:59:15,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:59:15,916 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:15,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:15,916 INFO L85 PathProgramCache]: Analyzing trace with hash -121650233, now seen corresponding path program 1 times [2025-02-05 21:59:15,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:15,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611248802] [2025-02-05 21:59:15,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:15,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:15,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-02-05 21:59:15,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-02-05 21:59:15,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:15,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-02-05 21:59:16,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:16,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611248802] [2025-02-05 21:59:16,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611248802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:16,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:16,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:59:16,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105734991] [2025-02-05 21:59:16,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:16,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:59:16,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:16,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:59:16,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:59:16,659 INFO L87 Difference]: Start difference. First operand 42446 states and 70894 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:59:20,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:20,420 INFO L93 Difference]: Finished difference Result 102663 states and 170874 transitions. [2025-02-05 21:59:20,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:59:20,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 651 [2025-02-05 21:59:20,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:20,702 INFO L225 Difference]: With dead ends: 102663 [2025-02-05 21:59:20,703 INFO L226 Difference]: Without dead ends: 60049 [2025-02-05 21:59:20,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:59:20,821 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 1523 mSDsluCounter, 1884 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 2446 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:20,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 2446 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 21:59:20,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60049 states. [2025-02-05 21:59:23,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60049 to 41218. [2025-02-05 21:59:23,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41218 states, 34055 states have (on average 1.6311848480399354) internal successors, (55550), 34206 states have internal predecessors, (55550), 6950 states have call successors, (6950), 212 states have call predecessors, (6950), 212 states have return successors, (6950), 6799 states have call predecessors, (6950), 6950 states have call successors, (6950) [2025-02-05 21:59:23,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41218 states to 41218 states and 69450 transitions. [2025-02-05 21:59:23,418 INFO L78 Accepts]: Start accepts. Automaton has 41218 states and 69450 transitions. Word has length 651 [2025-02-05 21:59:23,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:23,419 INFO L471 AbstractCegarLoop]: Abstraction has 41218 states and 69450 transitions. [2025-02-05 21:59:23,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:59:23,420 INFO L276 IsEmpty]: Start isEmpty. Operand 41218 states and 69450 transitions. [2025-02-05 21:59:23,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2025-02-05 21:59:23,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:23,445 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:59:23,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:59:23,445 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:23,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:23,446 INFO L85 PathProgramCache]: Analyzing trace with hash 759358793, now seen corresponding path program 1 times [2025-02-05 21:59:23,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:23,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324385253] [2025-02-05 21:59:23,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:23,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:23,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-02-05 21:59:23,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-02-05 21:59:23,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:23,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-02-05 21:59:23,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:23,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324385253] [2025-02-05 21:59:23,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324385253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:23,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:23,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:23,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500768716] [2025-02-05 21:59:23,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:23,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:23,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:23,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:23,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:23,597 INFO L87 Difference]: Start difference. First operand 41218 states and 69450 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:59:25,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:25,738 INFO L93 Difference]: Finished difference Result 100577 states and 167946 transitions. [2025-02-05 21:59:25,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:25,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 651 [2025-02-05 21:59:25,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:25,953 INFO L225 Difference]: With dead ends: 100577 [2025-02-05 21:59:25,954 INFO L226 Difference]: Without dead ends: 59430 [2025-02-05 21:59:26,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:26,048 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 296 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:26,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1120 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:59:26,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59430 states. [2025-02-05 21:59:29,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59430 to 59416. [2025-02-05 21:59:29,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59416 states, 45251 states have (on average 1.5654018695719432) internal successors, (70836), 45564 states have internal predecessors, (70836), 13742 states have call successors, (13742), 422 states have call predecessors, (13742), 422 states have return successors, (13742), 13429 states have call predecessors, (13742), 13742 states have call successors, (13742) [2025-02-05 21:59:30,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59416 states to 59416 states and 98320 transitions. [2025-02-05 21:59:30,160 INFO L78 Accepts]: Start accepts. Automaton has 59416 states and 98320 transitions. Word has length 651 [2025-02-05 21:59:30,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:30,161 INFO L471 AbstractCegarLoop]: Abstraction has 59416 states and 98320 transitions. [2025-02-05 21:59:30,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:59:30,161 INFO L276 IsEmpty]: Start isEmpty. Operand 59416 states and 98320 transitions. [2025-02-05 21:59:30,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2025-02-05 21:59:30,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:30,183 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:59:30,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:59:30,183 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:30,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:30,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1602134313, now seen corresponding path program 1 times [2025-02-05 21:59:30,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:30,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280381128] [2025-02-05 21:59:30,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:30,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:30,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-02-05 21:59:30,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-02-05 21:59:30,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:30,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-02-05 21:59:30,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:30,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280381128] [2025-02-05 21:59:30,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280381128] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:30,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:30,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:59:30,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278317870] [2025-02-05 21:59:30,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:30,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:59:30,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:30,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:59:30,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:59:30,546 INFO L87 Difference]: Start difference. First operand 59416 states and 98320 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:59:36,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:36,688 INFO L93 Difference]: Finished difference Result 195072 states and 320522 transitions. [2025-02-05 21:59:36,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:59:36,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 651 [2025-02-05 21:59:36,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:37,143 INFO L225 Difference]: With dead ends: 195072 [2025-02-05 21:59:37,143 INFO L226 Difference]: Without dead ends: 135727 [2025-02-05 21:59:37,272 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-02-05 21:59:37,272 INFO L435 NwaCegarLoop]: 688 mSDtfsCounter, 1095 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:37,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 1848 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:59:37,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135727 states.