./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-250_file-21.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 6343a1465750afdc947de8e9ff805a9cfece8acd0c6031287a1734d8c4b949b9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:40:17,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:40:17,920 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:40:17,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:40:17,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:40:17,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:40:17,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:40:17,956 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:40:17,956 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:40:17,956 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:40:17,956 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:40:17,956 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:40:17,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:40:17,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:40:17,957 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:40:17,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:40:17,957 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:40:17,957 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:40:17,957 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:40:17,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:40:17,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:40:17,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:40:17,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:40:17,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:40:17,958 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:40:17,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:40:17,958 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:40:17,958 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:40:17,959 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:40:17,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:40:17,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:40:17,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:40:17,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:40:17,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:40:17,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:40:17,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:40:17,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:40:17,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:40:17,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:40:17,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:40:17,959 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:40:17,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:40:17,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:40:17,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:40:17,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:40:17,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:40:17,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:40:17,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:40:17,960 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 -> 6343a1465750afdc947de8e9ff805a9cfece8acd0c6031287a1734d8c4b949b9 [2025-01-09 09:40:18,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:40:18,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:40:18,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:40:18,252 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:40:18,253 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:40:18,254 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-250_file-21.i [2025-01-09 09:40:19,560 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d332e71b9/5ecf147ad91440d58207be2e87462e99/FLAG8c26426a9 [2025-01-09 09:40:19,847 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:40:19,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-21.i [2025-01-09 09:40:19,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d332e71b9/5ecf147ad91440d58207be2e87462e99/FLAG8c26426a9 [2025-01-09 09:40:19,867 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d332e71b9/5ecf147ad91440d58207be2e87462e99 [2025-01-09 09:40:19,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:40:19,871 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:40:19,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:40:19,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:40:19,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:40:19,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:40:19" (1/1) ... [2025-01-09 09:40:19,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42e0a1a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:19, skipping insertion in model container [2025-01-09 09:40:19,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:40:19" (1/1) ... [2025-01-09 09:40:19,914 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:40:20,053 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-250_file-21.i[916,929] [2025-01-09 09:40:20,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:40:20,240 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:40:20,252 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-250_file-21.i[916,929] [2025-01-09 09:40:20,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:40:20,350 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:40:20,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:20 WrapperNode [2025-01-09 09:40:20,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:40:20,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:40:20,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:40:20,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:40:20,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:20" (1/1) ... [2025-01-09 09:40:20,375 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:20" (1/1) ... [2025-01-09 09:40:20,435 INFO L138 Inliner]: procedures = 26, calls = 99, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 657 [2025-01-09 09:40:20,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:40:20,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:40:20,436 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:40:20,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:40:20,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:20" (1/1) ... [2025-01-09 09:40:20,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:20" (1/1) ... [2025-01-09 09:40:20,467 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:20" (1/1) ... [2025-01-09 09:40:20,508 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-01-09 09:40:20,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:20" (1/1) ... [2025-01-09 09:40:20,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:20" (1/1) ... [2025-01-09 09:40:20,539 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:20" (1/1) ... [2025-01-09 09:40:20,543 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:20" (1/1) ... [2025-01-09 09:40:20,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:20" (1/1) ... [2025-01-09 09:40:20,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:20" (1/1) ... [2025-01-09 09:40:20,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:20" (1/1) ... [2025-01-09 09:40:20,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:40:20,591 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:40:20,591 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:40:20,591 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:40:20,592 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:20" (1/1) ... [2025-01-09 09:40:20,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:40:20,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:40:20,625 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-01-09 09:40:20,627 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-01-09 09:40:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:40:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:40:20,651 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:40:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:40:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:40:20,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:40:20,763 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:40:20,765 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:40:21,704 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-01-09 09:40:21,704 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:40:21,723 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:40:21,723 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:40:21,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:40:21 BoogieIcfgContainer [2025-01-09 09:40:21,724 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:40:21,729 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:40:21,729 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:40:21,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:40:21,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:40:19" (1/3) ... [2025-01-09 09:40:21,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b16b95e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:40:21, skipping insertion in model container [2025-01-09 09:40:21,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:20" (2/3) ... [2025-01-09 09:40:21,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b16b95e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:40:21, skipping insertion in model container [2025-01-09 09:40:21,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:40:21" (3/3) ... [2025-01-09 09:40:21,738 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-21.i [2025-01-09 09:40:21,754 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:40:21,758 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-21.i that has 2 procedures, 270 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:40:21,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:40:21,859 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;@4fc9bbeb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:40:21,860 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:40:21,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 270 states, 181 states have (on average 1.5248618784530388) internal successors, (276), 182 states have internal predecessors, (276), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 09:40:21,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-01-09 09:40:21,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:21,899 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:40:21,900 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:21,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:21,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1247464086, now seen corresponding path program 1 times [2025-01-09 09:40:21,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:21,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067509859] [2025-01-09 09:40:21,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:21,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:22,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-01-09 09:40:22,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-01-09 09:40:22,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:22,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2025-01-09 09:40:22,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:22,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067509859] [2025-01-09 09:40:22,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067509859] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:40:22,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883163020] [2025-01-09 09:40:22,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:22,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:40:22,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:40:22,531 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-01-09 09:40:22,533 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-01-09 09:40:22,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-01-09 09:40:22,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-01-09 09:40:22,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:22,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:22,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:40:22,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:40:22,978 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2025-01-09 09:40:22,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:40:22,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883163020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:22,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:40:22,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:40:22,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414802895] [2025-01-09 09:40:22,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:22,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:40:22,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:23,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:40:23,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:40:23,012 INFO L87 Difference]: Start difference. First operand has 270 states, 181 states have (on average 1.5248618784530388) internal successors, (276), 182 states have internal predecessors, (276), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2025-01-09 09:40:23,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:23,070 INFO L93 Difference]: Finished difference Result 523 states and 958 transitions. [2025-01-09 09:40:23,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:40:23,072 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) Word has length 535 [2025-01-09 09:40:23,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:23,084 INFO L225 Difference]: With dead ends: 523 [2025-01-09 09:40:23,085 INFO L226 Difference]: Without dead ends: 256 [2025-01-09 09:40:23,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 536 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-01-09 09:40:23,094 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:23,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:40:23,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-01-09 09:40:23,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-01-09 09:40:23,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 168 states have (on average 1.494047619047619) internal successors, (251), 168 states have internal predecessors, (251), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 09:40:23,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 423 transitions. [2025-01-09 09:40:23,181 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 423 transitions. Word has length 535 [2025-01-09 09:40:23,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:23,183 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 423 transitions. [2025-01-09 09:40:23,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2025-01-09 09:40:23,184 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 423 transitions. [2025-01-09 09:40:23,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-01-09 09:40:23,195 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:23,196 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:40:23,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 09:40:23,396 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-01-09 09:40:23,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:23,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:23,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1735543366, now seen corresponding path program 1 times [2025-01-09 09:40:23,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:23,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237899091] [2025-01-09 09:40:23,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:23,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:23,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-01-09 09:40:23,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-01-09 09:40:23,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:23,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:24,417 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-01-09 09:40:24,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:24,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237899091] [2025-01-09 09:40:24,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237899091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:24,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:24,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:40:24,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859212784] [2025-01-09 09:40:24,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:24,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:40:24,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:24,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:40:24,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:40:24,425 INFO L87 Difference]: Start difference. First operand 256 states and 423 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-01-09 09:40:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:24,725 INFO L93 Difference]: Finished difference Result 762 states and 1263 transitions. [2025-01-09 09:40:24,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:40:24,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) Word has length 535 [2025-01-09 09:40:24,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:24,735 INFO L225 Difference]: With dead ends: 762 [2025-01-09 09:40:24,735 INFO L226 Difference]: Without dead ends: 509 [2025-01-09 09:40:24,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:40:24,738 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 524 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:24,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 946 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:40:24,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-01-09 09:40:24,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 507. [2025-01-09 09:40:24,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 332 states have (on average 1.4969879518072289) internal successors, (497), 332 states have internal predecessors, (497), 172 states have call successors, (172), 2 states have call predecessors, (172), 2 states have return successors, (172), 172 states have call predecessors, (172), 172 states have call successors, (172) [2025-01-09 09:40:24,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 841 transitions. [2025-01-09 09:40:24,857 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 841 transitions. Word has length 535 [2025-01-09 09:40:24,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:24,860 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 841 transitions. [2025-01-09 09:40:24,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-01-09 09:40:24,860 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 841 transitions. [2025-01-09 09:40:24,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-01-09 09:40:24,873 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:24,874 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:40:24,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:40:24,877 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:24,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:24,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1203789985, now seen corresponding path program 1 times [2025-01-09 09:40:24,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:24,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152464530] [2025-01-09 09:40:24,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:24,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:24,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-01-09 09:40:24,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-01-09 09:40:24,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:24,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:25,227 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-01-09 09:40:25,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:25,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152464530] [2025-01-09 09:40:25,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152464530] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:25,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:25,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:40:25,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913943549] [2025-01-09 09:40:25,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:25,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:40:25,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:25,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:40:25,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:40:25,233 INFO L87 Difference]: Start difference. First operand 507 states and 841 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:40:25,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:25,336 INFO L93 Difference]: Finished difference Result 1255 states and 2080 transitions. [2025-01-09 09:40:25,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:40:25,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 536 [2025-01-09 09:40:25,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:25,349 INFO L225 Difference]: With dead ends: 1255 [2025-01-09 09:40:25,350 INFO L226 Difference]: Without dead ends: 751 [2025-01-09 09:40:25,352 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-01-09 09:40:25,352 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 224 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:25,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 961 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:40:25,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-01-09 09:40:25,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 746. [2025-01-09 09:40:25,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 525 states have (on average 1.5238095238095237) internal successors, (800), 527 states have internal predecessors, (800), 216 states have call successors, (216), 4 states have call predecessors, (216), 4 states have return successors, (216), 214 states have call predecessors, (216), 216 states have call successors, (216) [2025-01-09 09:40:25,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1232 transitions. [2025-01-09 09:40:25,473 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1232 transitions. Word has length 536 [2025-01-09 09:40:25,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:25,474 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1232 transitions. [2025-01-09 09:40:25,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:40:25,474 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1232 transitions. [2025-01-09 09:40:25,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-01-09 09:40:25,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:25,480 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:40:25,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:40:25,480 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:25,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:25,481 INFO L85 PathProgramCache]: Analyzing trace with hash -939748462, now seen corresponding path program 1 times [2025-01-09 09:40:25,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:25,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370793931] [2025-01-09 09:40:25,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:25,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:25,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-01-09 09:40:25,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-01-09 09:40:25,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:25,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:25,849 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-01-09 09:40:25,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:25,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370793931] [2025-01-09 09:40:25,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370793931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:25,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:25,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:40:25,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976205287] [2025-01-09 09:40:25,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:25,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:40:25,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:25,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:40:25,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:40:25,852 INFO L87 Difference]: Start difference. First operand 746 states and 1232 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:40:26,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:26,166 INFO L93 Difference]: Finished difference Result 1741 states and 2870 transitions. [2025-01-09 09:40:26,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:40:26,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 536 [2025-01-09 09:40:26,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:26,176 INFO L225 Difference]: With dead ends: 1741 [2025-01-09 09:40:26,176 INFO L226 Difference]: Without dead ends: 998 [2025-01-09 09:40:26,179 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-01-09 09:40:26,179 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 600 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:26,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1486 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:40:26,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-01-09 09:40:26,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 992. [2025-01-09 09:40:26,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 711 states have (on average 1.528832630098453) internal successors, (1087), 715 states have internal predecessors, (1087), 274 states have call successors, (274), 6 states have call predecessors, (274), 6 states have return successors, (274), 270 states have call predecessors, (274), 274 states have call successors, (274) [2025-01-09 09:40:26,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1635 transitions. [2025-01-09 09:40:26,288 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1635 transitions. Word has length 536 [2025-01-09 09:40:26,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:26,289 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1635 transitions. [2025-01-09 09:40:26,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:40:26,290 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1635 transitions. [2025-01-09 09:40:26,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-01-09 09:40:26,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:26,294 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:40:26,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:40:26,295 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:26,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:26,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1135541866, now seen corresponding path program 1 times [2025-01-09 09:40:26,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:26,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935164264] [2025-01-09 09:40:26,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:26,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:26,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-01-09 09:40:26,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-01-09 09:40:26,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:26,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-01-09 09:40:26,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:26,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935164264] [2025-01-09 09:40:26,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935164264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:26,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:26,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:40:26,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235510919] [2025-01-09 09:40:26,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:26,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:40:26,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:26,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:40:26,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:40:26,512 INFO L87 Difference]: Start difference. First operand 992 states and 1635 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:40:26,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:26,609 INFO L93 Difference]: Finished difference Result 2070 states and 3408 transitions. [2025-01-09 09:40:26,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:40:26,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 536 [2025-01-09 09:40:26,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:26,618 INFO L225 Difference]: With dead ends: 2070 [2025-01-09 09:40:26,619 INFO L226 Difference]: Without dead ends: 1081 [2025-01-09 09:40:26,622 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-01-09 09:40:26,623 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 191 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:26,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 867 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:40:26,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2025-01-09 09:40:26,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 884. [2025-01-09 09:40:26,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 669 states have (on average 1.5784753363228698) internal successors, (1056), 670 states have internal predecessors, (1056), 208 states have call successors, (208), 6 states have call predecessors, (208), 6 states have return successors, (208), 207 states have call predecessors, (208), 208 states have call successors, (208) [2025-01-09 09:40:26,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1472 transitions. [2025-01-09 09:40:26,707 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1472 transitions. Word has length 536 [2025-01-09 09:40:26,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:26,708 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 1472 transitions. [2025-01-09 09:40:26,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:40:26,711 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1472 transitions. [2025-01-09 09:40:26,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-01-09 09:40:26,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:26,720 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:40:26,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:40:26,720 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:26,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:26,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1165280724, now seen corresponding path program 1 times [2025-01-09 09:40:26,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:26,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755465076] [2025-01-09 09:40:26,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:26,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:26,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-01-09 09:40:26,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-01-09 09:40:26,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:26,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:27,022 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-01-09 09:40:27,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:27,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755465076] [2025-01-09 09:40:27,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755465076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:27,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:27,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:40:27,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094353759] [2025-01-09 09:40:27,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:27,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:40:27,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:27,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:40:27,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:40:27,026 INFO L87 Difference]: Start difference. First operand 884 states and 1472 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:40:27,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:27,416 INFO L93 Difference]: Finished difference Result 2446 states and 4019 transitions. [2025-01-09 09:40:27,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:40:27,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 536 [2025-01-09 09:40:27,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:27,430 INFO L225 Difference]: With dead ends: 2446 [2025-01-09 09:40:27,431 INFO L226 Difference]: Without dead ends: 1565 [2025-01-09 09:40:27,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:40:27,436 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 505 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:27,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1102 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:40:27,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2025-01-09 09:40:27,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1364. [2025-01-09 09:40:27,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1023 states have (on average 1.5425219941348973) internal successors, (1578), 1027 states have internal predecessors, (1578), 328 states have call successors, (328), 12 states have call predecessors, (328), 12 states have return successors, (328), 324 states have call predecessors, (328), 328 states have call successors, (328) [2025-01-09 09:40:27,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2234 transitions. [2025-01-09 09:40:27,553 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2234 transitions. Word has length 536 [2025-01-09 09:40:27,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:27,554 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 2234 transitions. [2025-01-09 09:40:27,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:40:27,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2234 transitions. [2025-01-09 09:40:27,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-01-09 09:40:27,559 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:27,560 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:40:27,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:40:27,560 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:27,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:27,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1413427218, now seen corresponding path program 1 times [2025-01-09 09:40:27,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:27,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783759166] [2025-01-09 09:40:27,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:27,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:27,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-01-09 09:40:27,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-01-09 09:40:27,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:27,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:27,878 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-01-09 09:40:27,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:27,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783759166] [2025-01-09 09:40:27,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783759166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:27,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:27,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:40:27,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714280448] [2025-01-09 09:40:27,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:27,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:40:27,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:27,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:40:27,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:40:27,881 INFO L87 Difference]: Start difference. First operand 1364 states and 2234 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:40:27,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:27,979 INFO L93 Difference]: Finished difference Result 2725 states and 4465 transitions. [2025-01-09 09:40:27,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:40:27,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 536 [2025-01-09 09:40:27,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:27,990 INFO L225 Difference]: With dead ends: 2725 [2025-01-09 09:40:27,990 INFO L226 Difference]: Without dead ends: 1364 [2025-01-09 09:40:27,994 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-01-09 09:40:27,995 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 0 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:27,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 837 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:40:27,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2025-01-09 09:40:28,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1364. [2025-01-09 09:40:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1023 states have (on average 1.5366568914956011) internal successors, (1572), 1027 states have internal predecessors, (1572), 328 states have call successors, (328), 12 states have call predecessors, (328), 12 states have return successors, (328), 324 states have call predecessors, (328), 328 states have call successors, (328) [2025-01-09 09:40:28,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2228 transitions. [2025-01-09 09:40:28,101 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2228 transitions. Word has length 536 [2025-01-09 09:40:28,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:28,102 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 2228 transitions. [2025-01-09 09:40:28,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:40:28,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2228 transitions. [2025-01-09 09:40:28,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-01-09 09:40:28,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:28,107 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:40:28,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:40:28,107 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:28,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:28,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1155261780, now seen corresponding path program 1 times [2025-01-09 09:40:28,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:28,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049065282] [2025-01-09 09:40:28,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:28,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:28,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-01-09 09:40:28,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-01-09 09:40:28,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:28,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-01-09 09:40:28,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:28,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049065282] [2025-01-09 09:40:28,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049065282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:28,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:28,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:40:28,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211373337] [2025-01-09 09:40:28,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:28,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:40:28,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:28,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:40:28,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:40:28,728 INFO L87 Difference]: Start difference. First operand 1364 states and 2228 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:40:28,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:28,817 INFO L93 Difference]: Finished difference Result 2713 states and 4435 transitions. [2025-01-09 09:40:28,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:40:28,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 536 [2025-01-09 09:40:28,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:28,827 INFO L225 Difference]: With dead ends: 2713 [2025-01-09 09:40:28,828 INFO L226 Difference]: Without dead ends: 1352 [2025-01-09 09:40:28,832 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-01-09 09:40:28,833 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 257 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:28,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 413 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:40:28,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2025-01-09 09:40:28,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1352. [2025-01-09 09:40:28,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1011 states have (on average 1.5064292779426312) internal successors, (1523), 1015 states have internal predecessors, (1523), 328 states have call successors, (328), 12 states have call predecessors, (328), 12 states have return successors, (328), 324 states have call predecessors, (328), 328 states have call successors, (328) [2025-01-09 09:40:28,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2179 transitions. [2025-01-09 09:40:28,953 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2179 transitions. Word has length 536 [2025-01-09 09:40:28,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:28,954 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 2179 transitions. [2025-01-09 09:40:28,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:40:28,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2179 transitions. [2025-01-09 09:40:28,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-01-09 09:40:28,958 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:28,959 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:40:28,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:40:28,959 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:28,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:28,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1088721518, now seen corresponding path program 1 times [2025-01-09 09:40:28,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:28,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666846932] [2025-01-09 09:40:28,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:28,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:28,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-01-09 09:40:29,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-01-09 09:40:29,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:29,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:29,675 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-01-09 09:40:29,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:29,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666846932] [2025-01-09 09:40:29,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666846932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:29,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:29,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:40:29,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489789383] [2025-01-09 09:40:29,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:29,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:40:29,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:29,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:40:29,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:40:29,677 INFO L87 Difference]: Start difference. First operand 1352 states and 2179 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:40:29,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:29,911 INFO L93 Difference]: Finished difference Result 4050 states and 6531 transitions. [2025-01-09 09:40:29,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:40:29,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 536 [2025-01-09 09:40:29,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:29,933 INFO L225 Difference]: With dead ends: 4050 [2025-01-09 09:40:29,934 INFO L226 Difference]: Without dead ends: 2701 [2025-01-09 09:40:29,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-01-09 09:40:29,942 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 257 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:29,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 926 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:40:29,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2025-01-09 09:40:30,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2675. [2025-01-09 09:40:30,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2675 states, 1994 states have (on average 1.5010030090270812) internal successors, (2993), 2002 states have internal predecessors, (2993), 656 states have call successors, (656), 24 states have call predecessors, (656), 24 states have return successors, (656), 648 states have call predecessors, (656), 656 states have call successors, (656) [2025-01-09 09:40:30,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 4305 transitions. [2025-01-09 09:40:30,200 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 4305 transitions. Word has length 536 [2025-01-09 09:40:30,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:30,201 INFO L471 AbstractCegarLoop]: Abstraction has 2675 states and 4305 transitions. [2025-01-09 09:40:30,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:40:30,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 4305 transitions. [2025-01-09 09:40:30,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-01-09 09:40:30,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:30,208 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:40:30,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:40:30,208 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:30,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:30,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1277973076, now seen corresponding path program 1 times [2025-01-09 09:40:30,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:30,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250766373] [2025-01-09 09:40:30,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:30,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:30,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-01-09 09:40:30,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-01-09 09:40:30,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:30,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-01-09 09:40:30,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:30,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250766373] [2025-01-09 09:40:30,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250766373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:30,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:30,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:40:30,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551428156] [2025-01-09 09:40:30,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:30,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:40:30,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:30,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:40:30,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:40:30,627 INFO L87 Difference]: Start difference. First operand 2675 states and 4305 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-01-09 09:40:31,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:31,046 INFO L93 Difference]: Finished difference Result 4030 states and 6488 transitions. [2025-01-09 09:40:31,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:40:31,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) Word has length 536 [2025-01-09 09:40:31,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:31,064 INFO L225 Difference]: With dead ends: 4030 [2025-01-09 09:40:31,065 INFO L226 Difference]: Without dead ends: 2681 [2025-01-09 09:40:31,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:40:31,070 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 531 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:31,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 1456 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:40:31,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2681 states. [2025-01-09 09:40:31,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2681 to 2677. [2025-01-09 09:40:31,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 1996 states have (on average 1.500501002004008) internal successors, (2995), 2004 states have internal predecessors, (2995), 656 states have call successors, (656), 24 states have call predecessors, (656), 24 states have return successors, (656), 648 states have call predecessors, (656), 656 states have call successors, (656) [2025-01-09 09:40:31,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 4307 transitions. [2025-01-09 09:40:31,337 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 4307 transitions. Word has length 536 [2025-01-09 09:40:31,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:31,338 INFO L471 AbstractCegarLoop]: Abstraction has 2677 states and 4307 transitions. [2025-01-09 09:40:31,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-01-09 09:40:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 4307 transitions. [2025-01-09 09:40:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-01-09 09:40:31,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:31,350 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:40:31,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:40:31,351 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:31,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:31,352 INFO L85 PathProgramCache]: Analyzing trace with hash 817357137, now seen corresponding path program 1 times [2025-01-09 09:40:31,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:31,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558327519] [2025-01-09 09:40:31,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:31,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:31,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-01-09 09:40:31,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-01-09 09:40:31,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:31,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:31,768 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-01-09 09:40:31,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:31,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558327519] [2025-01-09 09:40:31,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558327519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:31,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:31,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:40:31,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673901224] [2025-01-09 09:40:31,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:31,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:40:31,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:31,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:40:31,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:40:31,771 INFO L87 Difference]: Start difference. First operand 2677 states and 4307 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:40:32,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:32,769 INFO L93 Difference]: Finished difference Result 5569 states and 8855 transitions. [2025-01-09 09:40:32,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 09:40:32,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 537 [2025-01-09 09:40:32,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:32,808 INFO L225 Difference]: With dead ends: 5569 [2025-01-09 09:40:32,808 INFO L226 Difference]: Without dead ends: 4549 [2025-01-09 09:40:32,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:40:32,815 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 966 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:32,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 1593 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 09:40:32,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4549 states. [2025-01-09 09:40:33,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4549 to 3113. [2025-01-09 09:40:33,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3113 states, 2320 states have (on average 1.4918103448275861) internal successors, (3461), 2332 states have internal predecessors, (3461), 760 states have call successors, (760), 32 states have call predecessors, (760), 32 states have return successors, (760), 748 states have call predecessors, (760), 760 states have call successors, (760) [2025-01-09 09:40:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 4981 transitions. [2025-01-09 09:40:33,130 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 4981 transitions. Word has length 537 [2025-01-09 09:40:33,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:33,131 INFO L471 AbstractCegarLoop]: Abstraction has 3113 states and 4981 transitions. [2025-01-09 09:40:33,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:40:33,131 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 4981 transitions. [2025-01-09 09:40:33,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-01-09 09:40:33,136 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:33,137 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:40:33,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 09:40:33,138 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:33,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:33,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1232030705, now seen corresponding path program 1 times [2025-01-09 09:40:33,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:33,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421253586] [2025-01-09 09:40:33,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:33,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:33,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-01-09 09:40:33,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-01-09 09:40:33,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:33,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-01-09 09:40:33,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:33,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421253586] [2025-01-09 09:40:33,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421253586] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:33,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:33,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:40:33,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701917687] [2025-01-09 09:40:33,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:33,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:40:33,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:33,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:40:33,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:40:33,697 INFO L87 Difference]: Start difference. First operand 3113 states and 4981 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:40:34,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:34,353 INFO L93 Difference]: Finished difference Result 4352 states and 6938 transitions. [2025-01-09 09:40:34,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:40:34,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 537 [2025-01-09 09:40:34,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:34,380 INFO L225 Difference]: With dead ends: 4352 [2025-01-09 09:40:34,380 INFO L226 Difference]: Without dead ends: 3615 [2025-01-09 09:40:34,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:40:34,384 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 629 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:34,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 1350 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:40:34,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2025-01-09 09:40:34,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 3118. [2025-01-09 09:40:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3118 states, 2325 states have (on average 1.4924731182795699) internal successors, (3470), 2337 states have internal predecessors, (3470), 760 states have call successors, (760), 32 states have call predecessors, (760), 32 states have return successors, (760), 748 states have call predecessors, (760), 760 states have call successors, (760) [2025-01-09 09:40:34,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 4990 transitions. [2025-01-09 09:40:34,668 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 4990 transitions. Word has length 537 [2025-01-09 09:40:34,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:34,669 INFO L471 AbstractCegarLoop]: Abstraction has 3118 states and 4990 transitions. [2025-01-09 09:40:34,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:40:34,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 4990 transitions. [2025-01-09 09:40:34,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-01-09 09:40:34,675 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:34,675 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:40:34,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 09:40:34,676 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:34,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:34,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1710843475, now seen corresponding path program 1 times [2025-01-09 09:40:34,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:34,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629461427] [2025-01-09 09:40:34,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:34,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:34,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-01-09 09:40:34,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-01-09 09:40:34,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:34,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-01-09 09:40:35,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:35,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629461427] [2025-01-09 09:40:35,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629461427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:35,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:35,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 09:40:35,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406988747] [2025-01-09 09:40:35,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:35,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 09:40:35,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:35,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 09:40:35,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:40:35,049 INFO L87 Difference]: Start difference. First operand 3118 states and 4990 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:40:37,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:37,263 INFO L93 Difference]: Finished difference Result 15602 states and 24832 transitions. [2025-01-09 09:40:37,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:40:37,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 537 [2025-01-09 09:40:37,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:37,334 INFO L225 Difference]: With dead ends: 15602 [2025-01-09 09:40:37,335 INFO L226 Difference]: Without dead ends: 13310 [2025-01-09 09:40:37,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:40:37,352 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 1762 mSDsluCounter, 1662 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1762 SdHoareTripleChecker+Valid, 2267 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:37,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1762 Valid, 2267 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 09:40:37,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13310 states. [2025-01-09 09:40:38,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13310 to 8846. [2025-01-09 09:40:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8846 states, 6789 states have (on average 1.5062601266755045) internal successors, (10226), 6829 states have internal predecessors, (10226), 1960 states have call successors, (1960), 96 states have call predecessors, (1960), 96 states have return successors, (1960), 1920 states have call predecessors, (1960), 1960 states have call successors, (1960) [2025-01-09 09:40:38,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8846 states to 8846 states and 14146 transitions. [2025-01-09 09:40:38,187 INFO L78 Accepts]: Start accepts. Automaton has 8846 states and 14146 transitions. Word has length 537 [2025-01-09 09:40:38,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:38,188 INFO L471 AbstractCegarLoop]: Abstraction has 8846 states and 14146 transitions. [2025-01-09 09:40:38,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:40:38,188 INFO L276 IsEmpty]: Start isEmpty. Operand 8846 states and 14146 transitions. [2025-01-09 09:40:38,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-01-09 09:40:38,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:38,198 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:40:38,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 09:40:38,198 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:38,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:38,199 INFO L85 PathProgramCache]: Analyzing trace with hash 2134490197, now seen corresponding path program 1 times [2025-01-09 09:40:38,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:38,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714326719] [2025-01-09 09:40:38,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:38,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:38,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-01-09 09:40:38,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-01-09 09:40:38,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:38,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:41,802 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-01-09 09:40:41,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:41,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714326719] [2025-01-09 09:40:41,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714326719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:41,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:41,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 09:40:41,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756971489] [2025-01-09 09:40:41,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:41,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 09:40:41,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:41,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 09:40:41,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 09:40:41,807 INFO L87 Difference]: Start difference. First operand 8846 states and 14146 transitions. Second operand has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 12 states have internal predecessors, (110), 3 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 3 states have call predecessors, (86), 3 states have call successors, (86) [2025-01-09 09:40:49,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:49,887 INFO L93 Difference]: Finished difference Result 26804 states and 42717 transitions. [2025-01-09 09:40:49,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 09:40:49,887 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 12 states have internal predecessors, (110), 3 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 3 states have call predecessors, (86), 3 states have call successors, (86) Word has length 537 [2025-01-09 09:40:49,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:49,988 INFO L225 Difference]: With dead ends: 26804 [2025-01-09 09:40:49,989 INFO L226 Difference]: Without dead ends: 24694 [2025-01-09 09:40:50,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-01-09 09:40:50,010 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 3476 mSDsluCounter, 3151 mSDsCounter, 0 mSdLazyCounter, 3858 mSolverCounterSat, 985 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3476 SdHoareTripleChecker+Valid, 3926 SdHoareTripleChecker+Invalid, 4843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 985 IncrementalHoareTripleChecker+Valid, 3858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:50,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3476 Valid, 3926 Invalid, 4843 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [985 Valid, 3858 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-01-09 09:40:50,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24694 states. [2025-01-09 09:40:51,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24694 to 17027. [2025-01-09 09:40:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17027 states, 13194 states have (on average 1.5085644990147036) internal successors, (19904), 13278 states have internal predecessors, (19904), 3636 states have call successors, (3636), 196 states have call predecessors, (3636), 196 states have return successors, (3636), 3552 states have call predecessors, (3636), 3636 states have call successors, (3636) [2025-01-09 09:40:51,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17027 states to 17027 states and 27176 transitions. [2025-01-09 09:40:51,936 INFO L78 Accepts]: Start accepts. Automaton has 17027 states and 27176 transitions. Word has length 537 [2025-01-09 09:40:51,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:51,938 INFO L471 AbstractCegarLoop]: Abstraction has 17027 states and 27176 transitions. [2025-01-09 09:40:51,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 12 states have internal predecessors, (110), 3 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 3 states have call predecessors, (86), 3 states have call successors, (86) [2025-01-09 09:40:51,938 INFO L276 IsEmpty]: Start isEmpty. Operand 17027 states and 27176 transitions. [2025-01-09 09:40:51,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-01-09 09:40:51,957 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:51,957 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:40:51,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 09:40:51,958 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:51,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:51,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1912330605, now seen corresponding path program 1 times [2025-01-09 09:40:51,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:51,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295858050] [2025-01-09 09:40:51,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:51,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:51,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-01-09 09:40:52,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-01-09 09:40:52,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:52,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:53,720 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-01-09 09:40:53,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:53,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295858050] [2025-01-09 09:40:53,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295858050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:53,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:53,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:40:53,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245083810] [2025-01-09 09:40:53,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:53,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:40:53,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:53,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:40:53,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:40:53,725 INFO L87 Difference]: Start difference. First operand 17027 states and 27176 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:40:55,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:55,692 INFO L93 Difference]: Finished difference Result 38181 states and 59918 transitions. [2025-01-09 09:40:55,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 09:40:55,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 537 [2025-01-09 09:40:55,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:55,781 INFO L225 Difference]: With dead ends: 38181 [2025-01-09 09:40:55,782 INFO L226 Difference]: Without dead ends: 21157 [2025-01-09 09:40:55,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:40:55,825 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 56 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:55,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1630 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:40:55,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21157 states. [2025-01-09 09:40:58,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21157 to 21059. [2025-01-09 09:40:58,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21059 states, 16266 states have (on average 1.4597319562277142) internal successors, (23744), 16446 states have internal predecessors, (23744), 4404 states have call successors, (4404), 388 states have call predecessors, (4404), 388 states have return successors, (4404), 4224 states have call predecessors, (4404), 4404 states have call successors, (4404) [2025-01-09 09:40:58,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21059 states to 21059 states and 32552 transitions. [2025-01-09 09:40:58,342 INFO L78 Accepts]: Start accepts. Automaton has 21059 states and 32552 transitions. Word has length 537 [2025-01-09 09:40:58,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:58,343 INFO L471 AbstractCegarLoop]: Abstraction has 21059 states and 32552 transitions. [2025-01-09 09:40:58,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:40:58,344 INFO L276 IsEmpty]: Start isEmpty. Operand 21059 states and 32552 transitions. [2025-01-09 09:40:58,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-01-09 09:40:58,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:58,368 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:40:58,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 09:40:58,369 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:58,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:58,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1371519441, now seen corresponding path program 1 times [2025-01-09 09:40:58,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:58,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710845319] [2025-01-09 09:40:58,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:58,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:58,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-01-09 09:40:58,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-01-09 09:40:58,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:58,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:58,574 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-01-09 09:40:58,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:58,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710845319] [2025-01-09 09:40:58,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710845319] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:58,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:58,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:40:58,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473442410] [2025-01-09 09:40:58,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:58,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:40:58,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:58,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:40:58,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:40:58,578 INFO L87 Difference]: Start difference. First operand 21059 states and 32552 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:41:00,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:41:00,016 INFO L93 Difference]: Finished difference Result 38864 states and 60226 transitions. [2025-01-09 09:41:00,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:41:00,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 537 [2025-01-09 09:41:00,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:41:00,106 INFO L225 Difference]: With dead ends: 38864 [2025-01-09 09:41:00,106 INFO L226 Difference]: Without dead ends: 17808 [2025-01-09 09:41:00,155 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-01-09 09:41:00,156 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 0 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:41:00,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 818 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:41:00,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17808 states. [2025-01-09 09:41:01,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17808 to 17808. [2025-01-09 09:41:01,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17808 states, 13775 states have (on average 1.4731760435571688) internal successors, (20293), 13860 states have internal predecessors, (20293), 3644 states have call successors, (3644), 388 states have call predecessors, (3644), 388 states have return successors, (3644), 3559 states have call predecessors, (3644), 3644 states have call successors, (3644) [2025-01-09 09:41:01,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17808 states to 17808 states and 27581 transitions. [2025-01-09 09:41:01,513 INFO L78 Accepts]: Start accepts. Automaton has 17808 states and 27581 transitions. Word has length 537 [2025-01-09 09:41:01,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:41:01,514 INFO L471 AbstractCegarLoop]: Abstraction has 17808 states and 27581 transitions. [2025-01-09 09:41:01,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:41:01,515 INFO L276 IsEmpty]: Start isEmpty. Operand 17808 states and 27581 transitions. [2025-01-09 09:41:01,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-01-09 09:41:01,528 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:41:01,528 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:41:01,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 09:41:01,529 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:41:01,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:41:01,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1883816700, now seen corresponding path program 1 times [2025-01-09 09:41:01,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:41:01,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678574680] [2025-01-09 09:41:01,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:41:01,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:41:01,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-01-09 09:41:02,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-01-09 09:41:02,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:41:02,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 09:41:02,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [851549619] [2025-01-09 09:41:02,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:41:02,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:41:02,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:41:02,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:41:02,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 09:41:02,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-01-09 09:41:02,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-01-09 09:41:02,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:41:02,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:41:02,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 1197 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 09:41:02,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:41:04,395 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 1233 proven. 9 refuted. 0 times theorem prover too weak. 13378 trivial. 0 not checked. [2025-01-09 09:41:04,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:41:04,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:41:04,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678574680] [2025-01-09 09:41:04,605 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 09:41:04,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851549619] [2025-01-09 09:41:04,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851549619] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:41:04,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:41:04,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-01-09 09:41:04,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744216032] [2025-01-09 09:41:04,606 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 09:41:04,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:41:04,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:41:04,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:41:04,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:41:04,608 INFO L87 Difference]: Start difference. First operand 17808 states and 27581 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 5 states have internal predecessors, (118), 2 states have call successors, (86), 2 states have call predecessors, (86), 3 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-01-09 09:41:07,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:41:07,446 INFO L93 Difference]: Finished difference Result 53824 states and 83115 transitions. [2025-01-09 09:41:07,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 09:41:07,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 5 states have internal predecessors, (118), 2 states have call successors, (86), 2 states have call predecessors, (86), 3 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) Word has length 539 [2025-01-09 09:41:07,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:41:07,602 INFO L225 Difference]: With dead ends: 53824 [2025-01-09 09:41:07,602 INFO L226 Difference]: Without dead ends: 36032 [2025-01-09 09:41:07,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 604 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:41:07,648 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 422 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:41:07,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1201 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:41:07,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36032 states. [2025-01-09 09:41:10,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36032 to 35217. [2025-01-09 09:41:10,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35217 states, 27148 states have (on average 1.4618388094887285) internal successors, (39686), 27317 states have internal predecessors, (39686), 7280 states have call successors, (7280), 788 states have call predecessors, (7280), 788 states have return successors, (7280), 7111 states have call predecessors, (7280), 7280 states have call successors, (7280) [2025-01-09 09:41:10,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35217 states to 35217 states and 54246 transitions. [2025-01-09 09:41:10,744 INFO L78 Accepts]: Start accepts. Automaton has 35217 states and 54246 transitions. Word has length 539 [2025-01-09 09:41:10,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:41:10,745 INFO L471 AbstractCegarLoop]: Abstraction has 35217 states and 54246 transitions. [2025-01-09 09:41:10,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 5 states have internal predecessors, (118), 2 states have call successors, (86), 2 states have call predecessors, (86), 3 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-01-09 09:41:10,745 INFO L276 IsEmpty]: Start isEmpty. Operand 35217 states and 54246 transitions. [2025-01-09 09:41:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-01-09 09:41:10,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:41:10,769 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:41:10,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 09:41:10,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 09:41:10,973 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:41:10,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:41:10,974 INFO L85 PathProgramCache]: Analyzing trace with hash 784182464, now seen corresponding path program 1 times [2025-01-09 09:41:10,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:41:10,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508556135] [2025-01-09 09:41:10,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:41:10,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:41:11,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-01-09 09:41:11,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-01-09 09:41:11,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:41:11,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:41:11,367 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-01-09 09:41:11,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:41:11,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508556135] [2025-01-09 09:41:11,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508556135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:41:11,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:41:11,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:41:11,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728265130] [2025-01-09 09:41:11,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:41:11,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:41:11,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:41:11,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:41:11,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:41:11,371 INFO L87 Difference]: Start difference. First operand 35217 states and 54246 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:41:16,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:41:16,097 INFO L93 Difference]: Finished difference Result 81752 states and 125800 transitions. [2025-01-09 09:41:16,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:41:16,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 540 [2025-01-09 09:41:16,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:41:16,324 INFO L225 Difference]: With dead ends: 81752 [2025-01-09 09:41:16,325 INFO L226 Difference]: Without dead ends: 63960 [2025-01-09 09:41:16,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:41:16,379 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 639 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:41:16,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1346 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:41:16,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63960 states.