./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-55.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 76c41dcfd5a0fc565e04810ec1e9f02e7d99352e7ba5541d180a675862fbcc19 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:59:11,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:59:11,133 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:59:11,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:59:11,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:59:11,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:59:11,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:59:11,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:59:11,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:59:11,156 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:59:11,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:59:11,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:59:11,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:59:11,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:59:11,156 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:59:11,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:59:11,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:59:11,156 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:59:11,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:59:11,156 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:59:11,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:59:11,156 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:59:11,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:59:11,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:59:11,157 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:59:11,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:59:11,157 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:59:11,157 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:59:11,157 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:59:11,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:59:11,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:59:11,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:59:11,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:59:11,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:59:11,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:59:11,157 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:59:11,157 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:59:11,157 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:59:11,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:59:11,157 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:59:11,157 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:59:11,157 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:59:11,157 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:59:11,158 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 -> 76c41dcfd5a0fc565e04810ec1e9f02e7d99352e7ba5541d180a675862fbcc19 [2025-02-05 21:59:11,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:59:11,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:59:11,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:59:11,363 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:59:11,363 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:59:11,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-55.i [2025-02-05 21:59:12,502 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/efcbe304c/c114c498f7cd4e1f95f5c9e1a6f8d3d3/FLAGf70fad910 [2025-02-05 21:59:12,860 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:59:12,860 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-55.i [2025-02-05 21:59:12,875 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/efcbe304c/c114c498f7cd4e1f95f5c9e1a6f8d3d3/FLAGf70fad910 [2025-02-05 21:59:13,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/efcbe304c/c114c498f7cd4e1f95f5c9e1a6f8d3d3 [2025-02-05 21:59:13,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:59:13,080 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:59:13,081 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:59:13,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:59:13,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:59:13,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:59:13" (1/1) ... [2025-02-05 21:59:13,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13e1122e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:13, skipping insertion in model container [2025-02-05 21:59:13,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:59:13" (1/1) ... [2025-02-05 21:59:13,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:59:13,205 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-55.i[916,929] [2025-02-05 21:59:13,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:59:13,391 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:59:13,402 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-55.i[916,929] [2025-02-05 21:59:13,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:59:13,489 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:59:13,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:13 WrapperNode [2025-02-05 21:59:13,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:59:13,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:59:13,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:59:13,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:59:13,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:13" (1/1) ... [2025-02-05 21:59:13,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:13" (1/1) ... [2025-02-05 21:59:13,563 INFO L138 Inliner]: procedures = 26, calls = 131, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 911 [2025-02-05 21:59:13,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:59:13,564 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:59:13,564 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:59:13,564 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:59:13,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:13" (1/1) ... [2025-02-05 21:59:13,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:13" (1/1) ... [2025-02-05 21:59:13,579 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:13" (1/1) ... [2025-02-05 21:59:13,609 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:59:13,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:13" (1/1) ... [2025-02-05 21:59:13,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:13" (1/1) ... [2025-02-05 21:59:13,644 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:13" (1/1) ... [2025-02-05 21:59:13,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:13" (1/1) ... [2025-02-05 21:59:13,657 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:13" (1/1) ... [2025-02-05 21:59:13,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:13" (1/1) ... [2025-02-05 21:59:13,673 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:59:13,675 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:59:13,675 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:59:13,675 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:59:13,676 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:13" (1/1) ... [2025-02-05 21:59:13,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:59:13,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:59:13,702 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:59:13,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:59:13,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:59:13,732 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:59:13,733 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:59:13,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:59:13,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:59:13,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:59:13,843 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:59:13,844 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:59:14,868 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-02-05 21:59:14,869 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:59:14,918 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:59:14,918 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-05 21:59:14,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:59:14 BoogieIcfgContainer [2025-02-05 21:59:14,918 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:59:14,919 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:59:14,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:59:14,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:59:14,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:59:13" (1/3) ... [2025-02-05 21:59:14,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4abf2a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:59:14, skipping insertion in model container [2025-02-05 21:59:14,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:13" (2/3) ... [2025-02-05 21:59:14,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4abf2a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:59:14, skipping insertion in model container [2025-02-05 21:59:14,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:59:14" (3/3) ... [2025-02-05 21:59:14,928 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-55.i [2025-02-05 21:59:14,939 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:59:14,942 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-55.i that has 2 procedures, 372 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:59:15,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:59:15,013 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;@49782898, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:59:15,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:59:15,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 372 states, 251 states have (on average 1.5776892430278884) internal successors, (396), 252 states have internal predecessors, (396), 118 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 118 states have call predecessors, (118), 118 states have call successors, (118) [2025-02-05 21:59:15,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2025-02-05 21:59:15,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:15,049 INFO L218 NwaCegarLoop]: trace histogram [118, 118, 118, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:59:15,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:15,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:15,053 INFO L85 PathProgramCache]: Analyzing trace with hash -2045841102, now seen corresponding path program 1 times [2025-02-05 21:59:15,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:15,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620485707] [2025-02-05 21:59:15,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:15,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:15,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 752 statements into 1 equivalence classes. [2025-02-05 21:59:15,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 752 of 752 statements. [2025-02-05 21:59:15,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:15,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 27612 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 27378 trivial. 0 not checked. [2025-02-05 21:59:15,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:15,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620485707] [2025-02-05 21:59:15,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620485707] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:59:15,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334347684] [2025-02-05 21:59:15,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:15,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:59:15,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:59:15,597 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:59:15,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:59:15,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 752 statements into 1 equivalence classes. [2025-02-05 21:59:15,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 752 of 752 statements. [2025-02-05 21:59:15,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:15,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:15,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 1725 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:59:16,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:59:16,071 INFO L134 CoverageAnalysis]: Checked inductivity of 27612 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 27378 trivial. 0 not checked. [2025-02-05 21:59:16,071 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:59:16,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334347684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:16,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:59:16,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:59:16,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333627488] [2025-02-05 21:59:16,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:16,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:59:16,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:16,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:59:16,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:59:16,093 INFO L87 Difference]: Start difference. First operand has 372 states, 251 states have (on average 1.5776892430278884) internal successors, (396), 252 states have internal predecessors, (396), 118 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 118 states have call predecessors, (118), 118 states have call successors, (118) Second operand has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 2 states have call successors, (118), 2 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 2 states have call successors, (118) [2025-02-05 21:59:16,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:16,158 INFO L93 Difference]: Finished difference Result 738 states and 1377 transitions. [2025-02-05 21:59:16,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:59:16,160 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 2 states have call successors, (118), 2 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 2 states have call successors, (118) Word has length 752 [2025-02-05 21:59:16,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:16,166 INFO L225 Difference]: With dead ends: 738 [2025-02-05 21:59:16,166 INFO L226 Difference]: Without dead ends: 369 [2025-02-05 21:59:16,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 753 GetRequests, 753 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:59:16,172 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:16,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:59:16,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-02-05 21:59:16,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2025-02-05 21:59:16,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 249 states have (on average 1.5502008032128514) internal successors, (386), 249 states have internal predecessors, (386), 118 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 118 states have call predecessors, (118), 118 states have call successors, (118) [2025-02-05 21:59:16,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 622 transitions. [2025-02-05 21:59:16,252 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 622 transitions. Word has length 752 [2025-02-05 21:59:16,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:16,253 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 622 transitions. [2025-02-05 21:59:16,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 2 states have call successors, (118), 2 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 2 states have call successors, (118) [2025-02-05 21:59:16,254 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 622 transitions. [2025-02-05 21:59:16,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 754 [2025-02-05 21:59:16,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:16,271 INFO L218 NwaCegarLoop]: trace histogram [118, 118, 118, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:59:16,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 21:59:16,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:59:16,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:16,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:16,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1536421504, now seen corresponding path program 1 times [2025-02-05 21:59:16,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:16,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970079672] [2025-02-05 21:59:16,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:16,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:16,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 753 statements into 1 equivalence classes. [2025-02-05 21:59:16,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 753 of 753 statements. [2025-02-05 21:59:16,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:16,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 27612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27612 trivial. 0 not checked. [2025-02-05 21:59:17,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:17,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970079672] [2025-02-05 21:59:17,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970079672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:17,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:17,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:17,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539664445] [2025-02-05 21:59:17,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:17,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:17,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:17,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:17,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:17,293 INFO L87 Difference]: Start difference. First operand 369 states and 622 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) [2025-02-05 21:59:17,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:17,393 INFO L93 Difference]: Finished difference Result 1101 states and 1860 transitions. [2025-02-05 21:59:17,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:17,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) Word has length 753 [2025-02-05 21:59:17,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:17,400 INFO L225 Difference]: With dead ends: 1101 [2025-02-05 21:59:17,400 INFO L226 Difference]: Without dead ends: 735 [2025-02-05 21:59:17,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:17,402 INFO L435 NwaCegarLoop]: 906 mSDtfsCounter, 616 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:17,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 1495 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:17,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-02-05 21:59:17,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 733. [2025-02-05 21:59:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 494 states have (on average 1.5526315789473684) internal successors, (767), 494 states have internal predecessors, (767), 236 states have call successors, (236), 2 states have call predecessors, (236), 2 states have return successors, (236), 236 states have call predecessors, (236), 236 states have call successors, (236) [2025-02-05 21:59:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1239 transitions. [2025-02-05 21:59:17,502 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1239 transitions. Word has length 753 [2025-02-05 21:59:17,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:17,503 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 1239 transitions. [2025-02-05 21:59:17,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) [2025-02-05 21:59:17,503 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1239 transitions. [2025-02-05 21:59:17,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 754 [2025-02-05 21:59:17,513 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:17,513 INFO L218 NwaCegarLoop]: trace histogram [118, 118, 118, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:59:17,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:59:17,513 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:17,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:17,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1788254785, now seen corresponding path program 1 times [2025-02-05 21:59:17,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:17,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639066682] [2025-02-05 21:59:17,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:17,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:17,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 753 statements into 1 equivalence classes. [2025-02-05 21:59:17,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 753 of 753 statements. [2025-02-05 21:59:17,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:17,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:17,840 INFO L134 CoverageAnalysis]: Checked inductivity of 27612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27612 trivial. 0 not checked. [2025-02-05 21:59:17,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:17,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639066682] [2025-02-05 21:59:17,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639066682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:17,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:17,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:17,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276007603] [2025-02-05 21:59:17,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:17,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:17,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:17,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:17,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:17,842 INFO L87 Difference]: Start difference. First operand 733 states and 1239 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) [2025-02-05 21:59:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:17,909 INFO L93 Difference]: Finished difference Result 1471 states and 2489 transitions. [2025-02-05 21:59:17,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:17,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) Word has length 753 [2025-02-05 21:59:17,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:17,915 INFO L225 Difference]: With dead ends: 1471 [2025-02-05 21:59:17,915 INFO L226 Difference]: Without dead ends: 741 [2025-02-05 21:59:17,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:17,917 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 3 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:17,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1195 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:59:17,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2025-02-05 21:59:17,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 739. [2025-02-05 21:59:17,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 500 states have (on average 1.55) internal successors, (775), 500 states have internal predecessors, (775), 236 states have call successors, (236), 2 states have call predecessors, (236), 2 states have return successors, (236), 236 states have call predecessors, (236), 236 states have call successors, (236) [2025-02-05 21:59:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1247 transitions. [2025-02-05 21:59:17,991 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1247 transitions. Word has length 753 [2025-02-05 21:59:17,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:17,992 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1247 transitions. [2025-02-05 21:59:17,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) [2025-02-05 21:59:17,993 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1247 transitions. [2025-02-05 21:59:18,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 755 [2025-02-05 21:59:18,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:18,002 INFO L218 NwaCegarLoop]: trace histogram [118, 118, 118, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:59:18,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:59:18,002 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:18,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:18,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1689089734, now seen corresponding path program 1 times [2025-02-05 21:59:18,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:18,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803778280] [2025-02-05 21:59:18,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:18,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:18,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 754 statements into 1 equivalence classes. [2025-02-05 21:59:18,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 754 of 754 statements. [2025-02-05 21:59:18,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:18,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 27612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27612 trivial. 0 not checked. [2025-02-05 21:59:18,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:18,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803778280] [2025-02-05 21:59:18,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803778280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:18,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:18,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:18,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516836478] [2025-02-05 21:59:18,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:18,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:18,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:18,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:18,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:18,264 INFO L87 Difference]: Start difference. First operand 739 states and 1247 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) [2025-02-05 21:59:18,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:18,356 INFO L93 Difference]: Finished difference Result 1945 states and 3292 transitions. [2025-02-05 21:59:18,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:18,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) Word has length 754 [2025-02-05 21:59:18,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:18,363 INFO L225 Difference]: With dead ends: 1945 [2025-02-05 21:59:18,364 INFO L226 Difference]: Without dead ends: 1209 [2025-02-05 21:59:18,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:18,366 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 390 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:18,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1195 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:18,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2025-02-05 21:59:18,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1205. [2025-02-05 21:59:18,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 852 states have (on average 1.573943661971831) internal successors, (1341), 854 states have internal predecessors, (1341), 348 states have call successors, (348), 4 states have call predecessors, (348), 4 states have return successors, (348), 346 states have call predecessors, (348), 348 states have call successors, (348) [2025-02-05 21:59:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 2037 transitions. [2025-02-05 21:59:18,447 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 2037 transitions. Word has length 754 [2025-02-05 21:59:18,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:18,448 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 2037 transitions. [2025-02-05 21:59:18,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) [2025-02-05 21:59:18,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 2037 transitions. [2025-02-05 21:59:18,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 755 [2025-02-05 21:59:18,453 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:18,453 INFO L218 NwaCegarLoop]: trace histogram [118, 118, 118, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:59:18,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:59:18,454 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:18,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:18,454 INFO L85 PathProgramCache]: Analyzing trace with hash 14360343, now seen corresponding path program 1 times [2025-02-05 21:59:18,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:18,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502450148] [2025-02-05 21:59:18,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:18,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:18,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 754 statements into 1 equivalence classes. [2025-02-05 21:59:18,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 754 of 754 statements. [2025-02-05 21:59:18,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:18,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:18,733 INFO L134 CoverageAnalysis]: Checked inductivity of 27612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27612 trivial. 0 not checked. [2025-02-05 21:59:18,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:18,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502450148] [2025-02-05 21:59:18,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502450148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:18,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:18,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:18,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321278339] [2025-02-05 21:59:18,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:18,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:18,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:18,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:18,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:18,735 INFO L87 Difference]: Start difference. First operand 1205 states and 2037 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) [2025-02-05 21:59:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:18,896 INFO L93 Difference]: Finished difference Result 3597 states and 6081 transitions. [2025-02-05 21:59:18,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:18,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) Word has length 754 [2025-02-05 21:59:18,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:18,910 INFO L225 Difference]: With dead ends: 3597 [2025-02-05 21:59:18,910 INFO L226 Difference]: Without dead ends: 2395 [2025-02-05 21:59:18,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:18,914 INFO L435 NwaCegarLoop]: 1080 mSDtfsCounter, 597 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:18,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 1667 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:18,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2395 states. [2025-02-05 21:59:19,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 1573. [2025-02-05 21:59:19,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1220 states have (on average 1.6352459016393444) internal successors, (1995), 1222 states have internal predecessors, (1995), 348 states have call successors, (348), 4 states have call predecessors, (348), 4 states have return successors, (348), 346 states have call predecessors, (348), 348 states have call successors, (348) [2025-02-05 21:59:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2691 transitions. [2025-02-05 21:59:19,048 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2691 transitions. Word has length 754 [2025-02-05 21:59:19,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:19,049 INFO L471 AbstractCegarLoop]: Abstraction has 1573 states and 2691 transitions. [2025-02-05 21:59:19,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) [2025-02-05 21:59:19,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2691 transitions. [2025-02-05 21:59:19,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 755 [2025-02-05 21:59:19,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:19,054 INFO L218 NwaCegarLoop]: trace histogram [118, 118, 118, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:59:19,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:59:19,055 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:19,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:19,055 INFO L85 PathProgramCache]: Analyzing trace with hash 881412568, now seen corresponding path program 1 times [2025-02-05 21:59:19,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:19,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649224798] [2025-02-05 21:59:19,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:19,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:19,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 754 statements into 1 equivalence classes. [2025-02-05 21:59:19,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 754 of 754 statements. [2025-02-05 21:59:19,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:19,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:19,272 INFO L134 CoverageAnalysis]: Checked inductivity of 27612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27612 trivial. 0 not checked. [2025-02-05 21:59:19,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:19,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649224798] [2025-02-05 21:59:19,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649224798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:19,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:19,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:19,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473624134] [2025-02-05 21:59:19,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:19,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:19,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:19,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:19,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:19,277 INFO L87 Difference]: Start difference. First operand 1573 states and 2691 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) [2025-02-05 21:59:19,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:19,405 INFO L93 Difference]: Finished difference Result 4423 states and 7580 transitions. [2025-02-05 21:59:19,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:19,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) Word has length 754 [2025-02-05 21:59:19,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:19,421 INFO L225 Difference]: With dead ends: 4423 [2025-02-05 21:59:19,421 INFO L226 Difference]: Without dead ends: 2853 [2025-02-05 21:59:19,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:19,426 INFO L435 NwaCegarLoop]: 688 mSDtfsCounter, 367 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:19,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1275 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:19,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2025-02-05 21:59:19,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 2847. [2025-02-05 21:59:19,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2847 states, 2306 states have (on average 1.6535125758889853) internal successors, (3813), 2312 states have internal predecessors, (3813), 532 states have call successors, (532), 8 states have call predecessors, (532), 8 states have return successors, (532), 526 states have call predecessors, (532), 532 states have call successors, (532) [2025-02-05 21:59:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2847 states to 2847 states and 4877 transitions. [2025-02-05 21:59:19,559 INFO L78 Accepts]: Start accepts. Automaton has 2847 states and 4877 transitions. Word has length 754 [2025-02-05 21:59:19,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:19,560 INFO L471 AbstractCegarLoop]: Abstraction has 2847 states and 4877 transitions. [2025-02-05 21:59:19,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) [2025-02-05 21:59:19,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2847 states and 4877 transitions. [2025-02-05 21:59:19,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 755 [2025-02-05 21:59:19,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:19,566 INFO L218 NwaCegarLoop]: trace histogram [118, 118, 118, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:59:19,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:59:19,567 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:19,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:19,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1819944183, now seen corresponding path program 1 times [2025-02-05 21:59:19,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:19,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949707715] [2025-02-05 21:59:19,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:19,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:19,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 754 statements into 1 equivalence classes. [2025-02-05 21:59:19,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 754 of 754 statements. [2025-02-05 21:59:19,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:19,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 27612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27612 trivial. 0 not checked. [2025-02-05 21:59:19,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:19,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949707715] [2025-02-05 21:59:19,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949707715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:19,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:19,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:59:19,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533345489] [2025-02-05 21:59:19,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:19,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:59:19,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:19,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:59:19,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:59:19,830 INFO L87 Difference]: Start difference. First operand 2847 states and 4877 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) [2025-02-05 21:59:20,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:20,327 INFO L93 Difference]: Finished difference Result 10347 states and 17531 transitions. [2025-02-05 21:59:20,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:59:20,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) Word has length 754 [2025-02-05 21:59:20,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:20,359 INFO L225 Difference]: With dead ends: 10347 [2025-02-05 21:59:20,359 INFO L226 Difference]: Without dead ends: 7503 [2025-02-05 21:59:20,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:59:20,367 INFO L435 NwaCegarLoop]: 813 mSDtfsCounter, 1321 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1321 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:20,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1321 Valid, 2024 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:59:20,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7503 states. [2025-02-05 21:59:20,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7503 to 5167. [2025-02-05 21:59:20,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5167 states, 4242 states have (on average 1.6475719000471476) internal successors, (6989), 4256 states have internal predecessors, (6989), 908 states have call successors, (908), 16 states have call predecessors, (908), 16 states have return successors, (908), 894 states have call predecessors, (908), 908 states have call successors, (908) [2025-02-05 21:59:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5167 states to 5167 states and 8805 transitions. [2025-02-05 21:59:20,720 INFO L78 Accepts]: Start accepts. Automaton has 5167 states and 8805 transitions. Word has length 754 [2025-02-05 21:59:20,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:20,721 INFO L471 AbstractCegarLoop]: Abstraction has 5167 states and 8805 transitions. [2025-02-05 21:59:20,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) [2025-02-05 21:59:20,722 INFO L276 IsEmpty]: Start isEmpty. Operand 5167 states and 8805 transitions. [2025-02-05 21:59:20,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 755 [2025-02-05 21:59:20,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:20,735 INFO L218 NwaCegarLoop]: trace histogram [118, 118, 118, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:59:20,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:59:20,736 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:20,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:20,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1702177591, now seen corresponding path program 1 times [2025-02-05 21:59:20,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:20,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433351291] [2025-02-05 21:59:20,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:20,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:20,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 754 statements into 1 equivalence classes. [2025-02-05 21:59:20,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 754 of 754 statements. [2025-02-05 21:59:20,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:20,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:20,978 INFO L134 CoverageAnalysis]: Checked inductivity of 27612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27612 trivial. 0 not checked. [2025-02-05 21:59:20,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:20,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433351291] [2025-02-05 21:59:20,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433351291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:20,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:20,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:20,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259044906] [2025-02-05 21:59:20,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:20,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:20,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:20,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:20,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:20,980 INFO L87 Difference]: Start difference. First operand 5167 states and 8805 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) [2025-02-05 21:59:21,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:21,322 INFO L93 Difference]: Finished difference Result 15123 states and 25774 transitions. [2025-02-05 21:59:21,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:21,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) Word has length 754 [2025-02-05 21:59:21,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:21,357 INFO L225 Difference]: With dead ends: 15123 [2025-02-05 21:59:21,357 INFO L226 Difference]: Without dead ends: 9959 [2025-02-05 21:59:21,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:21,367 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 360 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:21,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1191 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:21,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9959 states. [2025-02-05 21:59:21,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9959 to 9955. [2025-02-05 21:59:21,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9955 states, 8198 states have (on average 1.647353012929983) internal successors, (13505), 8228 states have internal predecessors, (13505), 1724 states have call successors, (1724), 32 states have call predecessors, (1724), 32 states have return successors, (1724), 1694 states have call predecessors, (1724), 1724 states have call successors, (1724) [2025-02-05 21:59:21,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9955 states to 9955 states and 16953 transitions. [2025-02-05 21:59:21,823 INFO L78 Accepts]: Start accepts. Automaton has 9955 states and 16953 transitions. Word has length 754 [2025-02-05 21:59:21,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:21,824 INFO L471 AbstractCegarLoop]: Abstraction has 9955 states and 16953 transitions. [2025-02-05 21:59:21,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) [2025-02-05 21:59:21,825 INFO L276 IsEmpty]: Start isEmpty. Operand 9955 states and 16953 transitions. [2025-02-05 21:59:21,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 755 [2025-02-05 21:59:21,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:21,838 INFO L218 NwaCegarLoop]: trace histogram [118, 118, 118, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:59:21,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:59:21,839 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:21,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:21,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1408774584, now seen corresponding path program 1 times [2025-02-05 21:59:21,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:21,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903336237] [2025-02-05 21:59:21,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:21,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:21,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 754 statements into 1 equivalence classes. [2025-02-05 21:59:21,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 754 of 754 statements. [2025-02-05 21:59:21,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:21,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:22,125 INFO L134 CoverageAnalysis]: Checked inductivity of 27612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27612 trivial. 0 not checked. [2025-02-05 21:59:22,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:22,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903336237] [2025-02-05 21:59:22,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903336237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:22,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:22,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:22,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595745656] [2025-02-05 21:59:22,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:22,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:22,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:22,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:22,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:22,127 INFO L87 Difference]: Start difference. First operand 9955 states and 16953 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) [2025-02-05 21:59:22,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:22,642 INFO L93 Difference]: Finished difference Result 26533 states and 44976 transitions. [2025-02-05 21:59:22,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:22,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) Word has length 754 [2025-02-05 21:59:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:22,707 INFO L225 Difference]: With dead ends: 26533 [2025-02-05 21:59:22,707 INFO L226 Difference]: Without dead ends: 16581 [2025-02-05 21:59:22,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:22,732 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 285 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:22,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 1178 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:22,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16581 states. [2025-02-05 21:59:23,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16581 to 16571. [2025-02-05 21:59:23,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16571 states, 13230 states have (on average 1.6176114890400606) internal successors, (21401), 13292 states have internal predecessors, (21401), 3276 states have call successors, (3276), 64 states have call predecessors, (3276), 64 states have return successors, (3276), 3214 states have call predecessors, (3276), 3276 states have call successors, (3276) [2025-02-05 21:59:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16571 states to 16571 states and 27953 transitions. [2025-02-05 21:59:23,763 INFO L78 Accepts]: Start accepts. Automaton has 16571 states and 27953 transitions. Word has length 754 [2025-02-05 21:59:23,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:23,764 INFO L471 AbstractCegarLoop]: Abstraction has 16571 states and 27953 transitions. [2025-02-05 21:59:23,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) [2025-02-05 21:59:23,765 INFO L276 IsEmpty]: Start isEmpty. Operand 16571 states and 27953 transitions. [2025-02-05 21:59:23,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 756 [2025-02-05 21:59:23,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:23,783 INFO L218 NwaCegarLoop]: trace histogram [118, 118, 118, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:59:23,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:59:23,784 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:23,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:23,784 INFO L85 PathProgramCache]: Analyzing trace with hash -980286427, now seen corresponding path program 1 times [2025-02-05 21:59:23,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:23,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888368769] [2025-02-05 21:59:23,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:23,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:23,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 755 statements into 1 equivalence classes. [2025-02-05 21:59:23,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 755 of 755 statements. [2025-02-05 21:59:23,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:23,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:24,141 INFO L134 CoverageAnalysis]: Checked inductivity of 27612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27612 trivial. 0 not checked. [2025-02-05 21:59:24,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:24,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888368769] [2025-02-05 21:59:24,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888368769] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:24,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:24,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:24,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009022099] [2025-02-05 21:59:24,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:24,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:24,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:24,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:24,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:24,143 INFO L87 Difference]: Start difference. First operand 16571 states and 27953 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) [2025-02-05 21:59:24,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:24,914 INFO L93 Difference]: Finished difference Result 46821 states and 78840 transitions. [2025-02-05 21:59:24,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:24,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) Word has length 755 [2025-02-05 21:59:24,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:25,005 INFO L225 Difference]: With dead ends: 46821 [2025-02-05 21:59:25,006 INFO L226 Difference]: Without dead ends: 30253 [2025-02-05 21:59:25,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:25,041 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 267 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:25,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 1259 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:25,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30253 states. [2025-02-05 21:59:26,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30253 to 30187. [2025-02-05 21:59:26,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30187 states, 24222 states have (on average 1.6111386342993972) internal successors, (39025), 24348 states have internal predecessors, (39025), 5836 states have call successors, (5836), 128 states have call predecessors, (5836), 128 states have return successors, (5836), 5710 states have call predecessors, (5836), 5836 states have call successors, (5836) [2025-02-05 21:59:26,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30187 states to 30187 states and 50697 transitions. [2025-02-05 21:59:26,253 INFO L78 Accepts]: Start accepts. Automaton has 30187 states and 50697 transitions. Word has length 755 [2025-02-05 21:59:26,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:26,254 INFO L471 AbstractCegarLoop]: Abstraction has 30187 states and 50697 transitions. [2025-02-05 21:59:26,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) [2025-02-05 21:59:26,254 INFO L276 IsEmpty]: Start isEmpty. Operand 30187 states and 50697 transitions. [2025-02-05 21:59:26,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 756 [2025-02-05 21:59:26,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:26,292 INFO L218 NwaCegarLoop]: trace histogram [118, 118, 118, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:59:26,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:59:26,293 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:26,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:26,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2131333572, now seen corresponding path program 1 times [2025-02-05 21:59:26,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:26,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794200066] [2025-02-05 21:59:26,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:26,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:26,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 755 statements into 1 equivalence classes. [2025-02-05 21:59:26,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 755 of 755 statements. [2025-02-05 21:59:26,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:26,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:26,720 INFO L134 CoverageAnalysis]: Checked inductivity of 27612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27612 trivial. 0 not checked. [2025-02-05 21:59:26,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:26,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794200066] [2025-02-05 21:59:26,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794200066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:26,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:26,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:59:26,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928144407] [2025-02-05 21:59:26,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:26,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:59:26,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:26,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:59:26,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:59:26,722 INFO L87 Difference]: Start difference. First operand 30187 states and 50697 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) [2025-02-05 21:59:29,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:29,819 INFO L93 Difference]: Finished difference Result 110953 states and 185535 transitions. [2025-02-05 21:59:29,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:59:29,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) Word has length 755 [2025-02-05 21:59:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:30,083 INFO L225 Difference]: With dead ends: 110953 [2025-02-05 21:59:30,083 INFO L226 Difference]: Without dead ends: 80769 [2025-02-05 21:59:30,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:59:30,151 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 1035 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 2382 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:30,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 2382 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 21:59:30,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80769 states. [2025-02-05 21:59:33,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80769 to 78386. [2025-02-05 21:59:33,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78386 states, 60526 states have (on average 1.5763308330304333) internal successors, (95409), 60909 states have internal predecessors, (95409), 17468 states have call successors, (17468), 391 states have call predecessors, (17468), 391 states have return successors, (17468), 17085 states have call predecessors, (17468), 17468 states have call successors, (17468) [2025-02-05 21:59:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78386 states to 78386 states and 130345 transitions. [2025-02-05 21:59:34,156 INFO L78 Accepts]: Start accepts. Automaton has 78386 states and 130345 transitions. Word has length 755 [2025-02-05 21:59:34,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:34,157 INFO L471 AbstractCegarLoop]: Abstraction has 78386 states and 130345 transitions. [2025-02-05 21:59:34,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) [2025-02-05 21:59:34,158 INFO L276 IsEmpty]: Start isEmpty. Operand 78386 states and 130345 transitions. [2025-02-05 21:59:34,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 756 [2025-02-05 21:59:34,228 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:34,229 INFO L218 NwaCegarLoop]: trace histogram [118, 118, 118, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:59:34,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:59:34,230 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:34,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:34,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1812833787, now seen corresponding path program 1 times [2025-02-05 21:59:34,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:34,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7086659] [2025-02-05 21:59:34,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:34,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:34,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 755 statements into 1 equivalence classes. [2025-02-05 21:59:34,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 755 of 755 statements. [2025-02-05 21:59:34,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:34,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:35,107 INFO L134 CoverageAnalysis]: Checked inductivity of 27612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27612 trivial. 0 not checked. [2025-02-05 21:59:35,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:35,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7086659] [2025-02-05 21:59:35,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7086659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:35,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:35,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:59:35,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174847993] [2025-02-05 21:59:35,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:35,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:59:35,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:35,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:59:35,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:59:35,110 INFO L87 Difference]: Start difference. First operand 78386 states and 130345 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (118), 1 states have call predecessors, (118), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118)