./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-93.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_amount500_file-93.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 1b2580b05f716b3340a57c87bfc63ece4a11ad4db6012c36753c978126f42a07 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:52:12,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:52:12,348 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:52:12,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:52:12,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:52:12,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:52:12,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:52:12,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:52:12,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:52:12,374 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:52:12,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:52:12,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:52:12,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:52:12,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:52:12,375 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:52:12,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:52:12,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:52:12,376 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:52:12,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:52:12,376 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:52:12,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:52:12,376 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:52:12,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:52:12,376 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:52:12,376 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:52:12,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:52:12,377 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:52:12,377 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:52:12,377 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:52:12,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:52:12,377 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:52:12,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:52:12,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:52:12,378 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:52:12,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:52:12,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:52:12,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:52:12,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:52:12,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:52:12,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:52:12,378 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:52:12,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:52:12,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:52:12,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:52:12,379 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:52:12,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:52:12,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:52:12,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:52:12,379 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 -> 1b2580b05f716b3340a57c87bfc63ece4a11ad4db6012c36753c978126f42a07 [2025-01-09 14:52:12,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:52:12,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:52:12,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:52:12,639 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:52:12,639 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:52:12,640 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-93.i [2025-01-09 14:52:13,855 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8eaeba604/e2f1eb9a579045f58090b683d21563dd/FLAG1b65566ff [2025-01-09 14:52:14,152 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:52:14,153 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-93.i [2025-01-09 14:52:14,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8eaeba604/e2f1eb9a579045f58090b683d21563dd/FLAG1b65566ff [2025-01-09 14:52:14,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8eaeba604/e2f1eb9a579045f58090b683d21563dd [2025-01-09 14:52:14,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:52:14,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:52:14,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:52:14,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:52:14,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:52:14,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:52:14" (1/1) ... [2025-01-09 14:52:14,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53da7ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:14, skipping insertion in model container [2025-01-09 14:52:14,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:52:14" (1/1) ... [2025-01-09 14:52:14,462 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:52:14,558 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_amount500_file-93.i[916,929] [2025-01-09 14:52:14,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:52:14,712 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:52:14,724 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_amount500_file-93.i[916,929] [2025-01-09 14:52:14,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:52:14,839 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:52:14,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:14 WrapperNode [2025-01-09 14:52:14,839 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:52:14,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:52:14,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:52:14,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:52:14,847 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:52:14" (1/1) ... [2025-01-09 14:52:14,868 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:52:14" (1/1) ... [2025-01-09 14:52:14,954 INFO L138 Inliner]: procedures = 26, calls = 92, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 836 [2025-01-09 14:52:14,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:52:14,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:52:14,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:52:14,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:52:14,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:14" (1/1) ... [2025-01-09 14:52:14,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:14" (1/1) ... [2025-01-09 14:52:14,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:14" (1/1) ... [2025-01-09 14:52:15,069 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:52:15,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:14" (1/1) ... [2025-01-09 14:52:15,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:14" (1/1) ... [2025-01-09 14:52:15,099 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:14" (1/1) ... [2025-01-09 14:52:15,108 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:14" (1/1) ... [2025-01-09 14:52:15,112 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:14" (1/1) ... [2025-01-09 14:52:15,123 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:14" (1/1) ... [2025-01-09 14:52:15,134 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:14" (1/1) ... [2025-01-09 14:52:15,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:52:15,148 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:52:15,149 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:52:15,149 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:52:15,149 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:14" (1/1) ... [2025-01-09 14:52:15,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:52:15,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:52:15,175 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:52:15,180 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:52:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:52:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:52:15,194 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:52:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:52:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:52:15,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:52:15,325 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:52:15,326 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:52:16,366 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2025-01-09 14:52:16,366 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:52:16,378 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:52:16,379 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:52:16,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:52:16 BoogieIcfgContainer [2025-01-09 14:52:16,379 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:52:16,381 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:52:16,381 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:52:16,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:52:16,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:52:14" (1/3) ... [2025-01-09 14:52:16,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62385791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:52:16, skipping insertion in model container [2025-01-09 14:52:16,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:14" (2/3) ... [2025-01-09 14:52:16,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62385791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:52:16, skipping insertion in model container [2025-01-09 14:52:16,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:52:16" (3/3) ... [2025-01-09 14:52:16,387 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-93.i [2025-01-09 14:52:16,397 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:52:16,400 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-93.i that has 2 procedures, 328 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:52:16,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:52:16,449 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;@17775f48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:52:16,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:52:16,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 328 states, 246 states have (on average 1.5121951219512195) internal successors, (372), 247 states have internal predecessors, (372), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-01-09 14:52:16,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-01-09 14:52:16,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:16,468 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:16,469 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:16,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:16,472 INFO L85 PathProgramCache]: Analyzing trace with hash -433248923, now seen corresponding path program 1 times [2025-01-09 14:52:16,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:16,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766439798] [2025-01-09 14:52:16,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:16,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:16,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-01-09 14:52:16,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-01-09 14:52:16,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:16,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:17,022 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 12168 trivial. 0 not checked. [2025-01-09 14:52:17,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:17,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766439798] [2025-01-09 14:52:17,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766439798] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:52:17,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101701842] [2025-01-09 14:52:17,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:17,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:52:17,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:52:17,026 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:52:17,028 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:52:17,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-01-09 14:52:17,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-01-09 14:52:17,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:17,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:17,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 1347 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:52:17,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:52:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 12168 trivial. 0 not checked. [2025-01-09 14:52:17,434 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:52:17,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101701842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:17,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:52:17,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:52:17,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762142769] [2025-01-09 14:52:17,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:17,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:52:17,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:17,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:52:17,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:52:17,456 INFO L87 Difference]: Start difference. First operand has 328 states, 246 states have (on average 1.5121951219512195) internal successors, (372), 247 states have internal predecessors, (372), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) Second operand has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (79), 2 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 2 states have call successors, (79) [2025-01-09 14:52:17,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:17,504 INFO L93 Difference]: Finished difference Result 650 states and 1134 transitions. [2025-01-09 14:52:17,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:52:17,506 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (79), 2 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 2 states have call successors, (79) Word has length 542 [2025-01-09 14:52:17,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:17,512 INFO L225 Difference]: With dead ends: 650 [2025-01-09 14:52:17,512 INFO L226 Difference]: Without dead ends: 325 [2025-01-09 14:52:17,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 543 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:52:17,517 INFO L435 NwaCegarLoop]: 519 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, 519 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:52:17,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:52:17,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-01-09 14:52:17,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2025-01-09 14:52:17,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 244 states have (on average 1.4795081967213115) internal successors, (361), 244 states have internal predecessors, (361), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-01-09 14:52:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 519 transitions. [2025-01-09 14:52:17,565 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 519 transitions. Word has length 542 [2025-01-09 14:52:17,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:17,566 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 519 transitions. [2025-01-09 14:52:17,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (79), 2 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 2 states have call successors, (79) [2025-01-09 14:52:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 519 transitions. [2025-01-09 14:52:17,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-01-09 14:52:17,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:17,575 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:17,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:52:17,775 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:52:17,776 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:17,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:17,777 INFO L85 PathProgramCache]: Analyzing trace with hash 539971170, now seen corresponding path program 1 times [2025-01-09 14:52:17,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:17,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793302439] [2025-01-09 14:52:17,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:17,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:17,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-01-09 14:52:17,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-01-09 14:52:17,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:17,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:18,643 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:52:18,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:18,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793302439] [2025-01-09 14:52:18,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793302439] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:18,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:18,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:52:18,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845862573] [2025-01-09 14:52:18,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:18,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:52:18,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:18,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:52:18,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:52:18,646 INFO L87 Difference]: Start difference. First operand 325 states and 519 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-01-09 14:52:18,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:18,954 INFO L93 Difference]: Finished difference Result 647 states and 1035 transitions. [2025-01-09 14:52:18,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:52:18,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) Word has length 543 [2025-01-09 14:52:18,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:18,961 INFO L225 Difference]: With dead ends: 647 [2025-01-09 14:52:18,962 INFO L226 Difference]: Without dead ends: 325 [2025-01-09 14:52:18,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:52:18,964 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 484 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:18,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 845 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:52:18,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-01-09 14:52:18,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2025-01-09 14:52:18,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 244 states have (on average 1.4754098360655739) internal successors, (360), 244 states have internal predecessors, (360), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-01-09 14:52:19,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 518 transitions. [2025-01-09 14:52:19,002 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 518 transitions. Word has length 543 [2025-01-09 14:52:19,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:19,004 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 518 transitions. [2025-01-09 14:52:19,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-01-09 14:52:19,005 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 518 transitions. [2025-01-09 14:52:19,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-01-09 14:52:19,010 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:19,010 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:19,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:52:19,010 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:19,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:19,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1537365728, now seen corresponding path program 1 times [2025-01-09 14:52:19,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:19,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570741409] [2025-01-09 14:52:19,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:19,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:19,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-01-09 14:52:19,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-01-09 14:52:19,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:19,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:52:19,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:19,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570741409] [2025-01-09 14:52:19,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570741409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:19,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:19,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:52:19,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039150753] [2025-01-09 14:52:19,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:19,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:52:19,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:19,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:52:19,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:52:19,475 INFO L87 Difference]: Start difference. First operand 325 states and 518 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:52:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:19,609 INFO L93 Difference]: Finished difference Result 910 states and 1449 transitions. [2025-01-09 14:52:19,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:52:19,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 543 [2025-01-09 14:52:19,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:19,618 INFO L225 Difference]: With dead ends: 910 [2025-01-09 14:52:19,618 INFO L226 Difference]: Without dead ends: 588 [2025-01-09 14:52:19,619 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:52:19,623 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 390 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:19,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1006 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:52:19,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-01-09 14:52:19,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 585. [2025-01-09 14:52:19,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 449 states have (on average 1.4766146993318485) internal successors, (663), 450 states have internal predecessors, (663), 133 states have call successors, (133), 2 states have call predecessors, (133), 2 states have return successors, (133), 132 states have call predecessors, (133), 133 states have call successors, (133) [2025-01-09 14:52:19,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 929 transitions. [2025-01-09 14:52:19,703 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 929 transitions. Word has length 543 [2025-01-09 14:52:19,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:19,707 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 929 transitions. [2025-01-09 14:52:19,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:52:19,707 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 929 transitions. [2025-01-09 14:52:19,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-01-09 14:52:19,719 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:19,720 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:19,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:52:19,720 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:19,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:19,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1971094814, now seen corresponding path program 1 times [2025-01-09 14:52:19,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:19,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998384718] [2025-01-09 14:52:19,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:19,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:19,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-01-09 14:52:20,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-01-09 14:52:20,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:20,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:20,784 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:52:20,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:20,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998384718] [2025-01-09 14:52:20,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998384718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:20,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:20,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:52:20,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997787652] [2025-01-09 14:52:20,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:20,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:52:20,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:20,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:52:20,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:52:20,790 INFO L87 Difference]: Start difference. First operand 585 states and 929 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-01-09 14:52:21,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:21,220 INFO L93 Difference]: Finished difference Result 1665 states and 2645 transitions. [2025-01-09 14:52:21,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:52:21,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) Word has length 543 [2025-01-09 14:52:21,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:21,228 INFO L225 Difference]: With dead ends: 1665 [2025-01-09 14:52:21,228 INFO L226 Difference]: Without dead ends: 1083 [2025-01-09 14:52:21,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:52:21,230 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 486 mSDsluCounter, 1939 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 2437 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:21,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 2437 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:52:21,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2025-01-09 14:52:21,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1021. [2025-01-09 14:52:21,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 804 states have (on average 1.4975124378109452) internal successors, (1204), 805 states have internal predecessors, (1204), 212 states have call successors, (212), 4 states have call predecessors, (212), 4 states have return successors, (212), 211 states have call predecessors, (212), 212 states have call successors, (212) [2025-01-09 14:52:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1628 transitions. [2025-01-09 14:52:21,326 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1628 transitions. Word has length 543 [2025-01-09 14:52:21,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:21,327 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1628 transitions. [2025-01-09 14:52:21,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-01-09 14:52:21,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1628 transitions. [2025-01-09 14:52:21,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-01-09 14:52:21,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:21,332 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:21,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:52:21,333 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:21,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:21,333 INFO L85 PathProgramCache]: Analyzing trace with hash 34696846, now seen corresponding path program 1 times [2025-01-09 14:52:21,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:21,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002297072] [2025-01-09 14:52:21,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:21,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:21,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-09 14:52:21,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-09 14:52:21,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:21,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:52:22,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:22,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002297072] [2025-01-09 14:52:22,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002297072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:22,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:22,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:52:22,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305334999] [2025-01-09 14:52:22,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:22,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:52:22,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:22,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:52:22,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:52:22,713 INFO L87 Difference]: Start difference. First operand 1021 states and 1628 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:52:23,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:23,155 INFO L93 Difference]: Finished difference Result 1955 states and 3103 transitions. [2025-01-09 14:52:23,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:52:23,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 545 [2025-01-09 14:52:23,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:23,162 INFO L225 Difference]: With dead ends: 1955 [2025-01-09 14:52:23,162 INFO L226 Difference]: Without dead ends: 1083 [2025-01-09 14:52:23,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:52:23,164 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 390 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1873 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:23,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1873 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:52:23,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2025-01-09 14:52:23,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1021. [2025-01-09 14:52:23,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 804 states have (on average 1.493781094527363) internal successors, (1201), 805 states have internal predecessors, (1201), 212 states have call successors, (212), 4 states have call predecessors, (212), 4 states have return successors, (212), 211 states have call predecessors, (212), 212 states have call successors, (212) [2025-01-09 14:52:23,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1625 transitions. [2025-01-09 14:52:23,251 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1625 transitions. Word has length 545 [2025-01-09 14:52:23,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:23,252 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1625 transitions. [2025-01-09 14:52:23,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:52:23,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1625 transitions. [2025-01-09 14:52:23,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2025-01-09 14:52:23,261 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:23,261 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:23,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:52:23,261 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:23,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:23,262 INFO L85 PathProgramCache]: Analyzing trace with hash -167973700, now seen corresponding path program 1 times [2025-01-09 14:52:23,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:23,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357524500] [2025-01-09 14:52:23,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:23,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:23,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes. [2025-01-09 14:52:23,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements. [2025-01-09 14:52:23,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:23,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:52:24,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:24,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357524500] [2025-01-09 14:52:24,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357524500] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:24,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:24,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:52:24,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459759985] [2025-01-09 14:52:24,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:24,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:52:24,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:24,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:52:24,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:52:24,860 INFO L87 Difference]: Start difference. First operand 1021 states and 1625 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:52:25,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:25,467 INFO L93 Difference]: Finished difference Result 1956 states and 3100 transitions. [2025-01-09 14:52:25,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:52:25,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 547 [2025-01-09 14:52:25,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:25,477 INFO L225 Difference]: With dead ends: 1956 [2025-01-09 14:52:25,477 INFO L226 Difference]: Without dead ends: 1083 [2025-01-09 14:52:25,479 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:52:25,479 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 364 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:25,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1495 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:52:25,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2025-01-09 14:52:25,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1021. [2025-01-09 14:52:25,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 804 states have (on average 1.4900497512437811) internal successors, (1198), 805 states have internal predecessors, (1198), 212 states have call successors, (212), 4 states have call predecessors, (212), 4 states have return successors, (212), 211 states have call predecessors, (212), 212 states have call successors, (212) [2025-01-09 14:52:25,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1622 transitions. [2025-01-09 14:52:25,564 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1622 transitions. Word has length 547 [2025-01-09 14:52:25,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:25,565 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1622 transitions. [2025-01-09 14:52:25,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:52:25,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1622 transitions. [2025-01-09 14:52:25,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-01-09 14:52:25,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:25,572 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:25,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:52:25,572 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:25,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:25,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1749826222, now seen corresponding path program 1 times [2025-01-09 14:52:25,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:25,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751653008] [2025-01-09 14:52:25,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:25,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:25,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-01-09 14:52:26,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-01-09 14:52:26,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:26,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:26,596 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:52:26,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:26,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751653008] [2025-01-09 14:52:26,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751653008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:26,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:26,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:52:26,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150825701] [2025-01-09 14:52:26,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:26,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:52:26,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:26,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:52:26,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:52:26,599 INFO L87 Difference]: Start difference. First operand 1021 states and 1622 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:52:27,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:27,011 INFO L93 Difference]: Finished difference Result 1952 states and 3088 transitions. [2025-01-09 14:52:27,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:52:27,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 548 [2025-01-09 14:52:27,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:27,018 INFO L225 Difference]: With dead ends: 1952 [2025-01-09 14:52:27,019 INFO L226 Difference]: Without dead ends: 1083 [2025-01-09 14:52:27,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:52:27,020 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 372 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:27,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1528 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:52:27,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2025-01-09 14:52:27,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1021. [2025-01-09 14:52:27,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 804 states have (on average 1.4888059701492538) internal successors, (1197), 805 states have internal predecessors, (1197), 212 states have call successors, (212), 4 states have call predecessors, (212), 4 states have return successors, (212), 211 states have call predecessors, (212), 212 states have call successors, (212) [2025-01-09 14:52:27,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1621 transitions. [2025-01-09 14:52:27,124 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1621 transitions. Word has length 548 [2025-01-09 14:52:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:27,125 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1621 transitions. [2025-01-09 14:52:27,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:52:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1621 transitions. [2025-01-09 14:52:27,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-01-09 14:52:27,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:27,131 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:27,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:52:27,131 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:27,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:27,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1721325932, now seen corresponding path program 1 times [2025-01-09 14:52:27,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:27,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054736458] [2025-01-09 14:52:27,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:27,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:27,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-01-09 14:52:27,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-01-09 14:52:27,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:27,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:27,630 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:52:27,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:27,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054736458] [2025-01-09 14:52:27,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054736458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:27,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:27,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:52:27,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060158507] [2025-01-09 14:52:27,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:27,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:52:27,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:27,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:52:27,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:52:27,634 INFO L87 Difference]: Start difference. First operand 1021 states and 1621 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:52:27,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:27,786 INFO L93 Difference]: Finished difference Result 2471 states and 3930 transitions. [2025-01-09 14:52:27,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:52:27,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 548 [2025-01-09 14:52:27,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:27,797 INFO L225 Difference]: With dead ends: 2471 [2025-01-09 14:52:27,798 INFO L226 Difference]: Without dead ends: 1603 [2025-01-09 14:52:27,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:52:27,801 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 371 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:27,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1013 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:52:27,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-01-09 14:52:27,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1601. [2025-01-09 14:52:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1249 states have (on average 1.4715772618094476) internal successors, (1838), 1251 states have internal predecessors, (1838), 345 states have call successors, (345), 6 states have call predecessors, (345), 6 states have return successors, (345), 343 states have call predecessors, (345), 345 states have call successors, (345) [2025-01-09 14:52:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2528 transitions. [2025-01-09 14:52:27,914 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2528 transitions. Word has length 548 [2025-01-09 14:52:27,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:27,915 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2528 transitions. [2025-01-09 14:52:27,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:52:27,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2528 transitions. [2025-01-09 14:52:27,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-01-09 14:52:27,919 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:27,919 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:27,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:52:27,919 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:27,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:27,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2096384816, now seen corresponding path program 1 times [2025-01-09 14:52:27,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:27,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110792195] [2025-01-09 14:52:27,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:27,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:27,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-01-09 14:52:28,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-01-09 14:52:28,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:28,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:52:31,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:31,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110792195] [2025-01-09 14:52:31,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110792195] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:31,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:31,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:52:31,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017154100] [2025-01-09 14:52:31,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:31,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:52:31,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:31,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:52:31,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:52:31,229 INFO L87 Difference]: Start difference. First operand 1601 states and 2528 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-01-09 14:52:32,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:32,213 INFO L93 Difference]: Finished difference Result 4937 states and 7807 transitions. [2025-01-09 14:52:32,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:52:32,213 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) Word has length 548 [2025-01-09 14:52:32,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:32,229 INFO L225 Difference]: With dead ends: 4937 [2025-01-09 14:52:32,229 INFO L226 Difference]: Without dead ends: 3559 [2025-01-09 14:52:32,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:52:32,235 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 1658 mSDsluCounter, 1831 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1658 SdHoareTripleChecker+Valid, 2558 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:32,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1658 Valid, 2558 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:52:32,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3559 states. [2025-01-09 14:52:32,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3559 to 3007. [2025-01-09 14:52:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 2385 states have (on average 1.479664570230608) internal successors, (3529), 2389 states have internal predecessors, (3529), 611 states have call successors, (611), 10 states have call predecessors, (611), 10 states have return successors, (611), 607 states have call predecessors, (611), 611 states have call successors, (611) [2025-01-09 14:52:32,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4751 transitions. [2025-01-09 14:52:32,424 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4751 transitions. Word has length 548 [2025-01-09 14:52:32,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:32,424 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 4751 transitions. [2025-01-09 14:52:32,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-01-09 14:52:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4751 transitions. [2025-01-09 14:52:32,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-01-09 14:52:32,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:32,428 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:32,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:52:32,428 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:32,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:32,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1519310226, now seen corresponding path program 1 times [2025-01-09 14:52:32,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:32,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118111881] [2025-01-09 14:52:32,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:32,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:32,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-01-09 14:52:32,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-01-09 14:52:32,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:32,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:52:33,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:33,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118111881] [2025-01-09 14:52:33,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118111881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:33,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:33,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:52:33,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142137778] [2025-01-09 14:52:33,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:33,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:52:33,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:33,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:52:33,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:52:33,854 INFO L87 Difference]: Start difference. First operand 3007 states and 4751 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:52:34,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:34,997 INFO L93 Difference]: Finished difference Result 9021 states and 14221 transitions. [2025-01-09 14:52:34,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:52:34,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 548 [2025-01-09 14:52:34,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:35,025 INFO L225 Difference]: With dead ends: 9021 [2025-01-09 14:52:35,025 INFO L226 Difference]: Without dead ends: 6515 [2025-01-09 14:52:35,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:52:35,033 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 2261 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2261 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:35,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2261 Valid, 2344 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:52:35,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6515 states. [2025-01-09 14:52:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6515 to 3553. [2025-01-09 14:52:35,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3553 states, 2931 states have (on average 1.4998294097577618) internal successors, (4396), 2935 states have internal predecessors, (4396), 611 states have call successors, (611), 10 states have call predecessors, (611), 10 states have return successors, (611), 607 states have call predecessors, (611), 611 states have call successors, (611) [2025-01-09 14:52:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3553 states to 3553 states and 5618 transitions. [2025-01-09 14:52:35,242 INFO L78 Accepts]: Start accepts. Automaton has 3553 states and 5618 transitions. Word has length 548 [2025-01-09 14:52:35,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:35,243 INFO L471 AbstractCegarLoop]: Abstraction has 3553 states and 5618 transitions. [2025-01-09 14:52:35,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:52:35,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3553 states and 5618 transitions. [2025-01-09 14:52:35,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-01-09 14:52:35,246 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:35,246 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:35,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:52:35,247 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:35,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:35,248 INFO L85 PathProgramCache]: Analyzing trace with hash 408962476, now seen corresponding path program 1 times [2025-01-09 14:52:35,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:35,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378338172] [2025-01-09 14:52:35,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:35,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:35,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-01-09 14:52:35,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-01-09 14:52:35,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:35,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:35,894 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:52:35,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:35,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378338172] [2025-01-09 14:52:35,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378338172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:35,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:35,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:52:35,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174789518] [2025-01-09 14:52:35,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:35,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:52:35,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:35,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:52:35,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:52:35,899 INFO L87 Difference]: Start difference. First operand 3553 states and 5618 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:52:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:36,252 INFO L93 Difference]: Finished difference Result 12023 states and 18964 transitions. [2025-01-09 14:52:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:52:36,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 548 [2025-01-09 14:52:36,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:36,289 INFO L225 Difference]: With dead ends: 12023 [2025-01-09 14:52:36,292 INFO L226 Difference]: Without dead ends: 8635 [2025-01-09 14:52:36,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:52:36,304 INFO L435 NwaCegarLoop]: 870 mSDtfsCounter, 703 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:36,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 1616 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:52:36,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8635 states. [2025-01-09 14:52:36,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8635 to 8039. [2025-01-09 14:52:36,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8039 states, 7177 states have (on average 1.518183084854396) internal successors, (10896), 7189 states have internal predecessors, (10896), 843 states have call successors, (843), 18 states have call predecessors, (843), 18 states have return successors, (843), 831 states have call predecessors, (843), 843 states have call successors, (843) [2025-01-09 14:52:36,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8039 states to 8039 states and 12582 transitions. [2025-01-09 14:52:36,667 INFO L78 Accepts]: Start accepts. Automaton has 8039 states and 12582 transitions. Word has length 548 [2025-01-09 14:52:36,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:36,667 INFO L471 AbstractCegarLoop]: Abstraction has 8039 states and 12582 transitions. [2025-01-09 14:52:36,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:52:36,668 INFO L276 IsEmpty]: Start isEmpty. Operand 8039 states and 12582 transitions. [2025-01-09 14:52:36,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-01-09 14:52:36,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:36,673 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:36,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:52:36,674 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:36,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:36,675 INFO L85 PathProgramCache]: Analyzing trace with hash -177313746, now seen corresponding path program 1 times [2025-01-09 14:52:36,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:36,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158744646] [2025-01-09 14:52:36,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:36,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:36,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-01-09 14:52:36,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-01-09 14:52:36,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:36,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:36,811 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:52:36,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:36,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158744646] [2025-01-09 14:52:36,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158744646] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:36,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:36,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:52:36,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483833124] [2025-01-09 14:52:36,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:36,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:52:36,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:36,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:52:36,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:52:36,813 INFO L87 Difference]: Start difference. First operand 8039 states and 12582 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:52:37,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:37,291 INFO L93 Difference]: Finished difference Result 13160 states and 20547 transitions. [2025-01-09 14:52:37,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:52:37,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 548 [2025-01-09 14:52:37,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:37,325 INFO L225 Difference]: With dead ends: 13160 [2025-01-09 14:52:37,325 INFO L226 Difference]: Without dead ends: 5962 [2025-01-09 14:52:37,344 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:52:37,344 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 369 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:37,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1034 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:52:37,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2025-01-09 14:52:37,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 5376. [2025-01-09 14:52:37,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5376 states, 4745 states have (on average 1.5047418335089568) internal successors, (7140), 4749 states have internal predecessors, (7140), 611 states have call successors, (611), 19 states have call predecessors, (611), 19 states have return successors, (611), 607 states have call predecessors, (611), 611 states have call successors, (611) [2025-01-09 14:52:37,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5376 states to 5376 states and 8362 transitions. [2025-01-09 14:52:37,586 INFO L78 Accepts]: Start accepts. Automaton has 5376 states and 8362 transitions. Word has length 548 [2025-01-09 14:52:37,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:37,586 INFO L471 AbstractCegarLoop]: Abstraction has 5376 states and 8362 transitions. [2025-01-09 14:52:37,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:52:37,587 INFO L276 IsEmpty]: Start isEmpty. Operand 5376 states and 8362 transitions. [2025-01-09 14:52:37,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-01-09 14:52:37,591 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:37,592 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:37,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:52:37,592 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:37,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:37,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1319816212, now seen corresponding path program 1 times [2025-01-09 14:52:37,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:37,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612956927] [2025-01-09 14:52:37,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:37,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:37,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-01-09 14:52:37,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-01-09 14:52:37,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:37,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:39,158 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:52:39,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:39,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612956927] [2025-01-09 14:52:39,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612956927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:39,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:39,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:52:39,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848112976] [2025-01-09 14:52:39,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:39,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:52:39,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:39,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:52:39,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:52:39,161 INFO L87 Difference]: Start difference. First operand 5376 states and 8362 transitions. Second operand has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 states have internal predecessors, (156), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-01-09 14:52:40,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:40,323 INFO L93 Difference]: Finished difference Result 11868 states and 18399 transitions. [2025-01-09 14:52:40,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:52:40,324 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 states have internal predecessors, (156), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) Word has length 548 [2025-01-09 14:52:40,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:40,341 INFO L225 Difference]: With dead ends: 11868 [2025-01-09 14:52:40,341 INFO L226 Difference]: Without dead ends: 7296 [2025-01-09 14:52:40,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:52:40,350 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 2410 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2410 SdHoareTripleChecker+Valid, 2580 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:40,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2410 Valid, 2580 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:52:40,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7296 states. [2025-01-09 14:52:40,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7296 to 5966. [2025-01-09 14:52:40,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5966 states, 5335 states have (on average 1.5075913776944705) internal successors, (8043), 5339 states have internal predecessors, (8043), 611 states have call successors, (611), 19 states have call predecessors, (611), 19 states have return successors, (611), 607 states have call predecessors, (611), 611 states have call successors, (611) [2025-01-09 14:52:40,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5966 states to 5966 states and 9265 transitions. [2025-01-09 14:52:40,598 INFO L78 Accepts]: Start accepts. Automaton has 5966 states and 9265 transitions. Word has length 548 [2025-01-09 14:52:40,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:40,598 INFO L471 AbstractCegarLoop]: Abstraction has 5966 states and 9265 transitions. [2025-01-09 14:52:40,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 states have internal predecessors, (156), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-01-09 14:52:40,599 INFO L276 IsEmpty]: Start isEmpty. Operand 5966 states and 9265 transitions. [2025-01-09 14:52:40,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-01-09 14:52:40,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:40,604 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:40,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:52:40,604 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:40,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:40,604 INFO L85 PathProgramCache]: Analyzing trace with hash -896169490, now seen corresponding path program 1 times [2025-01-09 14:52:40,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:40,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982742444] [2025-01-09 14:52:40,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:40,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:40,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-01-09 14:52:41,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-01-09 14:52:41,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:41,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:42,421 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 75 proven. 159 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-01-09 14:52:42,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:42,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982742444] [2025-01-09 14:52:42,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982742444] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:52:42,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522176899] [2025-01-09 14:52:42,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:42,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:52:42,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:52:42,425 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:52:42,427 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:52:42,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-01-09 14:52:42,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-01-09 14:52:42,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:42,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:42,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 1355 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 14:52:42,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:52:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 2711 proven. 48 refuted. 0 times theorem prover too weak. 9565 trivial. 0 not checked. [2025-01-09 14:52:43,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:52:44,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 414 proven. 51 refuted. 0 times theorem prover too weak. 11859 trivial. 0 not checked. [2025-01-09 14:52:44,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522176899] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:52:44,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:52:44,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 28 [2025-01-09 14:52:44,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625597865] [2025-01-09 14:52:44,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:52:44,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 14:52:44,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:44,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 14:52:44,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2025-01-09 14:52:44,797 INFO L87 Difference]: Start difference. First operand 5966 states and 9265 transitions. Second operand has 28 states, 27 states have (on average 14.925925925925926) internal successors, (403), 26 states have internal predecessors, (403), 9 states have call successors, (237), 4 states have call predecessors, (237), 8 states have return successors, (237), 9 states have call predecessors, (237), 9 states have call successors, (237) [2025-01-09 14:52:59,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:59,066 INFO L93 Difference]: Finished difference Result 55957 states and 86697 transitions. [2025-01-09 14:52:59,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2025-01-09 14:52:59,068 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 14.925925925925926) internal successors, (403), 26 states have internal predecessors, (403), 9 states have call successors, (237), 4 states have call predecessors, (237), 8 states have return successors, (237), 9 states have call predecessors, (237), 9 states have call successors, (237) Word has length 548 [2025-01-09 14:52:59,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:59,168 INFO L225 Difference]: With dead ends: 55957 [2025-01-09 14:52:59,168 INFO L226 Difference]: Without dead ends: 50261 [2025-01-09 14:52:59,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1273 GetRequests, 1098 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13365 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5437, Invalid=25715, Unknown=0, NotChecked=0, Total=31152 [2025-01-09 14:52:59,189 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 17410 mSDsluCounter, 12948 mSDsCounter, 0 mSdLazyCounter, 8207 mSolverCounterSat, 4256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17435 SdHoareTripleChecker+Valid, 13860 SdHoareTripleChecker+Invalid, 12463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4256 IncrementalHoareTripleChecker+Valid, 8207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:59,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17435 Valid, 13860 Invalid, 12463 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4256 Valid, 8207 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2025-01-09 14:52:59,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50261 states. [2025-01-09 14:53:00,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50261 to 22918. [2025-01-09 14:53:00,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22918 states, 21912 states have (on average 1.5177984665936473) internal successors, (33258), 21918 states have internal predecessors, (33258), 927 states have call successors, (927), 78 states have call predecessors, (927), 78 states have return successors, (927), 921 states have call predecessors, (927), 927 states have call successors, (927) [2025-01-09 14:53:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22918 states to 22918 states and 35112 transitions. [2025-01-09 14:53:00,130 INFO L78 Accepts]: Start accepts. Automaton has 22918 states and 35112 transitions. Word has length 548 [2025-01-09 14:53:00,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:00,130 INFO L471 AbstractCegarLoop]: Abstraction has 22918 states and 35112 transitions. [2025-01-09 14:53:00,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 14.925925925925926) internal successors, (403), 26 states have internal predecessors, (403), 9 states have call successors, (237), 4 states have call predecessors, (237), 8 states have return successors, (237), 9 states have call predecessors, (237), 9 states have call successors, (237) [2025-01-09 14:53:00,131 INFO L276 IsEmpty]: Start isEmpty. Operand 22918 states and 35112 transitions. [2025-01-09 14:53:00,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-01-09 14:53:00,144 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:00,144 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:00,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:53:00,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:53:00,345 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:00,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:00,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1873822226, now seen corresponding path program 1 times [2025-01-09 14:53:00,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:00,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035573858] [2025-01-09 14:53:00,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:00,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:00,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-01-09 14:53:00,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-01-09 14:53:00,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:00,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:00,485 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:53:00,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:00,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035573858] [2025-01-09 14:53:00,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035573858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:53:00,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:53:00,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:53:00,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187858961] [2025-01-09 14:53:00,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:53:00,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:53:00,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:00,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:53:00,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:53:00,487 INFO L87 Difference]: Start difference. First operand 22918 states and 35112 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:53:01,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:01,427 INFO L93 Difference]: Finished difference Result 63318 states and 97090 transitions. [2025-01-09 14:53:01,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:53:01,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 548 [2025-01-09 14:53:01,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:01,497 INFO L225 Difference]: With dead ends: 63318 [2025-01-09 14:53:01,497 INFO L226 Difference]: Without dead ends: 42542 [2025-01-09 14:53:01,515 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:53:01,515 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 491 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:53:01,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1320 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:53:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42542 states. [2025-01-09 14:53:02,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42542 to 40284. [2025-01-09 14:53:02,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40284 states, 38360 states have (on average 1.5019290928050053) internal successors, (57614), 38372 states have internal predecessors, (57614), 1775 states have call successors, (1775), 148 states have call predecessors, (1775), 148 states have return successors, (1775), 1763 states have call predecessors, (1775), 1775 states have call successors, (1775) [2025-01-09 14:53:02,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40284 states to 40284 states and 61164 transitions. [2025-01-09 14:53:02,918 INFO L78 Accepts]: Start accepts. Automaton has 40284 states and 61164 transitions. Word has length 548 [2025-01-09 14:53:02,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:02,919 INFO L471 AbstractCegarLoop]: Abstraction has 40284 states and 61164 transitions. [2025-01-09 14:53:02,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:53:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 40284 states and 61164 transitions. [2025-01-09 14:53:02,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-01-09 14:53:02,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:02,950 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:02,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:53:02,950 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:02,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:02,951 INFO L85 PathProgramCache]: Analyzing trace with hash 54450476, now seen corresponding path program 1 times [2025-01-09 14:53:02,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:02,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290987681] [2025-01-09 14:53:02,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:02,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:02,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-01-09 14:53:03,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-01-09 14:53:03,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:03,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:53:03,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:03,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290987681] [2025-01-09 14:53:03,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290987681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:53:03,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:53:03,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:53:03,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050595611] [2025-01-09 14:53:03,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:53:03,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:53:03,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:03,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:53:03,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:53:03,799 INFO L87 Difference]: Start difference. First operand 40284 states and 61164 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:53:05,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:05,851 INFO L93 Difference]: Finished difference Result 104656 states and 158918 transitions. [2025-01-09 14:53:05,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:53:05,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 548 [2025-01-09 14:53:05,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:05,975 INFO L225 Difference]: With dead ends: 104656 [2025-01-09 14:53:05,975 INFO L226 Difference]: Without dead ends: 74134 [2025-01-09 14:53:06,024 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:53:06,025 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 304 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:53:06,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1553 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:53:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74134 states. [2025-01-09 14:53:08,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74134 to 74132. [2025-01-09 14:53:08,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74132 states, 70372 states have (on average 1.4967600750298413) internal successors, (105330), 70396 states have internal predecessors, (105330), 3471 states have call successors, (3471), 288 states have call predecessors, (3471), 288 states have return successors, (3471), 3447 states have call predecessors, (3471), 3471 states have call successors, (3471) [2025-01-09 14:53:08,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74132 states to 74132 states and 112272 transitions. [2025-01-09 14:53:08,556 INFO L78 Accepts]: Start accepts. Automaton has 74132 states and 112272 transitions. Word has length 548 [2025-01-09 14:53:08,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:08,557 INFO L471 AbstractCegarLoop]: Abstraction has 74132 states and 112272 transitions. [2025-01-09 14:53:08,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 14:53:08,557 INFO L276 IsEmpty]: Start isEmpty. Operand 74132 states and 112272 transitions. [2025-01-09 14:53:08,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2025-01-09 14:53:08,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:08,599 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:08,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 14:53:08,599 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:08,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:08,600 INFO L85 PathProgramCache]: Analyzing trace with hash -170462013, now seen corresponding path program 1 times [2025-01-09 14:53:08,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:08,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058605026] [2025-01-09 14:53:08,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:08,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:08,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 549 statements into 1 equivalence classes. [2025-01-09 14:53:10,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 549 of 549 statements. [2025-01-09 14:53:10,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:10,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 138 proven. 96 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-01-09 14:53:11,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:11,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058605026] [2025-01-09 14:53:11,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058605026] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:53:11,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942987267] [2025-01-09 14:53:11,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:11,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:53:11,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:53:11,078 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:53:11,080 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:53:11,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 549 statements into 1 equivalence classes. [2025-01-09 14:53:11,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 549 of 549 statements. [2025-01-09 14:53:11,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:11,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:11,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 1362 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:53:11,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:53:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 5370 proven. 72 refuted. 0 times theorem prover too weak. 6882 trivial. 0 not checked. [2025-01-09 14:53:11,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:53:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 162 proven. 72 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-01-09 14:53:11,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942987267] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:53:11,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:53:11,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2025-01-09 14:53:11,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114130863] [2025-01-09 14:53:11,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:53:11,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:53:11,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:11,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:53:11,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:53:11,948 INFO L87 Difference]: Start difference. First operand 74132 states and 112272 transitions. Second operand has 10 states, 10 states have (on average 22.8) internal successors, (228), 10 states have internal predecessors, (228), 3 states have call successors, (135), 2 states have call predecessors, (135), 4 states have return successors, (137), 3 states have call predecessors, (137), 3 states have call successors, (137) [2025-01-09 14:53:13,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:13,522 INFO L93 Difference]: Finished difference Result 109901 states and 166213 transitions. [2025-01-09 14:53:13,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:53:13,523 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 22.8) internal successors, (228), 10 states have internal predecessors, (228), 3 states have call successors, (135), 2 states have call predecessors, (135), 4 states have return successors, (137), 3 states have call predecessors, (137), 3 states have call successors, (137) Word has length 549 [2025-01-09 14:53:13,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:13,599 INFO L225 Difference]: With dead ends: 109901 [2025-01-09 14:53:13,600 INFO L226 Difference]: Without dead ends: 35971 [2025-01-09 14:53:13,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1114 GetRequests, 1097 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:53:13,674 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 643 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:53:13,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1737 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:53:13,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35971 states. [2025-01-09 14:53:15,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35971 to 35771. [2025-01-09 14:53:15,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35771 states, 33577 states have (on average 1.4886380558120142) internal successors, (49984), 33577 states have internal predecessors, (49984), 1975 states have call successors, (1975), 218 states have call predecessors, (1975), 218 states have return successors, (1975), 1975 states have call predecessors, (1975), 1975 states have call successors, (1975) [2025-01-09 14:53:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35771 states to 35771 states and 53934 transitions. [2025-01-09 14:53:15,335 INFO L78 Accepts]: Start accepts. Automaton has 35771 states and 53934 transitions. Word has length 549 [2025-01-09 14:53:15,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:15,336 INFO L471 AbstractCegarLoop]: Abstraction has 35771 states and 53934 transitions. [2025-01-09 14:53:15,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.8) internal successors, (228), 10 states have internal predecessors, (228), 3 states have call successors, (135), 2 states have call predecessors, (135), 4 states have return successors, (137), 3 states have call predecessors, (137), 3 states have call successors, (137) [2025-01-09 14:53:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 35771 states and 53934 transitions. [2025-01-09 14:53:15,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2025-01-09 14:53:15,346 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:15,346 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:15,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 14:53:15,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:53:15,551 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:15,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:15,552 INFO L85 PathProgramCache]: Analyzing trace with hash 866075842, now seen corresponding path program 1 times [2025-01-09 14:53:15,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:15,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698914355] [2025-01-09 14:53:15,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:15,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:15,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 550 statements into 1 equivalence classes. [2025-01-09 14:53:15,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 550 of 550 statements. [2025-01-09 14:53:15,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:15,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 14:53:16,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:16,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698914355] [2025-01-09 14:53:16,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698914355] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:53:16,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:53:16,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:53:16,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679228100] [2025-01-09 14:53:16,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:53:16,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:53:16,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:16,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:53:16,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:53:16,050 INFO L87 Difference]: Start difference. First operand 35771 states and 53934 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-01-09 14:53:17,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:17,498 INFO L93 Difference]: Finished difference Result 68487 states and 103240 transitions. [2025-01-09 14:53:17,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:53:17,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) Word has length 550 [2025-01-09 14:53:17,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:17,587 INFO L225 Difference]: With dead ends: 68487 [2025-01-09 14:53:17,587 INFO L226 Difference]: Without dead ends: 36077 [2025-01-09 14:53:17,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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:53:17,612 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 449 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:53:17,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 2260 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:53:17,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36077 states. [2025-01-09 14:53:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36077 to 35771. [2025-01-09 14:53:19,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35771 states, 33577 states have (on average 1.4883997974804182) internal successors, (49976), 33577 states have internal predecessors, (49976), 1975 states have call successors, (1975), 218 states have call predecessors, (1975), 218 states have return successors, (1975), 1975 states have call predecessors, (1975), 1975 states have call successors, (1975) [2025-01-09 14:53:19,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35771 states to 35771 states and 53926 transitions. [2025-01-09 14:53:19,189 INFO L78 Accepts]: Start accepts. Automaton has 35771 states and 53926 transitions. Word has length 550 [2025-01-09 14:53:19,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:19,189 INFO L471 AbstractCegarLoop]: Abstraction has 35771 states and 53926 transitions. [2025-01-09 14:53:19,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-01-09 14:53:19,190 INFO L276 IsEmpty]: Start isEmpty. Operand 35771 states and 53926 transitions. [2025-01-09 14:53:19,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-01-09 14:53:19,198 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:19,199 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:19,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 14:53:19,199 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:19,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:19,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1360507113, now seen corresponding path program 1 times [2025-01-09 14:53:19,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:19,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965438563] [2025-01-09 14:53:19,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:19,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:19,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-01-09 14:53:20,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-01-09 14:53:20,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:20,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:21,098 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 93 proven. 141 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-01-09 14:53:21,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:21,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965438563] [2025-01-09 14:53:21,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965438563] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:53:21,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69001185] [2025-01-09 14:53:21,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:21,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:53:21,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:53:21,102 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:53:21,105 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:53:21,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-01-09 14:53:21,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-01-09 14:53:21,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:21,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:21,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 1362 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 14:53:21,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:53:24,405 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 6404 proven. 426 refuted. 0 times theorem prover too weak. 5494 trivial. 0 not checked. [2025-01-09 14:53:24,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:53:27,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69001185] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:53:27,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 14:53:27,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 19 [2025-01-09 14:53:27,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124260526] [2025-01-09 14:53:27,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 14:53:27,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 14:53:27,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:27,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 14:53:27,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2025-01-09 14:53:27,647 INFO L87 Difference]: Start difference. First operand 35771 states and 53926 transitions. Second operand has 19 states, 19 states have (on average 16.105263157894736) internal successors, (306), 18 states have internal predecessors, (306), 6 states have call successors, (158), 5 states have call predecessors, (158), 8 states have return successors, (158), 6 states have call predecessors, (158), 6 states have call successors, (158)