./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-20.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_loopvsstraightlinecode_100-1loop_file-20.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 d7483f4c602f1d80c3d31837b57d86164e65df5e6fa201344a2b0a8f22740044 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:43:46,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:43:46,396 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 00:43:46,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:43:46,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:43:46,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:43:46,428 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:43:46,428 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:43:46,429 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:43:46,429 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:43:46,429 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:43:46,429 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:43:46,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:43:46,429 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:43:46,429 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:43:46,429 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:43:46,429 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:43:46,429 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:43:46,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 00:43:46,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:43:46,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:43:46,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:43:46,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:43:46,430 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:43:46,430 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:43:46,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:43:46,430 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:43:46,430 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:43:46,430 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:43:46,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:43:46,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:43:46,430 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:43:46,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:43:46,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:43:46,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:43:46,430 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:43:46,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:43:46,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 00:43:46,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 00:43:46,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:43:46,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:43:46,431 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:43:46,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:43:46,431 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 -> d7483f4c602f1d80c3d31837b57d86164e65df5e6fa201344a2b0a8f22740044 [2025-02-06 00:43:46,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:43:46,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:43:46,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:43:46,686 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:43:46,687 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:43:46,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-20.i [2025-02-06 00:43:47,828 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/33786880f/102ed05aab3749e58ad30922a8009e1c/FLAGe6e55733a [2025-02-06 00:43:48,036 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:43:48,037 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-20.i [2025-02-06 00:43:48,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/33786880f/102ed05aab3749e58ad30922a8009e1c/FLAGe6e55733a [2025-02-06 00:43:48,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/33786880f/102ed05aab3749e58ad30922a8009e1c [2025-02-06 00:43:48,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:43:48,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:43:48,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:43:48,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:43:48,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:43:48,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:43:48" (1/1) ... [2025-02-06 00:43:48,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e614eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:48, skipping insertion in model container [2025-02-06 00:43:48,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:43:48" (1/1) ... [2025-02-06 00:43:48,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:43:48,515 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_loopvsstraightlinecode_100-1loop_file-20.i[916,929] [2025-02-06 00:43:48,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:43:48,608 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:43:48,619 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_loopvsstraightlinecode_100-1loop_file-20.i[916,929] [2025-02-06 00:43:48,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:43:48,666 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:43:48,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:48 WrapperNode [2025-02-06 00:43:48,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:43:48,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:43:48,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:43:48,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:43:48,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:48" (1/1) ... [2025-02-06 00:43:48,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:48" (1/1) ... [2025-02-06 00:43:48,712 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 263 [2025-02-06 00:43:48,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:43:48,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:43:48,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:43:48,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:43:48,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:48" (1/1) ... [2025-02-06 00:43:48,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:48" (1/1) ... [2025-02-06 00:43:48,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:48" (1/1) ... [2025-02-06 00:43:48,734 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 00:43:48,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:48" (1/1) ... [2025-02-06 00:43:48,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:48" (1/1) ... [2025-02-06 00:43:48,742 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:48" (1/1) ... [2025-02-06 00:43:48,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:48" (1/1) ... [2025-02-06 00:43:48,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:48" (1/1) ... [2025-02-06 00:43:48,746 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:48" (1/1) ... [2025-02-06 00:43:48,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:43:48,754 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:43:48,754 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:43:48,754 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:43:48,754 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:48" (1/1) ... [2025-02-06 00:43:48,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:43:48,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:43:48,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 00:43:48,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 00:43:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:43:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:43:48,793 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:43:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 00:43:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:43:48,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:43:48,849 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:43:48,851 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:43:49,155 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L199: havoc property_#t~bitwise23#1;havoc property_#t~short24#1;havoc property_#t~ite27#1;havoc property_#t~ite26#1;havoc property_#t~bitwise25#1;havoc property_#t~short28#1; [2025-02-06 00:43:49,188 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-02-06 00:43:49,188 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:43:49,201 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:43:49,201 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 00:43:49,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:43:49 BoogieIcfgContainer [2025-02-06 00:43:49,202 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:43:49,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:43:49,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:43:49,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:43:49,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:43:48" (1/3) ... [2025-02-06 00:43:49,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0f9b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:43:49, skipping insertion in model container [2025-02-06 00:43:49,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:43:48" (2/3) ... [2025-02-06 00:43:49,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0f9b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:43:49, skipping insertion in model container [2025-02-06 00:43:49,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:43:49" (3/3) ... [2025-02-06 00:43:49,209 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-20.i [2025-02-06 00:43:49,220 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:43:49,221 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-20.i that has 2 procedures, 115 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:43:49,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:43:49,288 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;@4e7cda1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:43:49,288 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:43:49,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-06 00:43:49,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-06 00:43:49,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:43:49,300 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:43:49,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:43:49,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:43:49,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1272848649, now seen corresponding path program 1 times [2025-02-06 00:43:49,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:43:49,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140379151] [2025-02-06 00:43:49,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:43:49,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:43:49,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-06 00:43:49,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-06 00:43:49,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:43:49,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:43:49,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-02-06 00:43:49,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:43:49,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140379151] [2025-02-06 00:43:49,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140379151] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:43:49,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418240793] [2025-02-06 00:43:49,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:43:49,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:43:49,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:43:49,535 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:43:49,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 00:43:49,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-06 00:43:49,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-06 00:43:49,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:43:49,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:43:49,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:43:49,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:43:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-02-06 00:43:49,733 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:43:49,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418240793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:43:49,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 00:43:49,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 00:43:49,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804128560] [2025-02-06 00:43:49,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:43:49,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:43:49,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:43:49,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:43:49,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:43:49,754 INFO L87 Difference]: Start difference. First operand has 115 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-06 00:43:49,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:43:49,788 INFO L93 Difference]: Finished difference Result 227 states and 384 transitions. [2025-02-06 00:43:49,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:43:49,789 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 204 [2025-02-06 00:43:49,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:43:49,794 INFO L225 Difference]: With dead ends: 227 [2025-02-06 00:43:49,795 INFO L226 Difference]: Without dead ends: 112 [2025-02-06 00:43:49,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:43:49,801 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:43:49,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:43:49,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-06 00:43:49,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-06 00:43:49,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-06 00:43:49,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2025-02-06 00:43:49,830 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 204 [2025-02-06 00:43:49,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:43:49,830 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2025-02-06 00:43:49,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-06 00:43:49,831 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2025-02-06 00:43:49,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-06 00:43:49,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:43:49,833 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:43:49,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 00:43:50,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 00:43:50,034 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:43:50,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:43:50,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1694400884, now seen corresponding path program 1 times [2025-02-06 00:43:50,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:43:50,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354325740] [2025-02-06 00:43:50,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:43:50,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:43:50,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-06 00:43:50,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-06 00:43:50,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:43:50,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:43:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 00:43:50,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:43:50,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354325740] [2025-02-06 00:43:50,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354325740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:43:50,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:43:50,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 00:43:50,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498974485] [2025-02-06 00:43:50,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:43:50,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:43:50,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:43:50,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:43:50,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:43:50,545 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:43:50,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:43:50,775 INFO L93 Difference]: Finished difference Result 364 states and 565 transitions. [2025-02-06 00:43:50,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:43:50,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2025-02-06 00:43:50,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:43:50,779 INFO L225 Difference]: With dead ends: 364 [2025-02-06 00:43:50,781 INFO L226 Difference]: Without dead ends: 255 [2025-02-06 00:43:50,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:43:50,782 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 168 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:43:50,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 514 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 00:43:50,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-02-06 00:43:50,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 244. [2025-02-06 00:43:50,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 179 states have internal predecessors, (251), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-06 00:43:50,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 375 transitions. [2025-02-06 00:43:50,817 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 375 transitions. Word has length 204 [2025-02-06 00:43:50,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:43:50,818 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 375 transitions. [2025-02-06 00:43:50,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:43:50,818 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 375 transitions. [2025-02-06 00:43:50,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-06 00:43:50,823 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:43:50,824 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:43:50,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 00:43:50,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:43:50,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:43:50,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1361276800, now seen corresponding path program 1 times [2025-02-06 00:43:50,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:43:50,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969557827] [2025-02-06 00:43:50,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:43:50,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:43:50,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-06 00:43:50,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-06 00:43:50,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:43:50,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:43:52,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 00:43:52,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:43:52,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969557827] [2025-02-06 00:43:52,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969557827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:43:52,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:43:52,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 00:43:52,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881933623] [2025-02-06 00:43:52,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:43:52,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 00:43:52,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:43:52,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 00:43:52,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-06 00:43:52,287 INFO L87 Difference]: Start difference. First operand 244 states and 375 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:43:53,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:43:53,469 INFO L93 Difference]: Finished difference Result 1020 states and 1525 transitions. [2025-02-06 00:43:53,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 00:43:53,470 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-02-06 00:43:53,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:43:53,478 INFO L225 Difference]: With dead ends: 1020 [2025-02-06 00:43:53,478 INFO L226 Difference]: Without dead ends: 779 [2025-02-06 00:43:53,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2025-02-06 00:43:53,479 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 762 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 00:43:53,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 526 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 00:43:53,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2025-02-06 00:43:53,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 359. [2025-02-06 00:43:53,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 284 states have (on average 1.4330985915492958) internal successors, (407), 286 states have internal predecessors, (407), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-06 00:43:53,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 547 transitions. [2025-02-06 00:43:53,532 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 547 transitions. Word has length 205 [2025-02-06 00:43:53,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:43:53,533 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 547 transitions. [2025-02-06 00:43:53,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:43:53,533 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 547 transitions. [2025-02-06 00:43:53,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-06 00:43:53,535 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:43:53,535 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:43:53,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 00:43:53,536 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:43:53,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:43:53,536 INFO L85 PathProgramCache]: Analyzing trace with hash 855718175, now seen corresponding path program 1 times [2025-02-06 00:43:53,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:43:53,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375609538] [2025-02-06 00:43:53,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:43:53,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:43:53,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-06 00:43:53,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-06 00:43:53,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:43:53,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:43:53,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 00:43:53,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:43:53,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375609538] [2025-02-06 00:43:53,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375609538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:43:53,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:43:53,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 00:43:53,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231061331] [2025-02-06 00:43:53,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:43:53,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:43:53,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:43:53,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:43:53,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:43:53,757 INFO L87 Difference]: Start difference. First operand 359 states and 547 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:43:53,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:43:53,972 INFO L93 Difference]: Finished difference Result 967 states and 1471 transitions. [2025-02-06 00:43:53,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:43:53,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-02-06 00:43:53,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:43:53,979 INFO L225 Difference]: With dead ends: 967 [2025-02-06 00:43:53,981 INFO L226 Difference]: Without dead ends: 618 [2025-02-06 00:43:53,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:43:53,983 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 142 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:43:53,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 640 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 00:43:53,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2025-02-06 00:43:54,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 483. [2025-02-06 00:43:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 375 states have (on average 1.4266666666666667) internal successors, (535), 378 states have internal predecessors, (535), 101 states have call successors, (101), 6 states have call predecessors, (101), 6 states have return successors, (101), 98 states have call predecessors, (101), 101 states have call successors, (101) [2025-02-06 00:43:54,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 737 transitions. [2025-02-06 00:43:54,054 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 737 transitions. Word has length 205 [2025-02-06 00:43:54,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:43:54,055 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 737 transitions. [2025-02-06 00:43:54,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:43:54,055 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 737 transitions. [2025-02-06 00:43:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-06 00:43:54,058 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:43:54,058 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:43:54,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 00:43:54,058 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:43:54,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:43:54,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1217102130, now seen corresponding path program 1 times [2025-02-06 00:43:54,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:43:54,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324766830] [2025-02-06 00:43:54,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:43:54,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:43:54,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-06 00:43:54,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-06 00:43:54,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:43:54,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:43:54,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 00:43:54,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:43:54,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324766830] [2025-02-06 00:43:54,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324766830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:43:54,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:43:54,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 00:43:54,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702088057] [2025-02-06 00:43:54,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:43:54,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 00:43:54,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:43:54,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 00:43:54,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 00:43:54,377 INFO L87 Difference]: Start difference. First operand 483 states and 737 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:43:54,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:43:54,955 INFO L93 Difference]: Finished difference Result 1271 states and 1920 transitions. [2025-02-06 00:43:54,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 00:43:54,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-02-06 00:43:54,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:43:54,962 INFO L225 Difference]: With dead ends: 1271 [2025-02-06 00:43:54,962 INFO L226 Difference]: Without dead ends: 798 [2025-02-06 00:43:54,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 00:43:54,967 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 241 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 00:43:54,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 658 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 00:43:54,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-02-06 00:43:55,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 683. [2025-02-06 00:43:55,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 555 states have (on average 1.4198198198198198) internal successors, (788), 561 states have internal predecessors, (788), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-06 00:43:55,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1022 transitions. [2025-02-06 00:43:55,036 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1022 transitions. Word has length 206 [2025-02-06 00:43:55,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:43:55,037 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 1022 transitions. [2025-02-06 00:43:55,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:43:55,037 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1022 transitions. [2025-02-06 00:43:55,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-06 00:43:55,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:43:55,039 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:43:55,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 00:43:55,039 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:43:55,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:43:55,040 INFO L85 PathProgramCache]: Analyzing trace with hash 27662351, now seen corresponding path program 1 times [2025-02-06 00:43:55,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:43:55,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569216324] [2025-02-06 00:43:55,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:43:55,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:43:55,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-06 00:43:55,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-06 00:43:55,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:43:55,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:44:00,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 00:44:00,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:44:00,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569216324] [2025-02-06 00:44:00,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569216324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:44:00,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:44:00,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 00:44:00,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839184538] [2025-02-06 00:44:00,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:44:00,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 00:44:00,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:44:00,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 00:44:00,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-02-06 00:44:00,080 INFO L87 Difference]: Start difference. First operand 683 states and 1022 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:44:02,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:44:02,811 INFO L93 Difference]: Finished difference Result 1951 states and 2897 transitions. [2025-02-06 00:44:02,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 00:44:02,812 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-02-06 00:44:02,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:44:02,818 INFO L225 Difference]: With dead ends: 1951 [2025-02-06 00:44:02,818 INFO L226 Difference]: Without dead ends: 1278 [2025-02-06 00:44:02,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2025-02-06 00:44:02,822 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 709 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:44:02,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 997 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-06 00:44:02,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2025-02-06 00:44:02,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 859. [2025-02-06 00:44:02,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 731 states have (on average 1.4172366621067032) internal successors, (1036), 737 states have internal predecessors, (1036), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-06 00:44:02,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1270 transitions. [2025-02-06 00:44:02,877 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1270 transitions. Word has length 206 [2025-02-06 00:44:02,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:44:02,877 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1270 transitions. [2025-02-06 00:44:02,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:44:02,880 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1270 transitions. [2025-02-06 00:44:02,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-06 00:44:02,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:44:02,881 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:44:02,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 00:44:02,882 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:44:02,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:44:02,882 INFO L85 PathProgramCache]: Analyzing trace with hash -477896274, now seen corresponding path program 1 times [2025-02-06 00:44:02,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:44:02,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56607740] [2025-02-06 00:44:02,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:44:02,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:44:02,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-06 00:44:02,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-06 00:44:02,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:44:02,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:44:03,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 00:44:03,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:44:03,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56607740] [2025-02-06 00:44:03,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56607740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:44:03,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:44:03,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 00:44:03,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666781525] [2025-02-06 00:44:03,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:44:03,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 00:44:03,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:44:03,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 00:44:03,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-06 00:44:03,908 INFO L87 Difference]: Start difference. First operand 859 states and 1270 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:44:04,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:44:04,952 INFO L93 Difference]: Finished difference Result 1865 states and 2764 transitions. [2025-02-06 00:44:04,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 00:44:04,954 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-02-06 00:44:04,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:44:04,961 INFO L225 Difference]: With dead ends: 1865 [2025-02-06 00:44:04,961 INFO L226 Difference]: Without dead ends: 1380 [2025-02-06 00:44:04,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2025-02-06 00:44:04,963 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 360 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 00:44:04,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 982 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 00:44:04,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2025-02-06 00:44:05,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1054. [2025-02-06 00:44:05,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 926 states have (on average 1.4038876889848813) internal successors, (1300), 932 states have internal predecessors, (1300), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-06 00:44:05,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1534 transitions. [2025-02-06 00:44:05,016 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1534 transitions. Word has length 206 [2025-02-06 00:44:05,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:44:05,016 INFO L471 AbstractCegarLoop]: Abstraction has 1054 states and 1534 transitions. [2025-02-06 00:44:05,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:44:05,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1534 transitions. [2025-02-06 00:44:05,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-06 00:44:05,022 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:44:05,022 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:44:05,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 00:44:05,022 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:44:05,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:44:05,023 INFO L85 PathProgramCache]: Analyzing trace with hash -881738948, now seen corresponding path program 1 times [2025-02-06 00:44:05,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:44:05,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208755053] [2025-02-06 00:44:05,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:44:05,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:44:05,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-06 00:44:05,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-06 00:44:05,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:44:05,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:44:07,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 00:44:07,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:44:07,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208755053] [2025-02-06 00:44:07,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208755053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:44:07,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:44:07,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 00:44:07,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875225911] [2025-02-06 00:44:07,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:44:07,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 00:44:07,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:44:07,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 00:44:07,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-02-06 00:44:07,602 INFO L87 Difference]: Start difference. First operand 1054 states and 1534 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:44:10,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:44:10,184 INFO L93 Difference]: Finished difference Result 2452 states and 3543 transitions. [2025-02-06 00:44:10,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 00:44:10,184 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-02-06 00:44:10,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:44:10,198 INFO L225 Difference]: With dead ends: 2452 [2025-02-06 00:44:10,198 INFO L226 Difference]: Without dead ends: 1408 [2025-02-06 00:44:10,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2025-02-06 00:44:10,205 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 669 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 00:44:10,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 721 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 00:44:10,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2025-02-06 00:44:10,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1109. [2025-02-06 00:44:10,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 981 states have (on average 1.4097859327217126) internal successors, (1383), 987 states have internal predecessors, (1383), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-06 00:44:10,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1617 transitions. [2025-02-06 00:44:10,249 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1617 transitions. Word has length 206 [2025-02-06 00:44:10,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:44:10,249 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1617 transitions. [2025-02-06 00:44:10,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:44:10,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1617 transitions. [2025-02-06 00:44:10,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-06 00:44:10,251 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:44:10,252 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:44:10,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 00:44:10,252 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:44:10,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:44:10,252 INFO L85 PathProgramCache]: Analyzing trace with hash 625812861, now seen corresponding path program 1 times [2025-02-06 00:44:10,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:44:10,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059526267] [2025-02-06 00:44:10,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:44:10,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:44:10,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-06 00:44:10,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-06 00:44:10,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:44:10,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:44:11,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 00:44:11,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:44:11,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059526267] [2025-02-06 00:44:11,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059526267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:44:11,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:44:11,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 00:44:11,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608170722] [2025-02-06 00:44:11,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:44:11,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 00:44:11,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:44:11,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 00:44:11,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-02-06 00:44:11,056 INFO L87 Difference]: Start difference. First operand 1109 states and 1617 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:44:11,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:44:11,623 INFO L93 Difference]: Finished difference Result 2832 states and 4137 transitions. [2025-02-06 00:44:11,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 00:44:11,623 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-02-06 00:44:11,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:44:11,629 INFO L225 Difference]: With dead ends: 2832 [2025-02-06 00:44:11,629 INFO L226 Difference]: Without dead ends: 1733 [2025-02-06 00:44:11,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-02-06 00:44:11,631 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 237 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 00:44:11,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 591 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 00:44:11,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2025-02-06 00:44:11,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1250. [2025-02-06 00:44:11,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1122 states have (on average 1.4376114081996434) internal successors, (1613), 1128 states have internal predecessors, (1613), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-06 00:44:11,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1847 transitions. [2025-02-06 00:44:11,674 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1847 transitions. Word has length 206 [2025-02-06 00:44:11,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:44:11,674 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1847 transitions. [2025-02-06 00:44:11,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:44:11,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1847 transitions. [2025-02-06 00:44:11,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-06 00:44:11,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:44:11,676 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:44:11,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 00:44:11,676 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:44:11,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:44:11,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1726210819, now seen corresponding path program 1 times [2025-02-06 00:44:11,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:44:11,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852182895] [2025-02-06 00:44:11,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:44:11,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:44:11,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-06 00:44:11,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-06 00:44:11,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:44:11,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:44:12,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 00:44:12,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:44:12,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852182895] [2025-02-06 00:44:12,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852182895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:44:12,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:44:12,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 00:44:12,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208705761] [2025-02-06 00:44:12,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:44:12,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 00:44:12,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:44:12,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 00:44:12,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-02-06 00:44:12,832 INFO L87 Difference]: Start difference. First operand 1250 states and 1847 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:44:13,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:44:13,864 INFO L93 Difference]: Finished difference Result 2836 states and 4172 transitions. [2025-02-06 00:44:13,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 00:44:13,865 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-02-06 00:44:13,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:44:13,870 INFO L225 Difference]: With dead ends: 2836 [2025-02-06 00:44:13,870 INFO L226 Difference]: Without dead ends: 1596 [2025-02-06 00:44:13,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-02-06 00:44:13,872 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 328 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 00:44:13,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 519 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 00:44:13,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2025-02-06 00:44:13,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1265. [2025-02-06 00:44:13,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1137 states have (on average 1.4388742304309587) internal successors, (1636), 1143 states have internal predecessors, (1636), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-06 00:44:13,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1870 transitions. [2025-02-06 00:44:13,930 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1870 transitions. Word has length 206 [2025-02-06 00:44:13,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:44:13,931 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1870 transitions. [2025-02-06 00:44:13,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:44:13,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1870 transitions. [2025-02-06 00:44:13,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-06 00:44:13,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:44:13,933 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:44:13,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 00:44:13,933 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:44:13,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:44:13,933 INFO L85 PathProgramCache]: Analyzing trace with hash -218659010, now seen corresponding path program 1 times [2025-02-06 00:44:13,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:44:13,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29270059] [2025-02-06 00:44:13,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:44:13,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:44:13,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-06 00:44:13,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-06 00:44:13,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:44:13,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:44:14,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 00:44:14,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:44:14,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29270059] [2025-02-06 00:44:14,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29270059] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:44:14,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:44:14,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 00:44:14,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297786013] [2025-02-06 00:44:14,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:44:14,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 00:44:14,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:44:14,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 00:44:14,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 00:44:14,638 INFO L87 Difference]: Start difference. First operand 1265 states and 1870 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:44:15,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:44:15,965 INFO L93 Difference]: Finished difference Result 3019 states and 4451 transitions. [2025-02-06 00:44:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 00:44:15,966 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-02-06 00:44:15,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:44:15,972 INFO L225 Difference]: With dead ends: 3019 [2025-02-06 00:44:15,972 INFO L226 Difference]: Without dead ends: 1764 [2025-02-06 00:44:15,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-02-06 00:44:15,980 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 254 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:44:15,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 888 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 00:44:15,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2025-02-06 00:44:16,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1233. [2025-02-06 00:44:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 1105 states have (on average 1.4343891402714932) internal successors, (1585), 1111 states have internal predecessors, (1585), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-06 00:44:16,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1819 transitions. [2025-02-06 00:44:16,030 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1819 transitions. Word has length 206 [2025-02-06 00:44:16,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:44:16,031 INFO L471 AbstractCegarLoop]: Abstraction has 1233 states and 1819 transitions. [2025-02-06 00:44:16,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:44:16,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1819 transitions. [2025-02-06 00:44:16,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-02-06 00:44:16,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:44:16,033 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:44:16,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 00:44:16,034 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:44:16,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:44:16,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1616175650, now seen corresponding path program 1 times [2025-02-06 00:44:16,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:44:16,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590646622] [2025-02-06 00:44:16,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:44:16,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:44:16,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-06 00:44:16,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-06 00:44:16,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:44:16,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:44:16,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 00:44:16,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:44:16,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590646622] [2025-02-06 00:44:16,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590646622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:44:16,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:44:16,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 00:44:16,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475571743] [2025-02-06 00:44:16,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:44:16,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 00:44:16,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:44:16,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 00:44:16,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:44:16,269 INFO L87 Difference]: Start difference. First operand 1233 states and 1819 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:44:16,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:44:16,562 INFO L93 Difference]: Finished difference Result 2575 states and 3784 transitions. [2025-02-06 00:44:16,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 00:44:16,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2025-02-06 00:44:16,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:44:16,568 INFO L225 Difference]: With dead ends: 2575 [2025-02-06 00:44:16,568 INFO L226 Difference]: Without dead ends: 1352 [2025-02-06 00:44:16,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 00:44:16,571 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 169 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:44:16,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 539 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 00:44:16,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2025-02-06 00:44:16,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1151. [2025-02-06 00:44:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 1060 states have (on average 1.4433962264150944) internal successors, (1530), 1064 states have internal predecessors, (1530), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 00:44:16,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1694 transitions. [2025-02-06 00:44:16,611 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1694 transitions. Word has length 207 [2025-02-06 00:44:16,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:44:16,612 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1694 transitions. [2025-02-06 00:44:16,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:44:16,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1694 transitions. [2025-02-06 00:44:16,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-02-06 00:44:16,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:44:16,613 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:44:16,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 00:44:16,613 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:44:16,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:44:16,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1143825369, now seen corresponding path program 1 times [2025-02-06 00:44:16,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:44:16,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776669343] [2025-02-06 00:44:16,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:44:16,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:44:16,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-06 00:44:16,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-06 00:44:16,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:44:16,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:44:17,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 00:44:17,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:44:17,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776669343] [2025-02-06 00:44:17,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776669343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:44:17,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:44:17,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 00:44:17,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284882741] [2025-02-06 00:44:17,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:44:17,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 00:44:17,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:44:17,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 00:44:17,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-06 00:44:17,821 INFO L87 Difference]: Start difference. First operand 1151 states and 1694 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:44:19,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:44:19,334 INFO L93 Difference]: Finished difference Result 2345 states and 3466 transitions. [2025-02-06 00:44:19,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 00:44:19,335 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-02-06 00:44:19,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:44:19,340 INFO L225 Difference]: With dead ends: 2345 [2025-02-06 00:44:19,340 INFO L226 Difference]: Without dead ends: 1619 [2025-02-06 00:44:19,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-02-06 00:44:19,342 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 540 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:44:19,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 1283 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 00:44:19,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2025-02-06 00:44:19,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1167. [2025-02-06 00:44:19,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 1076 states have (on average 1.4433085501858736) internal successors, (1553), 1080 states have internal predecessors, (1553), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 00:44:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1717 transitions. [2025-02-06 00:44:19,397 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1717 transitions. Word has length 208 [2025-02-06 00:44:19,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:44:19,398 INFO L471 AbstractCegarLoop]: Abstraction has 1167 states and 1717 transitions. [2025-02-06 00:44:19,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:44:19,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1717 transitions. [2025-02-06 00:44:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-02-06 00:44:19,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:44:19,400 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:44:19,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 00:44:19,400 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:44:19,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:44:19,401 INFO L85 PathProgramCache]: Analyzing trace with hash 638266744, now seen corresponding path program 1 times [2025-02-06 00:44:19,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:44:19,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817526839] [2025-02-06 00:44:19,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:44:19,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:44:19,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-06 00:44:19,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-06 00:44:19,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:44:19,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:44:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 00:44:20,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:44:20,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817526839] [2025-02-06 00:44:20,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817526839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:44:20,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:44:20,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 00:44:20,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577120532] [2025-02-06 00:44:20,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:44:20,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 00:44:20,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:44:20,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 00:44:20,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-06 00:44:20,443 INFO L87 Difference]: Start difference. First operand 1167 states and 1717 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:44:21,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:44:21,478 INFO L93 Difference]: Finished difference Result 2935 states and 4330 transitions. [2025-02-06 00:44:21,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 00:44:21,479 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-02-06 00:44:21,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:44:21,485 INFO L225 Difference]: With dead ends: 2935 [2025-02-06 00:44:21,485 INFO L226 Difference]: Without dead ends: 1771 [2025-02-06 00:44:21,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-02-06 00:44:21,487 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 219 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 00:44:21,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 710 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 00:44:21,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2025-02-06 00:44:21,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1287. [2025-02-06 00:44:21,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1196 states have (on average 1.4473244147157192) internal successors, (1731), 1200 states have internal predecessors, (1731), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 00:44:21,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1895 transitions. [2025-02-06 00:44:21,525 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1895 transitions. Word has length 208 [2025-02-06 00:44:21,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:44:21,526 INFO L471 AbstractCegarLoop]: Abstraction has 1287 states and 1895 transitions. [2025-02-06 00:44:21,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:44:21,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1895 transitions. [2025-02-06 00:44:21,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-02-06 00:44:21,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:44:21,527 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:44:21,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 00:44:21,527 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:44:21,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:44:21,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1693606673, now seen corresponding path program 1 times [2025-02-06 00:44:21,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:44:21,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944705044] [2025-02-06 00:44:21,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:44:21,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:44:21,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-06 00:44:21,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-06 00:44:21,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:44:21,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:44:22,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 00:44:22,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:44:22,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944705044] [2025-02-06 00:44:22,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944705044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:44:22,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:44:22,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 00:44:22,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895174981] [2025-02-06 00:44:22,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:44:22,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 00:44:22,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:44:22,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 00:44:22,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 00:44:22,779 INFO L87 Difference]: Start difference. First operand 1287 states and 1895 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:44:23,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:44:23,977 INFO L93 Difference]: Finished difference Result 3411 states and 4955 transitions. [2025-02-06 00:44:23,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 00:44:23,977 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-02-06 00:44:23,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:44:23,983 INFO L225 Difference]: With dead ends: 3411 [2025-02-06 00:44:23,984 INFO L226 Difference]: Without dead ends: 2127 [2025-02-06 00:44:23,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2025-02-06 00:44:23,986 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 366 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:44:23,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 601 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 00:44:23,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2025-02-06 00:44:24,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1384. [2025-02-06 00:44:24,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1293 states have (on average 1.4593967517401392) internal successors, (1887), 1297 states have internal predecessors, (1887), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 00:44:24,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2051 transitions. [2025-02-06 00:44:24,028 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2051 transitions. Word has length 208 [2025-02-06 00:44:24,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:44:24,028 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2051 transitions. [2025-02-06 00:44:24,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:44:24,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2051 transitions. [2025-02-06 00:44:24,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-02-06 00:44:24,029 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:44:24,029 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:44:24,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 00:44:24,030 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:44:24,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:44:24,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1188048048, now seen corresponding path program 1 times [2025-02-06 00:44:24,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:44:24,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761799754] [2025-02-06 00:44:24,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:44:24,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:44:24,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-06 00:44:24,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-06 00:44:24,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:44:24,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:44:25,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 00:44:25,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:44:25,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761799754] [2025-02-06 00:44:25,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761799754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:44:25,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:44:25,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 00:44:25,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681073687] [2025-02-06 00:44:25,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:44:25,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 00:44:25,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:44:25,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 00:44:25,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 00:44:25,747 INFO L87 Difference]: Start difference. First operand 1384 states and 2051 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:44:27,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:44:27,660 INFO L93 Difference]: Finished difference Result 3750 states and 5489 transitions. [2025-02-06 00:44:27,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 00:44:27,661 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-02-06 00:44:27,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:44:27,669 INFO L225 Difference]: With dead ends: 3750 [2025-02-06 00:44:27,670 INFO L226 Difference]: Without dead ends: 2369 [2025-02-06 00:44:27,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2025-02-06 00:44:27,674 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 401 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 00:44:27,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 804 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 00:44:27,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2025-02-06 00:44:27,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1394. [2025-02-06 00:44:27,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1303 states have (on average 1.4597083653108212) internal successors, (1902), 1307 states have internal predecessors, (1902), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 00:44:27,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2066 transitions. [2025-02-06 00:44:27,741 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2066 transitions. Word has length 208 [2025-02-06 00:44:27,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:44:27,742 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 2066 transitions. [2025-02-06 00:44:27,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 00:44:27,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2066 transitions. [2025-02-06 00:44:27,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-02-06 00:44:27,744 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:44:27,744 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:44:27,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 00:44:27,745 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:44:27,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:44:27,745 INFO L85 PathProgramCache]: Analyzing trace with hash 677513871, now seen corresponding path program 1 times [2025-02-06 00:44:27,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:44:27,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530325577] [2025-02-06 00:44:27,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:44:27,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:44:27,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-06 00:44:27,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-06 00:44:27,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:44:27,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:44:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 00:44:28,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:44:28,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530325577] [2025-02-06 00:44:28,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530325577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:44:28,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:44:28,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 00:44:28,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801423303] [2025-02-06 00:44:28,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:44:28,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 00:44:28,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:44:28,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 00:44:28,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 00:44:28,233 INFO L87 Difference]: Start difference. First operand 1394 states and 2066 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-02-06 00:44:29,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:44:29,081 INFO L93 Difference]: Finished difference Result 4648 states and 6827 transitions. [2025-02-06 00:44:29,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 00:44:29,082 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 208 [2025-02-06 00:44:29,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:44:29,090 INFO L225 Difference]: With dead ends: 4648 [2025-02-06 00:44:29,090 INFO L226 Difference]: Without dead ends: 3257 [2025-02-06 00:44:29,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2025-02-06 00:44:29,092 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 743 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 00:44:29,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 825 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 00:44:29,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3257 states. [2025-02-06 00:44:29,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3257 to 2577. [2025-02-06 00:44:29,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2577 states, 2396 states have (on average 1.4574290484140233) internal successors, (3492), 2404 states have internal predecessors, (3492), 164 states have call successors, (164), 16 states have call predecessors, (164), 16 states have return successors, (164), 156 states have call predecessors, (164), 164 states have call successors, (164) [2025-02-06 00:44:29,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2577 states to 2577 states and 3820 transitions. [2025-02-06 00:44:29,170 INFO L78 Accepts]: Start accepts. Automaton has 2577 states and 3820 transitions. Word has length 208 [2025-02-06 00:44:29,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:44:29,170 INFO L471 AbstractCegarLoop]: Abstraction has 2577 states and 3820 transitions. [2025-02-06 00:44:29,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-02-06 00:44:29,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2577 states and 3820 transitions. [2025-02-06 00:44:29,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-02-06 00:44:29,172 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:44:29,172 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:44:29,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 00:44:29,172 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:44:29,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:44:29,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1946279994, now seen corresponding path program 1 times [2025-02-06 00:44:29,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:44:29,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877711800] [2025-02-06 00:44:29,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:44:29,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:44:29,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-06 00:44:29,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-06 00:44:29,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:44:29,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:44:29,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-02-06 00:44:29,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:44:29,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877711800] [2025-02-06 00:44:29,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877711800] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:44:29,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113986014] [2025-02-06 00:44:29,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:44:29,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:44:29,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:44:29,391 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:44:29,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 00:44:29,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-06 00:44:29,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-06 00:44:29,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:44:29,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:44:29,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 00:44:29,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:44:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 872 proven. 114 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2025-02-06 00:44:29,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:44:30,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113986014] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:44:30,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 00:44:30,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2025-02-06 00:44:30,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838550513] [2025-02-06 00:44:30,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 00:44:30,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 00:44:30,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:44:30,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 00:44:30,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-06 00:44:30,225 INFO L87 Difference]: Start difference. First operand 2577 states and 3820 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (51), 3 states have call predecessors, (51), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-02-06 00:44:31,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:44:31,245 INFO L93 Difference]: Finished difference Result 4842 states and 7092 transitions. [2025-02-06 00:44:31,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 00:44:31,246 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (51), 3 states have call predecessors, (51), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 208 [2025-02-06 00:44:31,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:44:31,267 INFO L225 Difference]: With dead ends: 4842 [2025-02-06 00:44:31,267 INFO L226 Difference]: Without dead ends: 2268 [2025-02-06 00:44:31,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2025-02-06 00:44:31,271 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 291 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 00:44:31,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 620 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 00:44:31,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2025-02-06 00:44:31,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 2213. [2025-02-06 00:44:31,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2213 states, 1985 states have (on average 1.4141057934508816) internal successors, (2807), 1994 states have internal predecessors, (2807), 195 states have call successors, (195), 32 states have call predecessors, (195), 32 states have return successors, (195), 186 states have call predecessors, (195), 195 states have call successors, (195) [2025-02-06 00:44:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 3197 transitions. [2025-02-06 00:44:31,400 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 3197 transitions. Word has length 208 [2025-02-06 00:44:31,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:44:31,401 INFO L471 AbstractCegarLoop]: Abstraction has 2213 states and 3197 transitions. [2025-02-06 00:44:31,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (51), 3 states have call predecessors, (51), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-02-06 00:44:31,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 3197 transitions. [2025-02-06 00:44:31,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-02-06 00:44:31,402 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:44:31,402 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:44:31,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 00:44:31,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 00:44:31,603 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:44:31,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:44:31,604 INFO L85 PathProgramCache]: Analyzing trace with hash -78979673, now seen corresponding path program 1 times [2025-02-06 00:44:31,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:44:31,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314400145] [2025-02-06 00:44:31,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:44:31,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:44:31,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-06 00:44:31,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-06 00:44:31,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:44:31,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat