./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-5.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_operatoramount_amount250_file-5.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 4639c6b0fb22706997cf521ef330c95d8a0fb320eefb7d80395f3064e0e7914f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:24:44,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:24:44,329 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:24:44,333 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:24:44,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:24:44,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:24:44,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:24:44,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:24:44,362 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:24:44,362 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:24:44,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:24:44,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:24:44,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:24:44,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:24:44,364 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:24:44,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:24:44,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:24:44,364 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:24:44,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:24:44,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:24:44,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:24:44,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:24:44,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:24:44,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:24:44,365 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:24:44,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:24:44,365 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:24:44,365 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:24:44,365 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:24:44,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:24:44,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:24:44,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:24:44,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:24:44,366 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:24:44,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:24:44,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:24:44,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:24:44,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:24:44,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:24:44,366 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:24:44,366 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:24:44,367 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:24:44,367 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:24:44,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:24:44,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:24:44,367 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:24:44,367 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:24:44,367 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:24:44,367 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 -> 4639c6b0fb22706997cf521ef330c95d8a0fb320eefb7d80395f3064e0e7914f [2025-01-09 14:24:44,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:24:44,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:24:44,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:24:44,604 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:24:44,605 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:24:44,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-5.i [2025-01-09 14:24:45,758 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c7f4865e/366218d6740a457bb761745a7a51f3ae/FLAGc2b708ba9 [2025-01-09 14:24:46,019 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:24:46,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-5.i [2025-01-09 14:24:46,028 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c7f4865e/366218d6740a457bb761745a7a51f3ae/FLAGc2b708ba9 [2025-01-09 14:24:46,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c7f4865e/366218d6740a457bb761745a7a51f3ae [2025-01-09 14:24:46,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:24:46,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:24:46,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:24:46,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:24:46,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:24:46,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:24:46" (1/1) ... [2025-01-09 14:24:46,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49603888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:46, skipping insertion in model container [2025-01-09 14:24:46,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:24:46" (1/1) ... [2025-01-09 14:24:46,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:24:46,218 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_operatoramount_amount250_file-5.i[915,928] [2025-01-09 14:24:46,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:24:46,382 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:24:46,397 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_operatoramount_amount250_file-5.i[915,928] [2025-01-09 14:24:46,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:24:46,473 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:24:46,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:46 WrapperNode [2025-01-09 14:24:46,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:24:46,474 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:24:46,474 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:24:46,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:24:46,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:46" (1/1) ... [2025-01-09 14:24:46,489 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:46" (1/1) ... [2025-01-09 14:24:46,542 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 412 [2025-01-09 14:24:46,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:24:46,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:24:46,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:24:46,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:24:46,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:46" (1/1) ... [2025-01-09 14:24:46,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:46" (1/1) ... [2025-01-09 14:24:46,568 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:46" (1/1) ... [2025-01-09 14:24:46,604 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 14:24:46,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:46" (1/1) ... [2025-01-09 14:24:46,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:46" (1/1) ... [2025-01-09 14:24:46,626 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:46" (1/1) ... [2025-01-09 14:24:46,633 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:46" (1/1) ... [2025-01-09 14:24:46,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:46" (1/1) ... [2025-01-09 14:24:46,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:46" (1/1) ... [2025-01-09 14:24:46,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:46" (1/1) ... [2025-01-09 14:24:46,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:24:46,658 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:24:46,660 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:24:46,660 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:24:46,660 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:46" (1/1) ... [2025-01-09 14:24:46,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:24:46,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:24:46,689 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 14:24:46,690 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 14:24:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:24:46,710 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:24:46,710 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:24:46,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:24:46,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:24:46,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:24:46,799 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:24:46,800 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:24:47,382 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-01-09 14:24:47,383 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:24:47,392 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:24:47,394 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:24:47,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:24:47 BoogieIcfgContainer [2025-01-09 14:24:47,395 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:24:47,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:24:47,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:24:47,400 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:24:47,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:24:46" (1/3) ... [2025-01-09 14:24:47,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dfe7ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:24:47, skipping insertion in model container [2025-01-09 14:24:47,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:46" (2/3) ... [2025-01-09 14:24:47,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dfe7ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:24:47, skipping insertion in model container [2025-01-09 14:24:47,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:24:47" (3/3) ... [2025-01-09 14:24:47,402 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-5.i [2025-01-09 14:24:47,412 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:24:47,414 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-5.i that has 2 procedures, 168 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:24:47,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:24:47,454 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;@6e266b46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:24:47,455 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:24:47,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 168 states, 130 states have (on average 1.5384615384615385) internal successors, (200), 131 states have internal predecessors, (200), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 14:24:47,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-01-09 14:24:47,469 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:47,470 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:24:47,470 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:47,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:47,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1954495469, now seen corresponding path program 1 times [2025-01-09 14:24:47,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:47,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408574650] [2025-01-09 14:24:47,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:47,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:47,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-01-09 14:24:47,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-01-09 14:24:47,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:47,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-01-09 14:24:47,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:47,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408574650] [2025-01-09 14:24:47,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408574650] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:24:47,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723712115] [2025-01-09 14:24:47,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:47,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:24:47,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:24:47,839 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 14:24:47,843 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 14:24:47,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-01-09 14:24:48,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-01-09 14:24:48,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:48,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:48,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:24:48,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:24:48,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-01-09 14:24:48,088 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:24:48,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723712115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:24:48,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:24:48,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:24:48,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198187511] [2025-01-09 14:24:48,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:24:48,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:24:48,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:48,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:24:48,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:24:48,113 INFO L87 Difference]: Start difference. First operand has 168 states, 130 states have (on average 1.5384615384615385) internal successors, (200), 131 states have internal predecessors, (200), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 14:24:48,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:48,139 INFO L93 Difference]: Finished difference Result 330 states and 570 transitions. [2025-01-09 14:24:48,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:24:48,140 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 249 [2025-01-09 14:24:48,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:48,145 INFO L225 Difference]: With dead ends: 330 [2025-01-09 14:24:48,145 INFO L226 Difference]: Without dead ends: 165 [2025-01-09 14:24:48,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 250 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 14:24:48,149 INFO L435 NwaCegarLoop]: 263 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, 263 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 14:24:48,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:24:48,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-01-09 14:24:48,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-01-09 14:24:48,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 128 states have (on average 1.5078125) internal successors, (193), 128 states have internal predecessors, (193), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 14:24:48,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 263 transitions. [2025-01-09 14:24:48,181 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 263 transitions. Word has length 249 [2025-01-09 14:24:48,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:48,182 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 263 transitions. [2025-01-09 14:24:48,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 14:24:48,182 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 263 transitions. [2025-01-09 14:24:48,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-01-09 14:24:48,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:48,184 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:24:48,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:24:48,385 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 14:24:48,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:48,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:48,386 INFO L85 PathProgramCache]: Analyzing trace with hash 450803895, now seen corresponding path program 1 times [2025-01-09 14:24:48,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:48,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705658841] [2025-01-09 14:24:48,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:48,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:48,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-01-09 14:24:48,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-01-09 14:24:48,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:48,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:48,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 14:24:48,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:48,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705658841] [2025-01-09 14:24:48,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705658841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:24:48,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:24:48,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:24:48,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369032824] [2025-01-09 14:24:48,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:24:48,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:24:48,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:48,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:24:48,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:24:48,620 INFO L87 Difference]: Start difference. First operand 165 states and 263 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:24:48,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:48,706 INFO L93 Difference]: Finished difference Result 462 states and 735 transitions. [2025-01-09 14:24:48,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:24:48,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 249 [2025-01-09 14:24:48,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:48,709 INFO L225 Difference]: With dead ends: 462 [2025-01-09 14:24:48,709 INFO L226 Difference]: Without dead ends: 300 [2025-01-09 14:24:48,710 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 14:24:48,711 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 200 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:48,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 541 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:24:48,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-01-09 14:24:48,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 185. [2025-01-09 14:24:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 148 states have (on average 1.5202702702702702) internal successors, (225), 148 states have internal predecessors, (225), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 14:24:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 295 transitions. [2025-01-09 14:24:48,729 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 295 transitions. Word has length 249 [2025-01-09 14:24:48,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:48,731 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 295 transitions. [2025-01-09 14:24:48,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:24:48,732 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 295 transitions. [2025-01-09 14:24:48,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-01-09 14:24:48,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:48,737 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:24:48,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:24:48,737 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:48,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:48,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2115422281, now seen corresponding path program 1 times [2025-01-09 14:24:48,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:48,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613709954] [2025-01-09 14:24:48,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:48,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:48,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-01-09 14:24:48,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-01-09 14:24:48,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:48,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:49,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 14:24:49,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:49,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613709954] [2025-01-09 14:24:49,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613709954] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:24:49,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:24:49,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:24:49,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373851437] [2025-01-09 14:24:49,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:24:49,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:24:49,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:49,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:24:49,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:24:49,465 INFO L87 Difference]: Start difference. First operand 185 states and 295 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:24:50,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:50,085 INFO L93 Difference]: Finished difference Result 654 states and 1046 transitions. [2025-01-09 14:24:50,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:24:50,086 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 249 [2025-01-09 14:24:50,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:50,090 INFO L225 Difference]: With dead ends: 654 [2025-01-09 14:24:50,091 INFO L226 Difference]: Without dead ends: 472 [2025-01-09 14:24:50,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:24:50,094 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 549 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:50,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1340 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:24:50,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-01-09 14:24:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 393. [2025-01-09 14:24:50,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 320 states have (on average 1.525) internal successors, (488), 320 states have internal predecessors, (488), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 14:24:50,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 628 transitions. [2025-01-09 14:24:50,146 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 628 transitions. Word has length 249 [2025-01-09 14:24:50,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:50,147 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 628 transitions. [2025-01-09 14:24:50,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:24:50,147 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 628 transitions. [2025-01-09 14:24:50,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-01-09 14:24:50,149 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:50,149 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:24:50,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:24:50,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:50,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:50,152 INFO L85 PathProgramCache]: Analyzing trace with hash -631396959, now seen corresponding path program 1 times [2025-01-09 14:24:50,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:50,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785906381] [2025-01-09 14:24:50,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:50,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:50,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-01-09 14:24:50,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-01-09 14:24:50,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:50,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:50,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 14:24:50,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:50,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785906381] [2025-01-09 14:24:50,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785906381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:24:50,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:24:50,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:24:50,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851342923] [2025-01-09 14:24:50,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:24:50,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:24:50,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:50,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:24:50,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:24:50,597 INFO L87 Difference]: Start difference. First operand 393 states and 628 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:24:50,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:50,818 INFO L93 Difference]: Finished difference Result 1138 states and 1830 transitions. [2025-01-09 14:24:50,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:24:50,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 250 [2025-01-09 14:24:50,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:50,824 INFO L225 Difference]: With dead ends: 1138 [2025-01-09 14:24:50,824 INFO L226 Difference]: Without dead ends: 824 [2025-01-09 14:24:50,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:24:50,826 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 344 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:50,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 856 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:24:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2025-01-09 14:24:50,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 703. [2025-01-09 14:24:50,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 594 states have (on average 1.5387205387205387) internal successors, (914), 594 states have internal predecessors, (914), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-01-09 14:24:50,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1124 transitions. [2025-01-09 14:24:50,869 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1124 transitions. Word has length 250 [2025-01-09 14:24:50,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:50,869 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 1124 transitions. [2025-01-09 14:24:50,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:24:50,870 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1124 transitions. [2025-01-09 14:24:50,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-01-09 14:24:50,872 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:50,872 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:24:50,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:24:50,872 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:50,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:50,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1643497183, now seen corresponding path program 1 times [2025-01-09 14:24:50,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:50,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217610624] [2025-01-09 14:24:50,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:50,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:50,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-01-09 14:24:50,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-01-09 14:24:50,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:50,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:51,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 14:24:51,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:51,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217610624] [2025-01-09 14:24:51,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217610624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:24:51,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:24:51,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:24:51,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741862875] [2025-01-09 14:24:51,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:24:51,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:24:51,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:51,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:24:51,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:24:51,295 INFO L87 Difference]: Start difference. First operand 703 states and 1124 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:24:51,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:51,538 INFO L93 Difference]: Finished difference Result 1755 states and 2814 transitions. [2025-01-09 14:24:51,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:24:51,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 251 [2025-01-09 14:24:51,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:51,545 INFO L225 Difference]: With dead ends: 1755 [2025-01-09 14:24:51,545 INFO L226 Difference]: Without dead ends: 1340 [2025-01-09 14:24:51,546 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 14:24:51,547 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 177 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:51,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 632 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:24:51,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2025-01-09 14:24:51,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1291. [2025-01-09 14:24:51,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1110 states have (on average 1.5387387387387388) internal successors, (1708), 1110 states have internal predecessors, (1708), 175 states have call successors, (175), 5 states have call predecessors, (175), 5 states have return successors, (175), 175 states have call predecessors, (175), 175 states have call successors, (175) [2025-01-09 14:24:51,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 2058 transitions. [2025-01-09 14:24:51,609 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 2058 transitions. Word has length 251 [2025-01-09 14:24:51,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:51,610 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 2058 transitions. [2025-01-09 14:24:51,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:24:51,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2058 transitions. [2025-01-09 14:24:51,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-01-09 14:24:51,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:51,613 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:24:51,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:24:51,613 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:51,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:51,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2064664099, now seen corresponding path program 1 times [2025-01-09 14:24:51,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:51,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202461628] [2025-01-09 14:24:51,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:51,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:51,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-01-09 14:24:51,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-01-09 14:24:51,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:51,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:52,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 14:24:52,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:52,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202461628] [2025-01-09 14:24:52,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202461628] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:24:52,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:24:52,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:24:52,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160836294] [2025-01-09 14:24:52,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:24:52,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:24:52,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:52,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:24:52,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:24:52,087 INFO L87 Difference]: Start difference. First operand 1291 states and 2058 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:24:52,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:52,428 INFO L93 Difference]: Finished difference Result 3660 states and 5771 transitions. [2025-01-09 14:24:52,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:24:52,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 251 [2025-01-09 14:24:52,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:52,440 INFO L225 Difference]: With dead ends: 3660 [2025-01-09 14:24:52,440 INFO L226 Difference]: Without dead ends: 2463 [2025-01-09 14:24:52,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:24:52,444 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 667 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:52,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1252 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:24:52,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states. [2025-01-09 14:24:52,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 2175. [2025-01-09 14:24:52,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2175 states, 1909 states have (on average 1.5243583027763228) internal successors, (2910), 1913 states have internal predecessors, (2910), 255 states have call successors, (255), 10 states have call predecessors, (255), 10 states have return successors, (255), 251 states have call predecessors, (255), 255 states have call successors, (255) [2025-01-09 14:24:52,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2175 states to 2175 states and 3420 transitions. [2025-01-09 14:24:52,568 INFO L78 Accepts]: Start accepts. Automaton has 2175 states and 3420 transitions. Word has length 251 [2025-01-09 14:24:52,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:52,569 INFO L471 AbstractCegarLoop]: Abstraction has 2175 states and 3420 transitions. [2025-01-09 14:24:52,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:24:52,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2175 states and 3420 transitions. [2025-01-09 14:24:52,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-01-09 14:24:52,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:52,573 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:24:52,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:24:52,573 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:52,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:52,573 INFO L85 PathProgramCache]: Analyzing trace with hash -366394589, now seen corresponding path program 1 times [2025-01-09 14:24:52,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:52,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214322126] [2025-01-09 14:24:52,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:52,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:52,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-01-09 14:24:52,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-01-09 14:24:52,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:52,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:52,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 14:24:52,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:52,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214322126] [2025-01-09 14:24:52,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214322126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:24:52,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:24:52,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:24:52,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084194947] [2025-01-09 14:24:52,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:24:52,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:24:52,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:52,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:24:52,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:24:52,906 INFO L87 Difference]: Start difference. First operand 2175 states and 3420 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:24:53,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:53,206 INFO L93 Difference]: Finished difference Result 6554 states and 10311 transitions. [2025-01-09 14:24:53,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:24:53,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 251 [2025-01-09 14:24:53,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:53,230 INFO L225 Difference]: With dead ends: 6554 [2025-01-09 14:24:53,230 INFO L226 Difference]: Without dead ends: 5175 [2025-01-09 14:24:53,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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 14:24:53,237 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 390 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:53,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 909 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:24:53,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5175 states. [2025-01-09 14:24:53,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5175 to 3923. [2025-01-09 14:24:53,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3923 states, 3505 states have (on average 1.536947218259629) internal successors, (5387), 3517 states have internal predecessors, (5387), 399 states have call successors, (399), 18 states have call predecessors, (399), 18 states have return successors, (399), 387 states have call predecessors, (399), 399 states have call successors, (399) [2025-01-09 14:24:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 6185 transitions. [2025-01-09 14:24:53,428 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 6185 transitions. Word has length 251 [2025-01-09 14:24:53,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:53,429 INFO L471 AbstractCegarLoop]: Abstraction has 3923 states and 6185 transitions. [2025-01-09 14:24:53,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:24:53,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 6185 transitions. [2025-01-09 14:24:53,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-01-09 14:24:53,434 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:53,434 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:24:53,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:24:53,434 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:53,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:53,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1335687273, now seen corresponding path program 1 times [2025-01-09 14:24:53,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:53,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428497324] [2025-01-09 14:24:53,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:53,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:53,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-01-09 14:24:53,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-01-09 14:24:53,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:53,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 14:24:53,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:53,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428497324] [2025-01-09 14:24:53,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428497324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:24:53,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:24:53,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:24:53,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145527249] [2025-01-09 14:24:53,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:24:53,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:24:53,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:53,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:24:53,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:24:53,688 INFO L87 Difference]: Start difference. First operand 3923 states and 6185 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:24:54,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:54,008 INFO L93 Difference]: Finished difference Result 7628 states and 12003 transitions. [2025-01-09 14:24:54,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:24:54,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 251 [2025-01-09 14:24:54,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:54,049 INFO L225 Difference]: With dead ends: 7628 [2025-01-09 14:24:54,049 INFO L226 Difference]: Without dead ends: 4694 [2025-01-09 14:24:54,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:24:54,053 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 289 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:54,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1114 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:24:54,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4694 states. [2025-01-09 14:24:54,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4694 to 3919. [2025-01-09 14:24:54,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3919 states, 3501 states have (on average 1.5364181662382177) internal successors, (5379), 3513 states have internal predecessors, (5379), 399 states have call successors, (399), 18 states have call predecessors, (399), 18 states have return successors, (399), 387 states have call predecessors, (399), 399 states have call successors, (399) [2025-01-09 14:24:54,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3919 states and 6177 transitions. [2025-01-09 14:24:54,195 INFO L78 Accepts]: Start accepts. Automaton has 3919 states and 6177 transitions. Word has length 251 [2025-01-09 14:24:54,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:54,195 INFO L471 AbstractCegarLoop]: Abstraction has 3919 states and 6177 transitions. [2025-01-09 14:24:54,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:24:54,196 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 6177 transitions. [2025-01-09 14:24:54,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-01-09 14:24:54,201 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:54,201 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:24:54,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:24:54,201 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:54,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:54,202 INFO L85 PathProgramCache]: Analyzing trace with hash -800752459, now seen corresponding path program 1 times [2025-01-09 14:24:54,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:54,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080395801] [2025-01-09 14:24:54,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:54,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:54,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-01-09 14:24:54,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-01-09 14:24:54,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:54,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:54,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 36 proven. 66 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-01-09 14:24:54,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:54,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080395801] [2025-01-09 14:24:54,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080395801] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:24:54,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948302424] [2025-01-09 14:24:54,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:54,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:24:54,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:24:54,643 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 14:24:54,650 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 14:24:54,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-01-09 14:24:54,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-01-09 14:24:54,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:54,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:54,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:24:54,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:24:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1212 proven. 45 refuted. 0 times theorem prover too weak. 1123 trivial. 0 not checked. [2025-01-09 14:24:55,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:24:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 57 proven. 45 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-01-09 14:24:55,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948302424] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:24:55,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:24:55,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2025-01-09 14:24:55,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845085160] [2025-01-09 14:24:55,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:24:55,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:24:55,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:55,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:24:55,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:24:55,292 INFO L87 Difference]: Start difference. First operand 3919 states and 6177 transitions. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 4 states have call successors, (85), 2 states have call predecessors, (85), 4 states have return successors, (86), 4 states have call predecessors, (86), 4 states have call successors, (86) [2025-01-09 14:24:56,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:56,173 INFO L93 Difference]: Finished difference Result 8378 states and 13106 transitions. [2025-01-09 14:24:56,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 14:24:56,174 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 4 states have call successors, (85), 2 states have call predecessors, (85), 4 states have return successors, (86), 4 states have call predecessors, (86), 4 states have call successors, (86) Word has length 252 [2025-01-09 14:24:56,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:56,195 INFO L225 Difference]: With dead ends: 8378 [2025-01-09 14:24:56,195 INFO L226 Difference]: Without dead ends: 4536 [2025-01-09 14:24:56,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 501 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2025-01-09 14:24:56,204 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 1153 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:56,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 1474 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:24:56,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2025-01-09 14:24:56,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 4022. [2025-01-09 14:24:56,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4022 states, 3526 states have (on average 1.5082246171298923) internal successors, (5318), 3534 states have internal predecessors, (5318), 459 states have call successors, (459), 36 states have call predecessors, (459), 36 states have return successors, (459), 451 states have call predecessors, (459), 459 states have call successors, (459) [2025-01-09 14:24:56,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 4022 states and 6236 transitions. [2025-01-09 14:24:56,389 INFO L78 Accepts]: Start accepts. Automaton has 4022 states and 6236 transitions. Word has length 252 [2025-01-09 14:24:56,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:56,390 INFO L471 AbstractCegarLoop]: Abstraction has 4022 states and 6236 transitions. [2025-01-09 14:24:56,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 4 states have call successors, (85), 2 states have call predecessors, (85), 4 states have return successors, (86), 4 states have call predecessors, (86), 4 states have call successors, (86) [2025-01-09 14:24:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 4022 states and 6236 transitions. [2025-01-09 14:24:56,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-09 14:24:56,395 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:56,395 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:24:56,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 14:24:56,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:24:56,596 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:56,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:56,597 INFO L85 PathProgramCache]: Analyzing trace with hash 74228062, now seen corresponding path program 1 times [2025-01-09 14:24:56,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:56,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407545556] [2025-01-09 14:24:56,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:56,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:56,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 14:24:56,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 14:24:56,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:56,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:56,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 14:24:56,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:56,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407545556] [2025-01-09 14:24:56,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407545556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:24:56,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:24:56,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:24:56,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986084735] [2025-01-09 14:24:56,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:24:56,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:24:56,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:56,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:24:56,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:24:56,746 INFO L87 Difference]: Start difference. First operand 4022 states and 6236 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 14:24:56,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:56,995 INFO L93 Difference]: Finished difference Result 9538 states and 14814 transitions. [2025-01-09 14:24:56,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:24:56,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 254 [2025-01-09 14:24:56,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:57,028 INFO L225 Difference]: With dead ends: 9538 [2025-01-09 14:24:57,028 INFO L226 Difference]: Without dead ends: 6820 [2025-01-09 14:24:57,036 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 14:24:57,036 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 340 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:57,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 480 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:24:57,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6820 states. [2025-01-09 14:24:57,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6820 to 6754. [2025-01-09 14:24:57,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6754 states, 5802 states have (on average 1.4998276456394346) internal successors, (8702), 5818 states have internal predecessors, (8702), 883 states have call successors, (883), 68 states have call predecessors, (883), 68 states have return successors, (883), 867 states have call predecessors, (883), 883 states have call successors, (883) [2025-01-09 14:24:57,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6754 states to 6754 states and 10468 transitions. [2025-01-09 14:24:57,344 INFO L78 Accepts]: Start accepts. Automaton has 6754 states and 10468 transitions. Word has length 254 [2025-01-09 14:24:57,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:57,345 INFO L471 AbstractCegarLoop]: Abstraction has 6754 states and 10468 transitions. [2025-01-09 14:24:57,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 14:24:57,345 INFO L276 IsEmpty]: Start isEmpty. Operand 6754 states and 10468 transitions. [2025-01-09 14:24:57,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-09 14:24:57,351 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:57,351 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:24:57,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:24:57,351 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:57,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:57,352 INFO L85 PathProgramCache]: Analyzing trace with hash -383819170, now seen corresponding path program 1 times [2025-01-09 14:24:57,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:57,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446259607] [2025-01-09 14:24:57,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:57,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:57,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 14:24:57,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 14:24:57,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:57,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:57,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 66 proven. 36 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-01-09 14:24:57,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:57,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446259607] [2025-01-09 14:24:57,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446259607] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:24:57,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018041911] [2025-01-09 14:24:57,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:57,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:24:57,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:24:57,864 INFO L229 MonitoredProcess]: Starting monitored process 4 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 14:24:57,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:24:58,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 14:24:58,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 14:24:58,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:58,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:58,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 14:24:58,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:24:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1134 proven. 36 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2025-01-09 14:24:58,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:24:58,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 66 proven. 36 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-01-09 14:24:58,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018041911] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:24:58,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:24:58,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-01-09 14:24:58,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801304232] [2025-01-09 14:24:58,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:24:58,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:24:58,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:58,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:24:58,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:24:58,549 INFO L87 Difference]: Start difference. First operand 6754 states and 10468 transitions. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-01-09 14:24:59,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:59,432 INFO L93 Difference]: Finished difference Result 18582 states and 28531 transitions. [2025-01-09 14:24:59,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:24:59,433 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 254 [2025-01-09 14:24:59,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:59,469 INFO L225 Difference]: With dead ends: 18582 [2025-01-09 14:24:59,469 INFO L226 Difference]: Without dead ends: 12836 [2025-01-09 14:24:59,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 502 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:24:59,484 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 816 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:59,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1277 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:24:59,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12836 states. [2025-01-09 14:24:59,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12836 to 12620. [2025-01-09 14:24:59,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12620 states, 10947 states have (on average 1.4759294783959076) internal successors, (16157), 10995 states have internal predecessors, (16157), 1523 states have call successors, (1523), 149 states have call predecessors, (1523), 149 states have return successors, (1523), 1475 states have call predecessors, (1523), 1523 states have call successors, (1523) [2025-01-09 14:24:59,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12620 states to 12620 states and 19203 transitions. [2025-01-09 14:24:59,939 INFO L78 Accepts]: Start accepts. Automaton has 12620 states and 19203 transitions. Word has length 254 [2025-01-09 14:24:59,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:59,939 INFO L471 AbstractCegarLoop]: Abstraction has 12620 states and 19203 transitions. [2025-01-09 14:24:59,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-01-09 14:24:59,939 INFO L276 IsEmpty]: Start isEmpty. Operand 12620 states and 19203 transitions. [2025-01-09 14:24:59,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-09 14:24:59,947 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:59,948 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:24:59,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 14:25:00,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:25:00,148 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:00,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:00,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1215946402, now seen corresponding path program 1 times [2025-01-09 14:25:00,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:00,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604094654] [2025-01-09 14:25:00,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:00,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:00,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 14:25:00,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 14:25:00,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:00,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 14:25:00,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:00,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604094654] [2025-01-09 14:25:00,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604094654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:00,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:00,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:25:00,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915044601] [2025-01-09 14:25:00,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:00,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:25:00,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:00,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:25:00,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:25:00,911 INFO L87 Difference]: Start difference. First operand 12620 states and 19203 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:25:03,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:03,775 INFO L93 Difference]: Finished difference Result 57142 states and 85612 transitions. [2025-01-09 14:25:03,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 14:25:03,775 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 254 [2025-01-09 14:25:03,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:03,903 INFO L225 Difference]: With dead ends: 57142 [2025-01-09 14:25:03,904 INFO L226 Difference]: Without dead ends: 46768 [2025-01-09 14:25:03,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:25:03,933 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 1052 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:03,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 1452 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 14:25:03,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46768 states. [2025-01-09 14:25:04,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46768 to 22248. [2025-01-09 14:25:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22248 states, 20167 states have (on average 1.5030991223285566) internal successors, (30313), 20231 states have internal predecessors, (30313), 1875 states have call successors, (1875), 205 states have call predecessors, (1875), 205 states have return successors, (1875), 1811 states have call predecessors, (1875), 1875 states have call successors, (1875) [2025-01-09 14:25:04,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22248 states to 22248 states and 34063 transitions. [2025-01-09 14:25:04,957 INFO L78 Accepts]: Start accepts. Automaton has 22248 states and 34063 transitions. Word has length 254 [2025-01-09 14:25:04,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:04,958 INFO L471 AbstractCegarLoop]: Abstraction has 22248 states and 34063 transitions. [2025-01-09 14:25:04,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:25:04,958 INFO L276 IsEmpty]: Start isEmpty. Operand 22248 states and 34063 transitions. [2025-01-09 14:25:04,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-09 14:25:04,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:04,973 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:25:04,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:25:04,973 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:04,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:04,974 INFO L85 PathProgramCache]: Analyzing trace with hash 794869907, now seen corresponding path program 1 times [2025-01-09 14:25:04,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:04,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793899493] [2025-01-09 14:25:04,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:04,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:04,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 14:25:05,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 14:25:05,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:05,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:05,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 14:25:05,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:05,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793899493] [2025-01-09 14:25:05,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793899493] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:05,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:05,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:25:05,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918928561] [2025-01-09 14:25:05,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:05,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:25:05,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:05,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:25:05,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:25:05,235 INFO L87 Difference]: Start difference. First operand 22248 states and 34063 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 14:25:06,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:06,588 INFO L93 Difference]: Finished difference Result 43323 states and 66319 transitions. [2025-01-09 14:25:06,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:25:06,589 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 254 [2025-01-09 14:25:06,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:06,658 INFO L225 Difference]: With dead ends: 43323 [2025-01-09 14:25:06,658 INFO L226 Difference]: Without dead ends: 25164 [2025-01-09 14:25:06,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:25:06,690 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 275 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:06,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1403 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:25:06,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25164 states. [2025-01-09 14:25:07,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25164 to 22328. [2025-01-09 14:25:07,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22328 states, 20247 states have (on average 1.5044697979947645) internal successors, (30461), 20311 states have internal predecessors, (30461), 1875 states have call successors, (1875), 205 states have call predecessors, (1875), 205 states have return successors, (1875), 1811 states have call predecessors, (1875), 1875 states have call successors, (1875) [2025-01-09 14:25:07,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22328 states to 22328 states and 34211 transitions. [2025-01-09 14:25:07,764 INFO L78 Accepts]: Start accepts. Automaton has 22328 states and 34211 transitions. Word has length 254 [2025-01-09 14:25:07,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:07,764 INFO L471 AbstractCegarLoop]: Abstraction has 22328 states and 34211 transitions. [2025-01-09 14:25:07,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 14:25:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand 22328 states and 34211 transitions. [2025-01-09 14:25:07,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-09 14:25:07,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:07,778 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:25:07,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:25:07,778 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:07,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:07,778 INFO L85 PathProgramCache]: Analyzing trace with hash -778185956, now seen corresponding path program 1 times [2025-01-09 14:25:07,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:07,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947525434] [2025-01-09 14:25:07,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:07,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:07,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 14:25:07,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 14:25:07,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:07,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 14:25:07,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:07,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947525434] [2025-01-09 14:25:07,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947525434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:07,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:07,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:25:07,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862701151] [2025-01-09 14:25:07,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:07,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:25:07,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:07,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:25:07,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:25:07,848 INFO L87 Difference]: Start difference. First operand 22328 states and 34211 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:25:08,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:08,692 INFO L93 Difference]: Finished difference Result 42796 states and 65093 transitions. [2025-01-09 14:25:08,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:25:08,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 254 [2025-01-09 14:25:08,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:08,760 INFO L225 Difference]: With dead ends: 42796 [2025-01-09 14:25:08,760 INFO L226 Difference]: Without dead ends: 26714 [2025-01-09 14:25:08,785 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 14:25:08,786 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 218 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:08,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 529 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:25:08,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26714 states. [2025-01-09 14:25:09,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26714 to 26156. [2025-01-09 14:25:09,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26156 states, 22723 states have (on average 1.4632310874444396) internal successors, (33249), 22835 states have internal predecessors, (33249), 3075 states have call successors, (3075), 357 states have call predecessors, (3075), 357 states have return successors, (3075), 2963 states have call predecessors, (3075), 3075 states have call successors, (3075) [2025-01-09 14:25:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26156 states to 26156 states and 39399 transitions. [2025-01-09 14:25:09,884 INFO L78 Accepts]: Start accepts. Automaton has 26156 states and 39399 transitions. Word has length 254 [2025-01-09 14:25:09,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:09,885 INFO L471 AbstractCegarLoop]: Abstraction has 26156 states and 39399 transitions. [2025-01-09 14:25:09,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:25:09,885 INFO L276 IsEmpty]: Start isEmpty. Operand 26156 states and 39399 transitions. [2025-01-09 14:25:09,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-09 14:25:09,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:09,899 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:25:09,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:25:09,900 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:09,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:09,900 INFO L85 PathProgramCache]: Analyzing trace with hash -77121378, now seen corresponding path program 1 times [2025-01-09 14:25:09,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:09,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81800785] [2025-01-09 14:25:09,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:09,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:09,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 14:25:10,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 14:25:10,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:10,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 84 proven. 114 refuted. 0 times theorem prover too weak. 2182 trivial. 0 not checked. [2025-01-09 14:25:10,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:10,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81800785] [2025-01-09 14:25:10,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81800785] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:25:10,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273762224] [2025-01-09 14:25:10,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:10,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:25:10,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:25:10,512 INFO L229 MonitoredProcess]: Starting monitored process 5 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 14:25:10,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:25:10,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 14:25:10,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 14:25:10,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:10,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:10,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 14:25:10,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:25:11,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1204 proven. 114 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2025-01-09 14:25:11,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:25:12,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 84 proven. 117 refuted. 0 times theorem prover too weak. 2179 trivial. 0 not checked. [2025-01-09 14:25:12,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273762224] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:25:12,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:25:12,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 26 [2025-01-09 14:25:12,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7913330] [2025-01-09 14:25:12,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:25:12,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 14:25:12,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:12,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 14:25:12,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2025-01-09 14:25:12,702 INFO L87 Difference]: Start difference. First operand 26156 states and 39399 transitions. Second operand has 26 states, 25 states have (on average 7.76) internal successors, (194), 24 states have internal predecessors, (194), 7 states have call successors, (105), 4 states have call predecessors, (105), 8 states have return successors, (105), 7 states have call predecessors, (105), 7 states have call successors, (105) [2025-01-09 14:25:30,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:30,193 INFO L93 Difference]: Finished difference Result 242600 states and 362170 transitions. [2025-01-09 14:25:30,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2025-01-09 14:25:30,193 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 7.76) internal successors, (194), 24 states have internal predecessors, (194), 7 states have call successors, (105), 4 states have call predecessors, (105), 8 states have return successors, (105), 7 states have call predecessors, (105), 7 states have call successors, (105) Word has length 254 [2025-01-09 14:25:30,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:30,798 INFO L225 Difference]: With dead ends: 242600 [2025-01-09 14:25:30,798 INFO L226 Difference]: Without dead ends: 218562 [2025-01-09 14:25:30,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6710 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3752, Invalid=12760, Unknown=0, NotChecked=0, Total=16512 [2025-01-09 14:25:30,870 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 3882 mSDsluCounter, 4286 mSDsCounter, 0 mSdLazyCounter, 4050 mSolverCounterSat, 1214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3911 SdHoareTripleChecker+Valid, 4749 SdHoareTripleChecker+Invalid, 5264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1214 IncrementalHoareTripleChecker+Valid, 4050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:30,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3911 Valid, 4749 Invalid, 5264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1214 Valid, 4050 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 14:25:30,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218562 states. [2025-01-09 14:25:36,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218562 to 149402. [2025-01-09 14:25:36,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149402 states, 141390 states have (on average 1.5248178796237357) internal successors, (215594), 141754 states have internal predecessors, (215594), 6971 states have call successors, (6971), 1040 states have call predecessors, (6971), 1040 states have return successors, (6971), 6607 states have call predecessors, (6971), 6971 states have call successors, (6971) [2025-01-09 14:25:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149402 states to 149402 states and 229536 transitions. [2025-01-09 14:25:36,572 INFO L78 Accepts]: Start accepts. Automaton has 149402 states and 229536 transitions. Word has length 254 [2025-01-09 14:25:36,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:36,572 INFO L471 AbstractCegarLoop]: Abstraction has 149402 states and 229536 transitions. [2025-01-09 14:25:36,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 7.76) internal successors, (194), 24 states have internal predecessors, (194), 7 states have call successors, (105), 4 states have call predecessors, (105), 8 states have return successors, (105), 7 states have call predecessors, (105), 7 states have call successors, (105) [2025-01-09 14:25:36,573 INFO L276 IsEmpty]: Start isEmpty. Operand 149402 states and 229536 transitions. [2025-01-09 14:25:36,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-01-09 14:25:36,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:36,648 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:25:36,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 14:25:36,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 14:25:36,849 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:36,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:36,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1107289028, now seen corresponding path program 1 times [2025-01-09 14:25:36,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:36,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116226012] [2025-01-09 14:25:36,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:36,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:36,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-01-09 14:25:36,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-01-09 14:25:36,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:36,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 39 proven. 63 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-01-09 14:25:37,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:37,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116226012] [2025-01-09 14:25:37,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116226012] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:25:37,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892071688] [2025-01-09 14:25:37,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:37,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:25:37,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:25:37,579 INFO L229 MonitoredProcess]: Starting monitored process 6 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 14:25:37,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 14:25:37,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-01-09 14:25:37,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-01-09 14:25:37,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:37,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:37,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 14:25:37,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:25:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1152 proven. 63 refuted. 0 times theorem prover too weak. 1165 trivial. 0 not checked. [2025-01-09 14:25:38,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:25:39,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 39 proven. 63 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-01-09 14:25:39,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892071688] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:25:39,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:25:39,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 10] total 23 [2025-01-09 14:25:39,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093461249] [2025-01-09 14:25:39,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:25:39,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 14:25:39,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:39,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 14:25:39,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2025-01-09 14:25:39,458 INFO L87 Difference]: Start difference. First operand 149402 states and 229536 transitions. Second operand has 23 states, 22 states have (on average 8.909090909090908) internal successors, (196), 22 states have internal predecessors, (196), 7 states have call successors, (105), 3 states have call predecessors, (105), 6 states have return successors, (105), 7 states have call predecessors, (105), 7 states have call successors, (105) [2025-01-09 14:25:48,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:48,249 INFO L93 Difference]: Finished difference Result 402343 states and 623273 transitions. [2025-01-09 14:25:48,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 14:25:48,250 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 8.909090909090908) internal successors, (196), 22 states have internal predecessors, (196), 7 states have call successors, (105), 3 states have call predecessors, (105), 6 states have return successors, (105), 7 states have call predecessors, (105), 7 states have call successors, (105) Word has length 255 [2025-01-09 14:25:48,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:48,733 INFO L225 Difference]: With dead ends: 402343 [2025-01-09 14:25:48,733 INFO L226 Difference]: Without dead ends: 270574 [2025-01-09 14:25:48,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=437, Invalid=1369, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 14:25:48,863 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 1962 mSDsluCounter, 3196 mSDsCounter, 0 mSdLazyCounter, 2183 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2007 SdHoareTripleChecker+Valid, 3478 SdHoareTripleChecker+Invalid, 2499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 2183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:48,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2007 Valid, 3478 Invalid, 2499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 2183 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 14:25:49,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270574 states. [2025-01-09 14:25:55,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270574 to 153153. [2025-01-09 14:25:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153153 states, 143684 states have (on average 1.5284026057181037) internal successors, (219607), 144124 states have internal predecessors, (219607), 8179 states have call successors, (8179), 1289 states have call predecessors, (8179), 1289 states have return successors, (8179), 7739 states have call predecessors, (8179), 8179 states have call successors, (8179) [2025-01-09 14:25:55,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153153 states to 153153 states and 235965 transitions. [2025-01-09 14:25:55,939 INFO L78 Accepts]: Start accepts. Automaton has 153153 states and 235965 transitions. Word has length 255 [2025-01-09 14:25:55,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:55,939 INFO L471 AbstractCegarLoop]: Abstraction has 153153 states and 235965 transitions. [2025-01-09 14:25:55,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 8.909090909090908) internal successors, (196), 22 states have internal predecessors, (196), 7 states have call successors, (105), 3 states have call predecessors, (105), 6 states have return successors, (105), 7 states have call predecessors, (105), 7 states have call successors, (105) [2025-01-09 14:25:55,940 INFO L276 IsEmpty]: Start isEmpty. Operand 153153 states and 235965 transitions. [2025-01-09 14:25:55,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-01-09 14:25:55,969 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:55,969 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:25:55,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 14:25:56,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 14:25:56,170 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:56,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:56,171 INFO L85 PathProgramCache]: Analyzing trace with hash -827218521, now seen corresponding path program 1 times [2025-01-09 14:25:56,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:56,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496884142] [2025-01-09 14:25:56,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:56,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:56,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-01-09 14:25:56,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-01-09 14:25:56,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:56,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 14:25:56,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:56,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496884142] [2025-01-09 14:25:56,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496884142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:56,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:56,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:25:56,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432274939] [2025-01-09 14:25:56,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:56,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:25:56,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:56,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:25:56,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:25:56,839 INFO L87 Difference]: Start difference. First operand 153153 states and 235965 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35)