./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-76.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 0be401d6498cca46882a4cc3fc239228ee20ea10357489f3f675e5f70b0bebf7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:39:39,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:39:39,840 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:39:39,845 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:39:39,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:39:39,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:39:39,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:39:39,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:39:39,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:39:39,877 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:39:39,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:39:39,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:39:39,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:39:39,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:39:39,879 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:39:39,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:39:39,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:39:39,879 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:39:39,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:39:39,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:39:39,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:39:39,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:39:39,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:39:39,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:39:39,880 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:39:39,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:39:39,880 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:39:39,880 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:39:39,880 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:39:39,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:39:39,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:39:39,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:39:39,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:39:39,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:39:39,881 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:39:39,881 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:39:39,881 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:39:39,881 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:39:39,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:39:39,881 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:39:39,881 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:39:39,881 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:39:39,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:39:39,881 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 -> 0be401d6498cca46882a4cc3fc239228ee20ea10357489f3f675e5f70b0bebf7 [2025-02-05 21:39:40,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:39:40,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:39:40,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:39:40,201 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:39:40,201 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:39:40,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-76.i [2025-02-05 21:39:41,577 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2af91a8db/918d8e53e8664d5f9492e9c7f41059b4/FLAGec4f70eef [2025-02-05 21:39:41,929 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:39:41,931 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-76.i [2025-02-05 21:39:41,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2af91a8db/918d8e53e8664d5f9492e9c7f41059b4/FLAGec4f70eef [2025-02-05 21:39:41,968 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2af91a8db/918d8e53e8664d5f9492e9c7f41059b4 [2025-02-05 21:39:41,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:39:41,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:39:41,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:39:41,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:39:41,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:39:41,980 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:39:41" (1/1) ... [2025-02-05 21:39:41,981 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20b97dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:41, skipping insertion in model container [2025-02-05 21:39:41,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:39:41" (1/1) ... [2025-02-05 21:39:42,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:39:42,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-76.i[916,929] [2025-02-05 21:39:42,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:39:42,311 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:39:42,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-76.i[916,929] [2025-02-05 21:39:42,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:39:42,440 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:39:42,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:42 WrapperNode [2025-02-05 21:39:42,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:39:42,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:39:42,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:39:42,444 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:39:42,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:42" (1/1) ... [2025-02-05 21:39:42,473 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:42" (1/1) ... [2025-02-05 21:39:42,546 INFO L138 Inliner]: procedures = 26, calls = 113, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 629 [2025-02-05 21:39:42,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:39:42,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:39:42,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:39:42,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:39:42,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:42" (1/1) ... [2025-02-05 21:39:42,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:42" (1/1) ... [2025-02-05 21:39:42,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:42" (1/1) ... [2025-02-05 21:39:42,593 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:39:42,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:42" (1/1) ... [2025-02-05 21:39:42,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:42" (1/1) ... [2025-02-05 21:39:42,623 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:42" (1/1) ... [2025-02-05 21:39:42,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:42" (1/1) ... [2025-02-05 21:39:42,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:42" (1/1) ... [2025-02-05 21:39:42,641 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:42" (1/1) ... [2025-02-05 21:39:42,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:39:42,654 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:39:42,655 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:39:42,655 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:39:42,656 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:42" (1/1) ... [2025-02-05 21:39:42,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:39:42,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:39:42,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:39:42,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:39:42,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:39:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:39:42,713 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:39:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:39:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:39:42,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:39:42,845 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:39:42,847 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:39:43,584 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L493: havoc property_#t~bitwise67#1;havoc property_#t~short68#1; [2025-02-05 21:39:43,698 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-05 21:39:43,698 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:39:43,735 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:39:43,735 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:39:43,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:39:43 BoogieIcfgContainer [2025-02-05 21:39:43,735 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:39:43,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:39:43,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:39:43,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:39:43,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:39:41" (1/3) ... [2025-02-05 21:39:43,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9daab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:39:43, skipping insertion in model container [2025-02-05 21:39:43,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:39:42" (2/3) ... [2025-02-05 21:39:43,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9daab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:39:43, skipping insertion in model container [2025-02-05 21:39:43,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:39:43" (3/3) ... [2025-02-05 21:39:43,747 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-76.i [2025-02-05 21:39:43,760 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:39:43,762 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-76.i that has 2 procedures, 268 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:39:43,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:39:43,841 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;@470000e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:39:43,841 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:39:43,847 INFO L276 IsEmpty]: Start isEmpty. Operand has 268 states, 165 states have (on average 1.5151515151515151) internal successors, (250), 166 states have internal predecessors, (250), 100 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-05 21:39:43,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2025-02-05 21:39:43,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:43,872 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:39:43,873 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:43,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:43,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1827845949, now seen corresponding path program 1 times [2025-02-05 21:39:43,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:43,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604075224] [2025-02-05 21:39:43,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:43,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:44,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 602 statements into 1 equivalence classes. [2025-02-05 21:39:44,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 602 of 602 statements. [2025-02-05 21:39:44,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:44,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:44,569 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 19602 trivial. 0 not checked. [2025-02-05 21:39:44,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:44,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604075224] [2025-02-05 21:39:44,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604075224] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:39:44,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522545368] [2025-02-05 21:39:44,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:44,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:39:44,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:39:44,575 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:39:44,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:39:44,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 602 statements into 1 equivalence classes. [2025-02-05 21:39:44,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 602 of 602 statements. [2025-02-05 21:39:44,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:44,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:44,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 1309 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:39:44,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:39:45,061 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 19602 trivial. 0 not checked. [2025-02-05 21:39:45,062 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:39:45,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522545368] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:45,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:39:45,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:39:45,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072960169] [2025-02-05 21:39:45,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:45,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:39:45,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:45,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:39:45,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:39:45,091 INFO L87 Difference]: Start difference. First operand has 268 states, 165 states have (on average 1.5151515151515151) internal successors, (250), 166 states have internal predecessors, (250), 100 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) Second operand has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (100), 2 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 2 states have call successors, (100) [2025-02-05 21:39:45,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:45,162 INFO L93 Difference]: Finished difference Result 525 states and 987 transitions. [2025-02-05 21:39:45,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:39:45,164 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (100), 2 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 2 states have call successors, (100) Word has length 602 [2025-02-05 21:39:45,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:45,172 INFO L225 Difference]: With dead ends: 525 [2025-02-05 21:39:45,172 INFO L226 Difference]: Without dead ends: 260 [2025-02-05 21:39:45,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 603 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:39:45,180 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:45,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 426 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:39:45,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-02-05 21:39:45,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2025-02-05 21:39:45,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 158 states have (on average 1.481012658227848) internal successors, (234), 158 states have internal predecessors, (234), 100 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-05 21:39:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2025-02-05 21:39:45,269 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 602 [2025-02-05 21:39:45,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:45,269 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2025-02-05 21:39:45,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (100), 2 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 2 states have call successors, (100) [2025-02-05 21:39:45,272 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2025-02-05 21:39:45,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2025-02-05 21:39:45,289 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:45,289 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:39:45,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:39:45,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:39:45,492 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:45,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:45,493 INFO L85 PathProgramCache]: Analyzing trace with hash 114760639, now seen corresponding path program 1 times [2025-02-05 21:39:45,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:45,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602639776] [2025-02-05 21:39:45,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:45,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:45,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 602 statements into 1 equivalence classes. [2025-02-05 21:39:45,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 602 of 602 statements. [2025-02-05 21:39:45,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:45,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-02-05 21:39:46,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:46,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602639776] [2025-02-05 21:39:46,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602639776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:46,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:39:46,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:39:46,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030839660] [2025-02-05 21:39:46,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:46,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:39:46,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:46,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:39:46,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:39:46,293 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:39:46,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:46,365 INFO L93 Difference]: Finished difference Result 518 states and 867 transitions. [2025-02-05 21:39:46,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:39:46,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 602 [2025-02-05 21:39:46,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:46,374 INFO L225 Difference]: With dead ends: 518 [2025-02-05 21:39:46,374 INFO L226 Difference]: Without dead ends: 261 [2025-02-05 21:39:46,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:39:46,376 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 0 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:46,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 845 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:39:46,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-02-05 21:39:46,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2025-02-05 21:39:46,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 159 states have (on average 1.4779874213836477) internal successors, (235), 159 states have internal predecessors, (235), 100 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-05 21:39:46,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 435 transitions. [2025-02-05 21:39:46,412 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 435 transitions. Word has length 602 [2025-02-05 21:39:46,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:46,414 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 435 transitions. [2025-02-05 21:39:46,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:39:46,415 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 435 transitions. [2025-02-05 21:39:46,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2025-02-05 21:39:46,420 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:46,421 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:39:46,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:39:46,421 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:46,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:46,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1474234463, now seen corresponding path program 1 times [2025-02-05 21:39:46,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:46,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515580456] [2025-02-05 21:39:46,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:46,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:46,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes. [2025-02-05 21:39:46,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements. [2025-02-05 21:39:46,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:46,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:46,767 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-02-05 21:39:46,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:46,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515580456] [2025-02-05 21:39:46,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515580456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:46,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:39:46,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:39:46,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953889059] [2025-02-05 21:39:46,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:46,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:39:46,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:46,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:39:46,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:39:46,774 INFO L87 Difference]: Start difference. First operand 261 states and 435 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:39:46,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:46,872 INFO L93 Difference]: Finished difference Result 645 states and 1080 transitions. [2025-02-05 21:39:46,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:39:46,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 603 [2025-02-05 21:39:46,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:46,881 INFO L225 Difference]: With dead ends: 645 [2025-02-05 21:39:46,882 INFO L226 Difference]: Without dead ends: 387 [2025-02-05 21:39:46,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:39:46,885 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 190 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:46,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 895 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:39:46,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-02-05 21:39:46,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 384. [2025-02-05 21:39:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 267 states have (on average 1.5580524344569289) internal successors, (416), 268 states have internal predecessors, (416), 114 states have call successors, (114), 2 states have call predecessors, (114), 2 states have return successors, (114), 113 states have call predecessors, (114), 114 states have call successors, (114) [2025-02-05 21:39:46,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 644 transitions. [2025-02-05 21:39:46,938 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 644 transitions. Word has length 603 [2025-02-05 21:39:46,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:46,939 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 644 transitions. [2025-02-05 21:39:46,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:39:46,942 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 644 transitions. [2025-02-05 21:39:46,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2025-02-05 21:39:46,947 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:46,947 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:39:46,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:39:46,948 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:46,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:46,949 INFO L85 PathProgramCache]: Analyzing trace with hash 449540542, now seen corresponding path program 1 times [2025-02-05 21:39:46,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:46,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44332811] [2025-02-05 21:39:46,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:46,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:46,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes. [2025-02-05 21:39:47,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements. [2025-02-05 21:39:47,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:47,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:47,263 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-02-05 21:39:47,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:47,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44332811] [2025-02-05 21:39:47,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44332811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:47,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:39:47,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:39:47,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380484347] [2025-02-05 21:39:47,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:47,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:39:47,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:47,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:39:47,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:39:47,267 INFO L87 Difference]: Start difference. First operand 384 states and 644 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:39:47,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:47,351 INFO L93 Difference]: Finished difference Result 772 states and 1290 transitions. [2025-02-05 21:39:47,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:39:47,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 603 [2025-02-05 21:39:47,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:47,358 INFO L225 Difference]: With dead ends: 772 [2025-02-05 21:39:47,358 INFO L226 Difference]: Without dead ends: 391 [2025-02-05 21:39:47,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:39:47,360 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 188 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:47,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 945 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:39:47,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-02-05 21:39:47,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 335. [2025-02-05 21:39:47,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 232 states have (on average 1.5732758620689655) internal successors, (365), 232 states have internal predecessors, (365), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-05 21:39:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 565 transitions. [2025-02-05 21:39:47,397 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 565 transitions. Word has length 603 [2025-02-05 21:39:47,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:47,398 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 565 transitions. [2025-02-05 21:39:47,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:39:47,399 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 565 transitions. [2025-02-05 21:39:47,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2025-02-05 21:39:47,403 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:47,404 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:39:47,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:39:47,404 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:47,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:47,405 INFO L85 PathProgramCache]: Analyzing trace with hash -394931329, now seen corresponding path program 1 times [2025-02-05 21:39:47,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:47,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085081099] [2025-02-05 21:39:47,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:47,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:47,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes. [2025-02-05 21:39:47,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements. [2025-02-05 21:39:47,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:47,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-02-05 21:39:47,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:47,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085081099] [2025-02-05 21:39:47,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085081099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:47,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:39:47,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:39:47,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012335425] [2025-02-05 21:39:47,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:47,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:39:47,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:47,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:39:47,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:39:47,685 INFO L87 Difference]: Start difference. First operand 335 states and 565 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:39:47,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:47,755 INFO L93 Difference]: Finished difference Result 691 states and 1161 transitions. [2025-02-05 21:39:47,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:39:47,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 603 [2025-02-05 21:39:47,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:47,762 INFO L225 Difference]: With dead ends: 691 [2025-02-05 21:39:47,762 INFO L226 Difference]: Without dead ends: 359 [2025-02-05 21:39:47,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:39:47,764 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 32 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:47,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 834 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:39:47,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-02-05 21:39:47,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 347. [2025-02-05 21:39:47,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 244 states have (on average 1.569672131147541) internal successors, (383), 244 states have internal predecessors, (383), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-05 21:39:47,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 583 transitions. [2025-02-05 21:39:47,806 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 583 transitions. Word has length 603 [2025-02-05 21:39:47,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:47,807 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 583 transitions. [2025-02-05 21:39:47,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:39:47,807 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 583 transitions. [2025-02-05 21:39:47,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2025-02-05 21:39:47,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:47,814 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:39:47,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:39:47,814 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:47,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:47,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1902483138, now seen corresponding path program 1 times [2025-02-05 21:39:47,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:47,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372248697] [2025-02-05 21:39:47,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:47,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:47,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes. [2025-02-05 21:39:47,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements. [2025-02-05 21:39:47,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:47,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:48,595 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-02-05 21:39:48,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:48,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372248697] [2025-02-05 21:39:48,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372248697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:48,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:39:48,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:39:48,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333782124] [2025-02-05 21:39:48,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:48,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:39:48,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:48,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:39:48,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:39:48,598 INFO L87 Difference]: Start difference. First operand 347 states and 583 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 2 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 2 states have call predecessors, (100), 2 states have call successors, (100) [2025-02-05 21:39:49,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:49,888 INFO L93 Difference]: Finished difference Result 1379 states and 2323 transitions. [2025-02-05 21:39:49,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:39:49,888 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 2 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 2 states have call predecessors, (100), 2 states have call successors, (100) Word has length 603 [2025-02-05 21:39:49,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:49,896 INFO L225 Difference]: With dead ends: 1379 [2025-02-05 21:39:49,896 INFO L226 Difference]: Without dead ends: 1035 [2025-02-05 21:39:49,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:39:49,900 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 803 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:49,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 2570 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 21:39:49,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2025-02-05 21:39:50,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1029. [2025-02-05 21:39:50,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 722 states have (on average 1.574792243767313) internal successors, (1137), 722 states have internal predecessors, (1137), 300 states have call successors, (300), 6 states have call predecessors, (300), 6 states have return successors, (300), 300 states have call predecessors, (300), 300 states have call successors, (300) [2025-02-05 21:39:50,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1737 transitions. [2025-02-05 21:39:50,060 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1737 transitions. Word has length 603 [2025-02-05 21:39:50,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:50,061 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1737 transitions. [2025-02-05 21:39:50,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 2 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 2 states have call predecessors, (100), 2 states have call successors, (100) [2025-02-05 21:39:50,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1737 transitions. [2025-02-05 21:39:50,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2025-02-05 21:39:50,066 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:50,066 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:39:50,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:39:50,067 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:50,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:50,067 INFO L85 PathProgramCache]: Analyzing trace with hash 595532799, now seen corresponding path program 1 times [2025-02-05 21:39:50,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:50,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397689897] [2025-02-05 21:39:50,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:50,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:50,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes. [2025-02-05 21:39:50,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements. [2025-02-05 21:39:50,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:50,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:50,456 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-02-05 21:39:50,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:50,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397689897] [2025-02-05 21:39:50,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397689897] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:50,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:39:50,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:39:50,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313160278] [2025-02-05 21:39:50,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:50,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:39:50,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:50,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:39:50,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:39:50,459 INFO L87 Difference]: Start difference. First operand 1029 states and 1737 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:39:50,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:50,518 INFO L93 Difference]: Finished difference Result 1373 states and 2317 transitions. [2025-02-05 21:39:50,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:39:50,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 603 [2025-02-05 21:39:50,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:50,526 INFO L225 Difference]: With dead ends: 1373 [2025-02-05 21:39:50,526 INFO L226 Difference]: Without dead ends: 688 [2025-02-05 21:39:50,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:39:50,529 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 0 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:50,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 844 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:39:50,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-02-05 21:39:50,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 345. [2025-02-05 21:39:50,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 242 states have (on average 1.5661157024793388) internal successors, (379), 242 states have internal predecessors, (379), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-05 21:39:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 579 transitions. [2025-02-05 21:39:50,571 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 579 transitions. Word has length 603 [2025-02-05 21:39:50,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:50,572 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 579 transitions. [2025-02-05 21:39:50,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:39:50,573 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 579 transitions. [2025-02-05 21:39:50,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2025-02-05 21:39:50,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:50,578 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:39:50,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:39:50,578 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:50,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:50,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1761427339, now seen corresponding path program 1 times [2025-02-05 21:39:50,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:50,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958735605] [2025-02-05 21:39:50,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:50,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:50,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 605 statements into 1 equivalence classes. [2025-02-05 21:39:50,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 605 of 605 statements. [2025-02-05 21:39:50,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:50,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-02-05 21:39:50,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:50,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958735605] [2025-02-05 21:39:50,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958735605] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:50,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:39:50,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:39:50,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405410190] [2025-02-05 21:39:50,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:50,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:39:50,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:50,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:39:50,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:39:50,981 INFO L87 Difference]: Start difference. First operand 345 states and 579 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:39:51,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:51,321 INFO L93 Difference]: Finished difference Result 1157 states and 1945 transitions. [2025-02-05 21:39:51,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:39:51,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 605 [2025-02-05 21:39:51,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:51,328 INFO L225 Difference]: With dead ends: 1157 [2025-02-05 21:39:51,328 INFO L226 Difference]: Without dead ends: 815 [2025-02-05 21:39:51,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:39:51,330 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 514 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:51,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 2138 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:39:51,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2025-02-05 21:39:51,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 670. [2025-02-05 21:39:51,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 521 states have (on average 1.6314779270633397) internal successors, (850), 522 states have internal predecessors, (850), 144 states have call successors, (144), 4 states have call predecessors, (144), 4 states have return successors, (144), 143 states have call predecessors, (144), 144 states have call successors, (144) [2025-02-05 21:39:51,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1138 transitions. [2025-02-05 21:39:51,371 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1138 transitions. Word has length 605 [2025-02-05 21:39:51,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:51,371 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 1138 transitions. [2025-02-05 21:39:51,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:39:51,372 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1138 transitions. [2025-02-05 21:39:51,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2025-02-05 21:39:51,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:51,377 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:39:51,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:39:51,378 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:51,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:51,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1048379741, now seen corresponding path program 1 times [2025-02-05 21:39:51,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:51,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819021855] [2025-02-05 21:39:51,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:51,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:51,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-02-05 21:39:51,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-02-05 21:39:51,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:51,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:51,758 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-02-05 21:39:51,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:51,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819021855] [2025-02-05 21:39:51,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819021855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:51,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:39:51,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:39:51,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002358309] [2025-02-05 21:39:51,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:51,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:39:51,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:51,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:39:51,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:39:51,760 INFO L87 Difference]: Start difference. First operand 670 states and 1138 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:39:52,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:52,146 INFO L93 Difference]: Finished difference Result 1571 states and 2664 transitions. [2025-02-05 21:39:52,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:39:52,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 606 [2025-02-05 21:39:52,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:52,154 INFO L225 Difference]: With dead ends: 1571 [2025-02-05 21:39:52,155 INFO L226 Difference]: Without dead ends: 904 [2025-02-05 21:39:52,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:39:52,157 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 257 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:52,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1790 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:39:52,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2025-02-05 21:39:52,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 672. [2025-02-05 21:39:52,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 523 states have (on average 1.632887189292543) internal successors, (854), 524 states have internal predecessors, (854), 144 states have call successors, (144), 4 states have call predecessors, (144), 4 states have return successors, (144), 143 states have call predecessors, (144), 144 states have call successors, (144) [2025-02-05 21:39:52,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1142 transitions. [2025-02-05 21:39:52,199 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1142 transitions. Word has length 606 [2025-02-05 21:39:52,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:52,200 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 1142 transitions. [2025-02-05 21:39:52,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:39:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1142 transitions. [2025-02-05 21:39:52,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2025-02-05 21:39:52,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:52,204 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:39:52,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:39:52,205 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:52,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:52,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1651701194, now seen corresponding path program 1 times [2025-02-05 21:39:52,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:52,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399855771] [2025-02-05 21:39:52,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:52,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:52,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-02-05 21:39:52,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-02-05 21:39:52,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:52,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:52,416 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-02-05 21:39:52,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:52,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399855771] [2025-02-05 21:39:52,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399855771] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:52,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:39:52,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:39:52,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521438109] [2025-02-05 21:39:52,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:52,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:39:52,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:52,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:39:52,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:39:52,418 INFO L87 Difference]: Start difference. First operand 672 states and 1142 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:39:52,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:52,492 INFO L93 Difference]: Finished difference Result 1617 states and 2710 transitions. [2025-02-05 21:39:52,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:39:52,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 606 [2025-02-05 21:39:52,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:52,500 INFO L225 Difference]: With dead ends: 1617 [2025-02-05 21:39:52,500 INFO L226 Difference]: Without dead ends: 948 [2025-02-05 21:39:52,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:39:52,503 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 136 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:52,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 896 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:39:52,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2025-02-05 21:39:52,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 944. [2025-02-05 21:39:52,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 747 states have (on average 1.5903614457831325) internal successors, (1188), 750 states have internal predecessors, (1188), 188 states have call successors, (188), 8 states have call predecessors, (188), 8 states have return successors, (188), 185 states have call predecessors, (188), 188 states have call successors, (188) [2025-02-05 21:39:52,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1564 transitions. [2025-02-05 21:39:52,560 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1564 transitions. Word has length 606 [2025-02-05 21:39:52,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:52,563 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1564 transitions. [2025-02-05 21:39:52,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:39:52,563 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1564 transitions. [2025-02-05 21:39:52,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2025-02-05 21:39:52,568 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:52,569 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:39:52,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:39:52,569 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:52,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:52,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1682721001, now seen corresponding path program 1 times [2025-02-05 21:39:52,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:52,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766537586] [2025-02-05 21:39:52,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:52,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:52,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-02-05 21:39:52,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-02-05 21:39:52,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:52,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:52,906 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-02-05 21:39:52,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:52,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766537586] [2025-02-05 21:39:52,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766537586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:52,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:39:52,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:39:52,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882507047] [2025-02-05 21:39:52,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:52,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:39:52,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:52,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:39:52,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:39:52,908 INFO L87 Difference]: Start difference. First operand 944 states and 1564 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:39:53,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:53,323 INFO L93 Difference]: Finished difference Result 2826 states and 4686 transitions. [2025-02-05 21:39:53,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:39:53,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 606 [2025-02-05 21:39:53,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:53,338 INFO L225 Difference]: With dead ends: 2826 [2025-02-05 21:39:53,339 INFO L226 Difference]: Without dead ends: 1885 [2025-02-05 21:39:53,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:39:53,343 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 237 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:53,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1051 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:39:53,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1885 states. [2025-02-05 21:39:53,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1885 to 1879. [2025-02-05 21:39:53,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1486 states have (on average 1.5881561238223418) internal successors, (2360), 1492 states have internal predecessors, (2360), 376 states have call successors, (376), 16 states have call predecessors, (376), 16 states have return successors, (376), 370 states have call predecessors, (376), 376 states have call successors, (376) [2025-02-05 21:39:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 3112 transitions. [2025-02-05 21:39:53,467 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 3112 transitions. Word has length 606 [2025-02-05 21:39:53,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:53,468 INFO L471 AbstractCegarLoop]: Abstraction has 1879 states and 3112 transitions. [2025-02-05 21:39:53,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:39:53,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 3112 transitions. [2025-02-05 21:39:53,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2025-02-05 21:39:53,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:53,473 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:39:53,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:39:53,474 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:53,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:53,474 INFO L85 PathProgramCache]: Analyzing trace with hash 815294936, now seen corresponding path program 1 times [2025-02-05 21:39:53,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:53,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560436498] [2025-02-05 21:39:53,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:53,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:53,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-02-05 21:39:53,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-02-05 21:39:53,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:53,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:54,214 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-02-05 21:39:54,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:54,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560436498] [2025-02-05 21:39:54,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560436498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:39:54,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:39:54,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:39:54,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932308331] [2025-02-05 21:39:54,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:39:54,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:39:54,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:54,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:39:54,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:39:54,216 INFO L87 Difference]: Start difference. First operand 1879 states and 3112 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:39:54,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:54,491 INFO L93 Difference]: Finished difference Result 4757 states and 7717 transitions. [2025-02-05 21:39:54,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:39:54,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 606 [2025-02-05 21:39:54,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:54,512 INFO L225 Difference]: With dead ends: 4757 [2025-02-05 21:39:54,512 INFO L226 Difference]: Without dead ends: 2881 [2025-02-05 21:39:54,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-02-05 21:39:54,520 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 416 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:54,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 1152 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:39:54,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2025-02-05 21:39:54,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1871. [2025-02-05 21:39:54,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1478 states have (on average 1.5832205683355887) internal successors, (2340), 1484 states have internal predecessors, (2340), 376 states have call successors, (376), 16 states have call predecessors, (376), 16 states have return successors, (376), 370 states have call predecessors, (376), 376 states have call successors, (376) [2025-02-05 21:39:54,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 3092 transitions. [2025-02-05 21:39:54,681 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 3092 transitions. Word has length 606 [2025-02-05 21:39:54,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:54,682 INFO L471 AbstractCegarLoop]: Abstraction has 1871 states and 3092 transitions. [2025-02-05 21:39:54,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:39:54,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 3092 transitions. [2025-02-05 21:39:54,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2025-02-05 21:39:54,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:54,688 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:39:54,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:39:54,688 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:54,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:54,689 INFO L85 PathProgramCache]: Analyzing trace with hash 959639096, now seen corresponding path program 1 times [2025-02-05 21:39:54,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:54,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241450407] [2025-02-05 21:39:54,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:54,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:54,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-02-05 21:39:54,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-02-05 21:39:54,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:54,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 57 proven. 240 refuted. 0 times theorem prover too weak. 19503 trivial. 0 not checked. [2025-02-05 21:39:55,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:55,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241450407] [2025-02-05 21:39:55,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241450407] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:39:55,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187556692] [2025-02-05 21:39:55,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:55,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:39:55,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:39:55,340 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:39:55,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 21:39:55,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-02-05 21:39:55,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-02-05 21:39:55,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:55,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:55,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 1319 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:39:55,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:39:56,630 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 6217 proven. 240 refuted. 0 times theorem prover too weak. 13343 trivial. 0 not checked. [2025-02-05 21:39:56,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:39:57,375 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 57 proven. 240 refuted. 0 times theorem prover too weak. 19503 trivial. 0 not checked. [2025-02-05 21:39:57,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187556692] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:39:57,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:39:57,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-05 21:39:57,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540154368] [2025-02-05 21:39:57,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:39:57,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:39:57,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:39:57,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:39:57,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:39:57,379 INFO L87 Difference]: Start difference. First operand 1871 states and 3092 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 2 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 2 states have call predecessors, (181), 2 states have call successors, (181) [2025-02-05 21:39:57,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:39:57,955 INFO L93 Difference]: Finished difference Result 3819 states and 6253 transitions. [2025-02-05 21:39:57,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:39:57,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 2 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 2 states have call predecessors, (181), 2 states have call successors, (181) Word has length 606 [2025-02-05 21:39:57,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:39:57,973 INFO L225 Difference]: With dead ends: 3819 [2025-02-05 21:39:57,973 INFO L226 Difference]: Without dead ends: 1951 [2025-02-05 21:39:57,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1219 GetRequests, 1209 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:39:57,980 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 195 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:39:57,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 752 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:39:57,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2025-02-05 21:39:58,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1903. [2025-02-05 21:39:58,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1903 states, 1502 states have (on average 1.5579227696404794) internal successors, (2340), 1508 states have internal predecessors, (2340), 376 states have call successors, (376), 24 states have call predecessors, (376), 24 states have return successors, (376), 370 states have call predecessors, (376), 376 states have call successors, (376) [2025-02-05 21:39:58,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 3092 transitions. [2025-02-05 21:39:58,115 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 3092 transitions. Word has length 606 [2025-02-05 21:39:58,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:39:58,116 INFO L471 AbstractCegarLoop]: Abstraction has 1903 states and 3092 transitions. [2025-02-05 21:39:58,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 2 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 2 states have call predecessors, (181), 2 states have call successors, (181) [2025-02-05 21:39:58,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 3092 transitions. [2025-02-05 21:39:58,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-02-05 21:39:58,122 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:39:58,123 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:39:58,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 21:39:58,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:39:58,327 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:39:58,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:39:58,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1965032676, now seen corresponding path program 1 times [2025-02-05 21:39:58,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:39:58,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186941181] [2025-02-05 21:39:58,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:58,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:39:58,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-02-05 21:39:58,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-02-05 21:39:58,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:39:58,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:39:59,752 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 123 proven. 174 refuted. 0 times theorem prover too weak. 19503 trivial. 0 not checked. [2025-02-05 21:39:59,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:39:59,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186941181] [2025-02-05 21:39:59,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186941181] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:39:59,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338861205] [2025-02-05 21:39:59,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:39:59,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:39:59,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:39:59,757 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-02-05 21:39:59,758 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-02-05 21:39:59,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-02-05 21:40:00,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-02-05 21:40:00,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:00,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:00,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 1319 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 21:40:00,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:40:03,127 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 12237 proven. 420 refuted. 0 times theorem prover too weak. 7143 trivial. 0 not checked. [2025-02-05 21:40:03,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:40:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 291 proven. 300 refuted. 0 times theorem prover too weak. 19209 trivial. 0 not checked. [2025-02-05 21:40:04,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338861205] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:40:04,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:40:04,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 11] total 22 [2025-02-05 21:40:04,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064420113] [2025-02-05 21:40:04,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:40:04,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 21:40:04,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:04,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 21:40:04,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-02-05 21:40:04,266 INFO L87 Difference]: Start difference. First operand 1903 states and 3092 transitions. Second operand has 22 states, 21 states have (on average 10.047619047619047) internal successors, (211), 20 states have internal predecessors, (211), 7 states have call successors, (216), 4 states have call predecessors, (216), 8 states have return successors, (217), 7 states have call predecessors, (217), 7 states have call successors, (217) [2025-02-05 21:40:11,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:11,107 INFO L93 Difference]: Finished difference Result 13033 states and 20479 transitions. [2025-02-05 21:40:11,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-02-05 21:40:11,109 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 10.047619047619047) internal successors, (211), 20 states have internal predecessors, (211), 7 states have call successors, (216), 4 states have call predecessors, (216), 8 states have return successors, (217), 7 states have call predecessors, (217), 7 states have call successors, (217) Word has length 607 [2025-02-05 21:40:11,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:11,174 INFO L225 Difference]: With dead ends: 13033 [2025-02-05 21:40:11,175 INFO L226 Difference]: Without dead ends: 11133 [2025-02-05 21:40:11,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1268 GetRequests, 1208 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1077, Invalid=2705, Unknown=0, NotChecked=0, Total=3782 [2025-02-05 21:40:11,186 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 2173 mSDsluCounter, 2720 mSDsCounter, 0 mSdLazyCounter, 3310 mSolverCounterSat, 1234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2214 SdHoareTripleChecker+Valid, 3338 SdHoareTripleChecker+Invalid, 4544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1234 IncrementalHoareTripleChecker+Valid, 3310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:11,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2214 Valid, 3338 Invalid, 4544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1234 Valid, 3310 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-02-05 21:40:11,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11133 states. [2025-02-05 21:40:11,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11133 to 6905. [2025-02-05 21:40:11,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6905 states, 5556 states have (on average 1.5298776097912168) internal successors, (8500), 5584 states have internal predecessors, (8500), 1232 states have call successors, (1232), 116 states have call predecessors, (1232), 116 states have return successors, (1232), 1204 states have call predecessors, (1232), 1232 states have call successors, (1232) [2025-02-05 21:40:11,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6905 states to 6905 states and 10964 transitions. [2025-02-05 21:40:11,775 INFO L78 Accepts]: Start accepts. Automaton has 6905 states and 10964 transitions. Word has length 607 [2025-02-05 21:40:11,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:11,776 INFO L471 AbstractCegarLoop]: Abstraction has 6905 states and 10964 transitions. [2025-02-05 21:40:11,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 10.047619047619047) internal successors, (211), 20 states have internal predecessors, (211), 7 states have call successors, (216), 4 states have call predecessors, (216), 8 states have return successors, (217), 7 states have call predecessors, (217), 7 states have call successors, (217) [2025-02-05 21:40:11,777 INFO L276 IsEmpty]: Start isEmpty. Operand 6905 states and 10964 transitions. [2025-02-05 21:40:11,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-02-05 21:40:11,784 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:11,784 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:40:11,795 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-02-05 21:40:11,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:40:11,985 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:11,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:11,986 INFO L85 PathProgramCache]: Analyzing trace with hash -550233451, now seen corresponding path program 1 times [2025-02-05 21:40:11,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:11,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610153631] [2025-02-05 21:40:11,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:11,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:12,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-02-05 21:40:12,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-02-05 21:40:12,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:12,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-02-05 21:40:12,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:12,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610153631] [2025-02-05 21:40:12,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610153631] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:40:12,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:40:12,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:40:12,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448297266] [2025-02-05 21:40:12,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:40:12,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:40:12,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:12,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:40:12,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:40:12,384 INFO L87 Difference]: Start difference. First operand 6905 states and 10964 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:40:13,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:13,287 INFO L93 Difference]: Finished difference Result 20709 states and 32886 transitions. [2025-02-05 21:40:13,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:40:13,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 608 [2025-02-05 21:40:13,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:13,355 INFO L225 Difference]: With dead ends: 20709 [2025-02-05 21:40:13,355 INFO L226 Difference]: Without dead ends: 13807 [2025-02-05 21:40:13,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:40:13,384 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 258 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:13,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 824 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:40:13,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13807 states. [2025-02-05 21:40:14,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13807 to 13769. [2025-02-05 21:40:14,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13769 states, 11072 states have (on average 1.5252890173410405) internal successors, (16888), 11128 states have internal predecessors, (16888), 2464 states have call successors, (2464), 232 states have call predecessors, (2464), 232 states have return successors, (2464), 2408 states have call predecessors, (2464), 2464 states have call successors, (2464) [2025-02-05 21:40:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13769 states to 13769 states and 21816 transitions. [2025-02-05 21:40:14,597 INFO L78 Accepts]: Start accepts. Automaton has 13769 states and 21816 transitions. Word has length 608 [2025-02-05 21:40:14,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:14,599 INFO L471 AbstractCegarLoop]: Abstraction has 13769 states and 21816 transitions. [2025-02-05 21:40:14,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:40:14,599 INFO L276 IsEmpty]: Start isEmpty. Operand 13769 states and 21816 transitions. [2025-02-05 21:40:14,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-02-05 21:40:14,610 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:14,611 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:40:14,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 21:40:14,611 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:14,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:14,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1511678379, now seen corresponding path program 1 times [2025-02-05 21:40:14,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:14,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410496193] [2025-02-05 21:40:14,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:14,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:14,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-02-05 21:40:15,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-02-05 21:40:15,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:15,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 21:40:15,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2006924117] [2025-02-05 21:40:15,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:15,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:40:15,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:40:15,046 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-02-05 21:40:15,048 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-02-05 21:40:15,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-02-05 21:40:15,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-02-05 21:40:15,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:15,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:15,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 1320 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 21:40:15,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:40:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-02-05 21:40:18,107 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:40:18,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:18,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410496193] [2025-02-05 21:40:18,108 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 21:40:18,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006924117] [2025-02-05 21:40:18,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006924117] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:40:18,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:40:18,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:40:18,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821044187] [2025-02-05 21:40:18,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:40:18,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:40:18,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:18,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:40:18,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:40:18,111 INFO L87 Difference]: Start difference. First operand 13769 states and 21816 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 6 states have internal predecessors, (111), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:40:23,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:23,395 INFO L93 Difference]: Finished difference Result 84527 states and 133925 transitions. [2025-02-05 21:40:23,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 21:40:23,395 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 6 states have internal predecessors, (111), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 608 [2025-02-05 21:40:23,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:23,694 INFO L225 Difference]: With dead ends: 84527 [2025-02-05 21:40:23,694 INFO L226 Difference]: Without dead ends: 70761 [2025-02-05 21:40:23,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2025-02-05 21:40:23,751 INFO L435 NwaCegarLoop]: 1198 mSDtfsCounter, 1590 mSDsluCounter, 2078 mSDsCounter, 0 mSdLazyCounter, 2255 mSolverCounterSat, 809 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 3276 SdHoareTripleChecker+Invalid, 3064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 809 IncrementalHoareTripleChecker+Valid, 2255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:23,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 3276 Invalid, 3064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [809 Valid, 2255 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 21:40:23,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70761 states. [2025-02-05 21:40:27,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70761 to 48163. [2025-02-05 21:40:27,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48163 states, 38726 states have (on average 1.5182048236327015) internal successors, (58794), 38922 states have internal predecessors, (58794), 8624 states have call successors, (8624), 812 states have call predecessors, (8624), 812 states have return successors, (8624), 8428 states have call predecessors, (8624), 8624 states have call successors, (8624) [2025-02-05 21:40:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48163 states to 48163 states and 76042 transitions. [2025-02-05 21:40:28,114 INFO L78 Accepts]: Start accepts. Automaton has 48163 states and 76042 transitions. Word has length 608 [2025-02-05 21:40:28,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:28,115 INFO L471 AbstractCegarLoop]: Abstraction has 48163 states and 76042 transitions. [2025-02-05 21:40:28,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 6 states have internal predecessors, (111), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:40:28,116 INFO L276 IsEmpty]: Start isEmpty. Operand 48163 states and 76042 transitions. [2025-02-05 21:40:28,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-02-05 21:40:28,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:28,131 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:40:28,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 21:40:28,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 21:40:28,332 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:28,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:28,333 INFO L85 PathProgramCache]: Analyzing trace with hash -295776084, now seen corresponding path program 1 times [2025-02-05 21:40:28,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:28,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425863410] [2025-02-05 21:40:28,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:28,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:28,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-02-05 21:40:28,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-02-05 21:40:28,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:28,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 21:40:28,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2042201430] [2025-02-05 21:40:28,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:28,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:40:28,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:40:28,536 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:40:28,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 21:40:28,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-02-05 21:40:28,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-02-05 21:40:28,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:28,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:28,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 1320 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 21:40:28,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:40:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-02-05 21:40:29,579 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:40:29,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:29,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425863410] [2025-02-05 21:40:29,579 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 21:40:29,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042201430] [2025-02-05 21:40:29,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042201430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:40:29,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:40:29,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:40:29,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121220743] [2025-02-05 21:40:29,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:40:29,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:40:29,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:29,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:40:29,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:40:29,581 INFO L87 Difference]: Start difference. First operand 48163 states and 76042 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:40:36,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:36,582 INFO L93 Difference]: Finished difference Result 178385 states and 281539 transitions. [2025-02-05 21:40:36,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:40:36,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 608 [2025-02-05 21:40:36,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:37,343 INFO L225 Difference]: With dead ends: 178385 [2025-02-05 21:40:37,343 INFO L226 Difference]: Without dead ends: 130225 [2025-02-05 21:40:37,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 603 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:40:37,472 INFO L435 NwaCegarLoop]: 1292 mSDtfsCounter, 781 mSDsluCounter, 3386 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 4678 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:37,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 4678 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:40:37,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130225 states. [2025-02-05 21:40:43,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130225 to 64871. [2025-02-05 21:40:43,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64871 states, 52738 states have (on average 1.5175016117410596) internal successors, (80030), 52990 states have internal predecessors, (80030), 11088 states have call successors, (11088), 1044 states have call predecessors, (11088), 1044 states have return successors, (11088), 10836 states have call predecessors, (11088), 11088 states have call successors, (11088) [2025-02-05 21:40:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64871 states to 64871 states and 102206 transitions. [2025-02-05 21:40:43,691 INFO L78 Accepts]: Start accepts. Automaton has 64871 states and 102206 transitions. Word has length 608 [2025-02-05 21:40:43,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:43,692 INFO L471 AbstractCegarLoop]: Abstraction has 64871 states and 102206 transitions. [2025-02-05 21:40:43,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) [2025-02-05 21:40:43,693 INFO L276 IsEmpty]: Start isEmpty. Operand 64871 states and 102206 transitions. [2025-02-05 21:40:43,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2025-02-05 21:40:43,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:43,706 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:40:43,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 21:40:43,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 21:40:43,911 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:43,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:43,912 INFO L85 PathProgramCache]: Analyzing trace with hash 248749314, now seen corresponding path program 1 times [2025-02-05 21:40:43,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:43,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917816150] [2025-02-05 21:40:43,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:43,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:43,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes. [2025-02-05 21:40:44,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements. [2025-02-05 21:40:44,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:44,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 21:40:44,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [727413006] [2025-02-05 21:40:44,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:44,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:40:44,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:40:44,096 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:40:44,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 21:40:44,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes. [2025-02-05 21:40:44,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements. [2025-02-05 21:40:44,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:44,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:44,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 21:40:44,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:40:47,044 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked. [2025-02-05 21:40:47,044 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:40:47,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:47,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917816150] [2025-02-05 21:40:47,044 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 21:40:47,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727413006] [2025-02-05 21:40:47,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727413006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:40:47,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:40:47,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:40:47,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31125959] [2025-02-05 21:40:47,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:40:47,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:40:47,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:47,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:40:47,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:40:47,046 INFO L87 Difference]: Start difference. First operand 64871 states and 102206 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100)