./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label12.c -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 a6e4197d0572096f9d487e671de9ba1541e800c13a9d5ac01008d7630fe3cd68 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:00:45,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:00:45,776 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:00:45,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:00:45,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:00:45,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:00:45,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:00:45,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:00:45,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:00:45,814 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:00:45,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:00:45,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:00:45,815 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:00:45,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:00:45,816 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:00:45,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:00:45,816 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:00:45,817 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:00:45,817 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:00:45,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:00:45,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:00:45,817 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:00:45,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:00:45,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:00:45,818 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:00:45,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:00:45,818 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:00:45,818 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:00:45,818 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:00:45,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:00:45,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:00:45,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:00:45,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:00:45,819 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:00:45,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:00:45,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:00:45,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:00:45,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:00:45,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:00:45,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:00:45,820 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:00:45,820 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:00:45,820 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:00:45,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:00:45,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:00:45,820 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:00:45,820 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:00:45,820 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:00:45,820 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 -> a6e4197d0572096f9d487e671de9ba1541e800c13a9d5ac01008d7630fe3cd68 [2025-01-09 00:00:46,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:00:46,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:00:46,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:00:46,137 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:00:46,138 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:00:46,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label12.c [2025-01-09 00:00:47,484 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b19486854/bdbfb25c94074f3d85e3c1880256204c/FLAG92d2e67a2 [2025-01-09 00:00:47,894 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:00:47,895 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label12.c [2025-01-09 00:00:47,918 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b19486854/bdbfb25c94074f3d85e3c1880256204c/FLAG92d2e67a2 [2025-01-09 00:00:47,935 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b19486854/bdbfb25c94074f3d85e3c1880256204c [2025-01-09 00:00:47,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:00:47,938 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:00:47,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:00:47,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:00:47,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:00:47,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:00:47" (1/1) ... [2025-01-09 00:00:47,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@203c7686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:47, skipping insertion in model container [2025-01-09 00:00:47,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:00:47" (1/1) ... [2025-01-09 00:00:48,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:00:48,229 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/eca-rers2012/Problem15_label12.c[7168,7181] [2025-01-09 00:00:48,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:00:48,676 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:00:48,701 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/eca-rers2012/Problem15_label12.c[7168,7181] [2025-01-09 00:00:48,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:00:48,897 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:00:48,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:48 WrapperNode [2025-01-09 00:00:48,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:00:48,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:00:48,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:00:48,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:00:48,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:48" (1/1) ... [2025-01-09 00:00:48,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:48" (1/1) ... [2025-01-09 00:00:49,120 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-01-09 00:00:49,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:00:49,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:00:49,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:00:49,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:00:49,130 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:48" (1/1) ... [2025-01-09 00:00:49,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:48" (1/1) ... [2025-01-09 00:00:49,158 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:48" (1/1) ... [2025-01-09 00:00:49,264 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 00:00:49,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:48" (1/1) ... [2025-01-09 00:00:49,265 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:48" (1/1) ... [2025-01-09 00:00:49,333 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:48" (1/1) ... [2025-01-09 00:00:49,343 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:48" (1/1) ... [2025-01-09 00:00:49,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:48" (1/1) ... [2025-01-09 00:00:49,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:48" (1/1) ... [2025-01-09 00:00:49,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:48" (1/1) ... [2025-01-09 00:00:49,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:00:49,427 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:00:49,427 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:00:49,427 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:00:49,429 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:48" (1/1) ... [2025-01-09 00:00:49,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:00:49,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:00:49,461 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:00:49,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:00:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:00:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:00:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:00:49,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:00:49,549 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:00:49,550 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:00:52,155 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-01-09 00:00:52,155 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:00:52,187 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:00:52,187 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:00:52,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:00:52 BoogieIcfgContainer [2025-01-09 00:00:52,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:00:52,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:00:52,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:00:52,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:00:52,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:00:47" (1/3) ... [2025-01-09 00:00:52,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32764fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:00:52, skipping insertion in model container [2025-01-09 00:00:52,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:48" (2/3) ... [2025-01-09 00:00:52,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32764fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:00:52, skipping insertion in model container [2025-01-09 00:00:52,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:00:52" (3/3) ... [2025-01-09 00:00:52,205 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label12.c [2025-01-09 00:00:52,221 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:00:52,224 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label12.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:00:52,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:00:52,380 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;@3437023, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:00:52,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:00:52,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:52,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 00:00:52,397 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:52,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:52,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:52,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:52,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1707620900, now seen corresponding path program 1 times [2025-01-09 00:00:52,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:52,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888687963] [2025-01-09 00:00:52,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:52,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:52,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 00:00:52,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 00:00:52,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:52,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:52,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:00:52,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:52,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888687963] [2025-01-09 00:00:52,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888687963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:52,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:52,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:00:52,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512411345] [2025-01-09 00:00:52,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:52,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:52,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:52,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:52,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:52,843 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:54,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:54,659 INFO L93 Difference]: Finished difference Result 1154 states and 2103 transitions. [2025-01-09 00:00:54,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:54,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-01-09 00:00:54,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:54,677 INFO L225 Difference]: With dead ends: 1154 [2025-01-09 00:00:54,677 INFO L226 Difference]: Without dead ends: 665 [2025-01-09 00:00:54,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:54,684 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 262 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:54,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 384 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:00:54,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-01-09 00:00:54,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2025-01-09 00:00:54,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.4818731117824773) internal successors, (981), 662 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:54,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 981 transitions. [2025-01-09 00:00:54,764 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 981 transitions. Word has length 59 [2025-01-09 00:00:54,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:54,765 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 981 transitions. [2025-01-09 00:00:54,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:54,766 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 981 transitions. [2025-01-09 00:00:54,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 00:00:54,771 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:54,772 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:54,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:00:54,772 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:54,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:54,773 INFO L85 PathProgramCache]: Analyzing trace with hash 291189831, now seen corresponding path program 1 times [2025-01-09 00:00:54,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:54,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510563166] [2025-01-09 00:00:54,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:54,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:54,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 00:00:54,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 00:00:54,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:54,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:55,305 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:00:55,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:55,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510563166] [2025-01-09 00:00:55,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510563166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:55,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:55,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:00:55,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903278745] [2025-01-09 00:00:55,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:55,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:55,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:55,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:55,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:55,310 INFO L87 Difference]: Start difference. First operand 663 states and 981 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:56,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:56,663 INFO L93 Difference]: Finished difference Result 1624 states and 2315 transitions. [2025-01-09 00:00:56,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:56,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-01-09 00:00:56,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:56,668 INFO L225 Difference]: With dead ends: 1624 [2025-01-09 00:00:56,668 INFO L226 Difference]: Without dead ends: 963 [2025-01-09 00:00:56,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:56,671 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:56,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 337 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:00:56,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-01-09 00:00:56,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2025-01-09 00:00:56,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.362785862785863) internal successors, (1311), 962 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1311 transitions. [2025-01-09 00:00:56,708 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1311 transitions. Word has length 124 [2025-01-09 00:00:56,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:56,708 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1311 transitions. [2025-01-09 00:00:56,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:56,710 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1311 transitions. [2025-01-09 00:00:56,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 00:00:56,712 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:56,713 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:56,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:00:56,714 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:56,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:56,714 INFO L85 PathProgramCache]: Analyzing trace with hash -592966479, now seen corresponding path program 1 times [2025-01-09 00:00:56,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:56,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287439549] [2025-01-09 00:00:56,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:56,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:56,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 00:00:56,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 00:00:56,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:56,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:56,943 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:00:56,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:56,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287439549] [2025-01-09 00:00:56,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287439549] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:56,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:56,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:00:56,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135000197] [2025-01-09 00:00:56,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:56,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:56,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:56,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:56,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:56,947 INFO L87 Difference]: Start difference. First operand 963 states and 1311 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:58,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:58,470 INFO L93 Difference]: Finished difference Result 2229 states and 3186 transitions. [2025-01-09 00:00:58,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:58,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2025-01-09 00:00:58,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:58,482 INFO L225 Difference]: With dead ends: 2229 [2025-01-09 00:00:58,482 INFO L226 Difference]: Without dead ends: 1567 [2025-01-09 00:00:58,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:58,487 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 256 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:58,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 318 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:00:58,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2025-01-09 00:00:58,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1266. [2025-01-09 00:00:58,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.3043478260869565) internal successors, (1650), 1265 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:58,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1650 transitions. [2025-01-09 00:00:58,516 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1650 transitions. Word has length 129 [2025-01-09 00:00:58,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:58,517 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1650 transitions. [2025-01-09 00:00:58,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:58,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1650 transitions. [2025-01-09 00:00:58,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-01-09 00:00:58,524 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:58,524 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:58,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:00:58,525 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:58,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:58,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1080226445, now seen corresponding path program 1 times [2025-01-09 00:00:58,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:58,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451957019] [2025-01-09 00:00:58,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:58,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:58,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-09 00:00:58,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-09 00:00:58,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:58,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:00:58,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:58,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451957019] [2025-01-09 00:00:58,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451957019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:58,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:58,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:00:58,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32821107] [2025-01-09 00:00:58,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:58,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:00:58,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:58,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:00:58,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:00:58,842 INFO L87 Difference]: Start difference. First operand 1266 states and 1650 transitions. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:01,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:01,849 INFO L93 Difference]: Finished difference Result 4670 states and 6170 transitions. [2025-01-09 00:01:01,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:01:01,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2025-01-09 00:01:01,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:01,864 INFO L225 Difference]: With dead ends: 4670 [2025-01-09 00:01:01,864 INFO L226 Difference]: Without dead ends: 3406 [2025-01-09 00:01:01,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:01:01,868 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 486 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2279 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:01,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 375 Invalid, 2548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2279 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-09 00:01:01,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2025-01-09 00:01:01,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 3381. [2025-01-09 00:01:01,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.2366863905325445) internal successors, (4180), 3380 states have internal predecessors, (4180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:01,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4180 transitions. [2025-01-09 00:01:01,938 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4180 transitions. Word has length 225 [2025-01-09 00:01:01,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:01,940 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 4180 transitions. [2025-01-09 00:01:01,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:01,941 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4180 transitions. [2025-01-09 00:01:01,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 00:01:01,945 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:01,946 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:01,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:01:01,946 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:01,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:01,947 INFO L85 PathProgramCache]: Analyzing trace with hash -823565993, now seen corresponding path program 1 times [2025-01-09 00:01:01,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:01,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442560250] [2025-01-09 00:01:01,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:01,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:01,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 00:01:02,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 00:01:02,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:02,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:02,186 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-09 00:01:02,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:02,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442560250] [2025-01-09 00:01:02,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442560250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:02,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:02,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:01:02,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922116538] [2025-01-09 00:01:02,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:02,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:02,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:02,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:02,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:02,188 INFO L87 Difference]: Start difference. First operand 3381 states and 4180 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:03,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:03,542 INFO L93 Difference]: Finished difference Result 8563 states and 10754 transitions. [2025-01-09 00:01:03,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:03,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2025-01-09 00:01:03,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:03,564 INFO L225 Difference]: With dead ends: 8563 [2025-01-09 00:01:03,564 INFO L226 Difference]: Without dead ends: 5483 [2025-01-09 00:01:03,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:03,571 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:03,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 339 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:01:03,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2025-01-09 00:01:03,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478. [2025-01-09 00:01:03,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.16870549570933) internal successors, (6401), 5477 states have internal predecessors, (6401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:03,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6401 transitions. [2025-01-09 00:01:03,682 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6401 transitions. Word has length 229 [2025-01-09 00:01:03,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:03,682 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6401 transitions. [2025-01-09 00:01:03,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:03,684 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6401 transitions. [2025-01-09 00:01:03,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-01-09 00:01:03,692 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:03,693 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:03,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:01:03,693 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:03,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:03,693 INFO L85 PathProgramCache]: Analyzing trace with hash 2001973455, now seen corresponding path program 1 times [2025-01-09 00:01:03,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:03,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448523714] [2025-01-09 00:01:03,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:03,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:03,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-01-09 00:01:03,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-01-09 00:01:03,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:03,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 00:01:04,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:04,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448523714] [2025-01-09 00:01:04,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448523714] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:04,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:04,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:01:04,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289123195] [2025-01-09 00:01:04,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:04,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:04,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:04,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:04,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:04,373 INFO L87 Difference]: Start difference. First operand 5478 states and 6401 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:05,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:05,634 INFO L93 Difference]: Finished difference Result 10655 states and 12489 transitions. [2025-01-09 00:01:05,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:05,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 331 [2025-01-09 00:01:05,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:05,652 INFO L225 Difference]: With dead ends: 10655 [2025-01-09 00:01:05,653 INFO L226 Difference]: Without dead ends: 5478 [2025-01-09 00:01:05,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:05,666 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:05,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:01:05,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2025-01-09 00:01:05,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478. [2025-01-09 00:01:05,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1676100054774512) internal successors, (6395), 5477 states have internal predecessors, (6395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:05,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6395 transitions. [2025-01-09 00:01:05,788 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6395 transitions. Word has length 331 [2025-01-09 00:01:05,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:05,789 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6395 transitions. [2025-01-09 00:01:05,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:05,789 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6395 transitions. [2025-01-09 00:01:05,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-01-09 00:01:05,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:05,795 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:05,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:01:05,795 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:05,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:05,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1699960261, now seen corresponding path program 1 times [2025-01-09 00:01:05,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:05,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015259200] [2025-01-09 00:01:05,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:05,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:05,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-01-09 00:01:05,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-01-09 00:01:05,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:05,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:06,049 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-09 00:01:06,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:06,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015259200] [2025-01-09 00:01:06,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015259200] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:06,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:06,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:06,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808770165] [2025-01-09 00:01:06,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:06,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:06,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:06,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:06,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:06,051 INFO L87 Difference]: Start difference. First operand 5478 states and 6395 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:07,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:07,616 INFO L93 Difference]: Finished difference Result 11851 states and 14151 transitions. [2025-01-09 00:01:07,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:07,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 346 [2025-01-09 00:01:07,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:07,634 INFO L225 Difference]: With dead ends: 11851 [2025-01-09 00:01:07,635 INFO L226 Difference]: Without dead ends: 6674 [2025-01-09 00:01:07,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:07,642 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 256 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:07,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 323 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:01:07,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6674 states. [2025-01-09 00:01:07,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6674 to 4876. [2025-01-09 00:01:07,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4876 states, 4875 states have (on average 1.1805128205128206) internal successors, (5755), 4875 states have internal predecessors, (5755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 5755 transitions. [2025-01-09 00:01:07,742 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 5755 transitions. Word has length 346 [2025-01-09 00:01:07,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:07,743 INFO L471 AbstractCegarLoop]: Abstraction has 4876 states and 5755 transitions. [2025-01-09 00:01:07,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:07,743 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 5755 transitions. [2025-01-09 00:01:07,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-01-09 00:01:07,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:07,750 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:07,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:01:07,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:07,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:07,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1615958883, now seen corresponding path program 1 times [2025-01-09 00:01:07,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:07,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607543534] [2025-01-09 00:01:07,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:07,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:07,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-01-09 00:01:07,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-01-09 00:01:07,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:07,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:09,039 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 113 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:01:09,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:09,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607543534] [2025-01-09 00:01:09,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607543534] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:09,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693248032] [2025-01-09 00:01:09,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:09,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:09,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:09,045 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:01:09,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:01:09,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-01-09 00:01:09,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-01-09 00:01:09,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:09,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:09,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:01:09,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:01:09,381 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:01:09,382 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:01:09,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693248032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:09,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:01:09,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-09 00:01:09,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365471867] [2025-01-09 00:01:09,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:09,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:09,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:09,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:09,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:01:09,385 INFO L87 Difference]: Start difference. First operand 4876 states and 5755 transitions. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:10,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:10,779 INFO L93 Difference]: Finished difference Result 11855 states and 14250 transitions. [2025-01-09 00:01:10,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:10,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 405 [2025-01-09 00:01:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:10,802 INFO L225 Difference]: With dead ends: 11855 [2025-01-09 00:01:10,803 INFO L226 Difference]: Without dead ends: 7280 [2025-01-09 00:01:10,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:01:10,808 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 249 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:10,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 344 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:01:10,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7280 states. [2025-01-09 00:01:10,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7280 to 6679. [2025-01-09 00:01:10,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6679 states, 6678 states have (on average 1.1647199760407307) internal successors, (7778), 6678 states have internal predecessors, (7778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:10,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6679 states to 6679 states and 7778 transitions. [2025-01-09 00:01:10,917 INFO L78 Accepts]: Start accepts. Automaton has 6679 states and 7778 transitions. Word has length 405 [2025-01-09 00:01:10,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:10,917 INFO L471 AbstractCegarLoop]: Abstraction has 6679 states and 7778 transitions. [2025-01-09 00:01:10,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:10,919 INFO L276 IsEmpty]: Start isEmpty. Operand 6679 states and 7778 transitions. [2025-01-09 00:01:10,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-01-09 00:01:10,926 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:10,926 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:10,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 00:01:11,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:11,127 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:11,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:11,128 INFO L85 PathProgramCache]: Analyzing trace with hash -294993175, now seen corresponding path program 1 times [2025-01-09 00:01:11,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:11,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896333553] [2025-01-09 00:01:11,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:11,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:11,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-01-09 00:01:11,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-01-09 00:01:11,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:11,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:11,640 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 315 proven. 39 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 00:01:11,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:11,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896333553] [2025-01-09 00:01:11,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896333553] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:11,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217059343] [2025-01-09 00:01:11,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:11,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:11,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:11,643 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:01:11,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 00:01:11,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-01-09 00:01:11,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-01-09 00:01:11,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:11,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:11,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 00:01:11,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:01:12,652 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 315 proven. 39 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 00:01:12,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:01:13,509 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 315 proven. 39 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 00:01:13,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217059343] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:01:13,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:01:13,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-09 00:01:13,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474902418] [2025-01-09 00:01:13,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:01:13,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 00:01:13,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:13,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 00:01:13,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:01:13,513 INFO L87 Difference]: Start difference. First operand 6679 states and 7778 transitions. Second operand has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 8 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:18,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:18,522 INFO L93 Difference]: Finished difference Result 19597 states and 22611 transitions. [2025-01-09 00:01:18,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 00:01:18,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 8 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 422 [2025-01-09 00:01:18,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:18,540 INFO L225 Difference]: With dead ends: 19597 [2025-01-09 00:01:18,540 INFO L226 Difference]: Without dead ends: 7876 [2025-01-09 00:01:18,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 839 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-01-09 00:01:18,547 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 3310 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4756 mSolverCounterSat, 746 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3310 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 5502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 746 IncrementalHoareTripleChecker+Valid, 4756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:18,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3310 Valid, 205 Invalid, 5502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [746 Valid, 4756 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-01-09 00:01:18,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7876 states. [2025-01-09 00:01:18,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7876 to 6976. [2025-01-09 00:01:18,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6976 states, 6975 states have (on average 1.1105376344086022) internal successors, (7746), 6975 states have internal predecessors, (7746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:18,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6976 states to 6976 states and 7746 transitions. [2025-01-09 00:01:18,640 INFO L78 Accepts]: Start accepts. Automaton has 6976 states and 7746 transitions. Word has length 422 [2025-01-09 00:01:18,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:18,640 INFO L471 AbstractCegarLoop]: Abstraction has 6976 states and 7746 transitions. [2025-01-09 00:01:18,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 8 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:18,641 INFO L276 IsEmpty]: Start isEmpty. Operand 6976 states and 7746 transitions. [2025-01-09 00:01:18,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-01-09 00:01:18,643 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:18,644 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:18,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 00:01:18,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:18,845 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:18,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:18,846 INFO L85 PathProgramCache]: Analyzing trace with hash 874662536, now seen corresponding path program 1 times [2025-01-09 00:01:18,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:18,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864775962] [2025-01-09 00:01:18,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:18,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:18,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-01-09 00:01:18,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-01-09 00:01:18,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:18,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:19,123 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-09 00:01:19,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:19,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864775962] [2025-01-09 00:01:19,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864775962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:19,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:19,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:19,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851666849] [2025-01-09 00:01:19,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:19,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:19,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:19,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:19,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:19,170 INFO L87 Difference]: Start difference. First operand 6976 states and 7746 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:20,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:20,162 INFO L93 Difference]: Finished difference Result 15446 states and 17263 transitions. [2025-01-09 00:01:20,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:20,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 436 [2025-01-09 00:01:20,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:20,179 INFO L225 Difference]: With dead ends: 15446 [2025-01-09 00:01:20,179 INFO L226 Difference]: Without dead ends: 8472 [2025-01-09 00:01:20,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:20,188 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 267 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:20,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 553 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:01:20,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8472 states. [2025-01-09 00:01:20,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8472 to 8171. [2025-01-09 00:01:20,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8171 states, 8170 states have (on average 1.088984088127295) internal successors, (8897), 8170 states have internal predecessors, (8897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8171 states to 8171 states and 8897 transitions. [2025-01-09 00:01:20,286 INFO L78 Accepts]: Start accepts. Automaton has 8171 states and 8897 transitions. Word has length 436 [2025-01-09 00:01:20,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:20,287 INFO L471 AbstractCegarLoop]: Abstraction has 8171 states and 8897 transitions. [2025-01-09 00:01:20,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 8171 states and 8897 transitions. [2025-01-09 00:01:20,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-01-09 00:01:20,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:20,293 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:20,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:01:20,293 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:20,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:20,294 INFO L85 PathProgramCache]: Analyzing trace with hash 287481088, now seen corresponding path program 1 times [2025-01-09 00:01:20,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:20,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568474556] [2025-01-09 00:01:20,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:20,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:20,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-01-09 00:01:20,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-01-09 00:01:20,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:20,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2025-01-09 00:01:20,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:20,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568474556] [2025-01-09 00:01:20,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568474556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:20,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:20,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:20,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380377137] [2025-01-09 00:01:20,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:20,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:20,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:20,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:20,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:20,585 INFO L87 Difference]: Start difference. First operand 8171 states and 8897 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:21,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:21,457 INFO L93 Difference]: Finished difference Result 18731 states and 20550 transitions. [2025-01-09 00:01:21,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:21,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 533 [2025-01-09 00:01:21,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:21,478 INFO L225 Difference]: With dead ends: 18731 [2025-01-09 00:01:21,478 INFO L226 Difference]: Without dead ends: 10562 [2025-01-09 00:01:21,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:21,488 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 271 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:21,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 205 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:01:21,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10562 states. [2025-01-09 00:01:21,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10562 to 9963. [2025-01-09 00:01:21,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9963 states, 9962 states have (on average 1.0847219433848625) internal successors, (10806), 9962 states have internal predecessors, (10806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:21,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9963 states to 9963 states and 10806 transitions. [2025-01-09 00:01:21,604 INFO L78 Accepts]: Start accepts. Automaton has 9963 states and 10806 transitions. Word has length 533 [2025-01-09 00:01:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:21,605 INFO L471 AbstractCegarLoop]: Abstraction has 9963 states and 10806 transitions. [2025-01-09 00:01:21,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:21,605 INFO L276 IsEmpty]: Start isEmpty. Operand 9963 states and 10806 transitions. [2025-01-09 00:01:21,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2025-01-09 00:01:21,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:21,610 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:21,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:01:21,610 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:21,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:21,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1841259871, now seen corresponding path program 1 times [2025-01-09 00:01:21,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:21,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982488332] [2025-01-09 00:01:21,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:21,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:21,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 560 statements into 1 equivalence classes. [2025-01-09 00:01:21,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 560 of 560 statements. [2025-01-09 00:01:21,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:21,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:21,891 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-01-09 00:01:21,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:21,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982488332] [2025-01-09 00:01:21,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982488332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:21,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:21,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:21,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015785217] [2025-01-09 00:01:21,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:21,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:21,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:21,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:21,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:21,893 INFO L87 Difference]: Start difference. First operand 9963 states and 10806 transitions. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:22,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:22,722 INFO L93 Difference]: Finished difference Result 19922 states and 21652 transitions. [2025-01-09 00:01:22,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:22,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 560 [2025-01-09 00:01:22,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:22,742 INFO L225 Difference]: With dead ends: 19922 [2025-01-09 00:01:22,742 INFO L226 Difference]: Without dead ends: 10260 [2025-01-09 00:01:22,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:22,751 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 437 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:22,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 69 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:01:22,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10260 states. [2025-01-09 00:01:22,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10260 to 9961. [2025-01-09 00:01:22,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9961 states, 9960 states have (on average 1.0845381526104418) internal successors, (10802), 9960 states have internal predecessors, (10802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9961 states to 9961 states and 10802 transitions. [2025-01-09 00:01:22,873 INFO L78 Accepts]: Start accepts. Automaton has 9961 states and 10802 transitions. Word has length 560 [2025-01-09 00:01:22,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:22,874 INFO L471 AbstractCegarLoop]: Abstraction has 9961 states and 10802 transitions. [2025-01-09 00:01:22,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:22,875 INFO L276 IsEmpty]: Start isEmpty. Operand 9961 states and 10802 transitions. [2025-01-09 00:01:22,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2025-01-09 00:01:22,880 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:22,880 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:22,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:01:22,880 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:22,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:22,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1205828470, now seen corresponding path program 1 times [2025-01-09 00:01:22,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:22,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006206318] [2025-01-09 00:01:22,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:22,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:22,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-01-09 00:01:22,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-01-09 00:01:22,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:22,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:23,302 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 426 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-09 00:01:23,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:23,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006206318] [2025-01-09 00:01:23,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006206318] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:23,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:23,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:23,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676245304] [2025-01-09 00:01:23,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:23,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:23,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:23,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:23,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:23,305 INFO L87 Difference]: Start difference. First operand 9961 states and 10802 transitions. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:24,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:24,206 INFO L93 Difference]: Finished difference Result 22611 states and 24594 transitions. [2025-01-09 00:01:24,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:24,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 586 [2025-01-09 00:01:24,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:24,230 INFO L225 Difference]: With dead ends: 22611 [2025-01-09 00:01:24,230 INFO L226 Difference]: Without dead ends: 12652 [2025-01-09 00:01:24,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:24,241 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 198 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:24,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 175 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:01:24,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12652 states. [2025-01-09 00:01:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12652 to 12054. [2025-01-09 00:01:24,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12054 states, 12053 states have (on average 1.0817223927652866) internal successors, (13038), 12053 states have internal predecessors, (13038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:24,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12054 states to 12054 states and 13038 transitions. [2025-01-09 00:01:24,402 INFO L78 Accepts]: Start accepts. Automaton has 12054 states and 13038 transitions. Word has length 586 [2025-01-09 00:01:24,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:24,403 INFO L471 AbstractCegarLoop]: Abstraction has 12054 states and 13038 transitions. [2025-01-09 00:01:24,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:24,404 INFO L276 IsEmpty]: Start isEmpty. Operand 12054 states and 13038 transitions. [2025-01-09 00:01:24,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-01-09 00:01:24,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:24,409 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:24,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:01:24,410 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:24,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:24,410 INFO L85 PathProgramCache]: Analyzing trace with hash -660402539, now seen corresponding path program 1 times [2025-01-09 00:01:24,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:24,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941767133] [2025-01-09 00:01:24,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:24,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:24,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-01-09 00:01:24,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-01-09 00:01:24,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:24,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 264 proven. 188 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 00:01:25,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:25,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941767133] [2025-01-09 00:01:25,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941767133] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:25,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686768680] [2025-01-09 00:01:25,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:25,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:25,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:25,411 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:01:25,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 00:01:25,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-01-09 00:01:25,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-01-09 00:01:25,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:25,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:25,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:01:25,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:01:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-01-09 00:01:26,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:01:26,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686768680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:26,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:01:26,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:01:26,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351984616] [2025-01-09 00:01:26,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:26,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:01:26,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:26,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:01:26,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:01:26,307 INFO L87 Difference]: Start difference. First operand 12054 states and 13038 transitions. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:27,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:27,702 INFO L93 Difference]: Finished difference Result 35839 states and 38890 transitions. [2025-01-09 00:01:27,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:01:27,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 594 [2025-01-09 00:01:27,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:27,743 INFO L225 Difference]: With dead ends: 35839 [2025-01-09 00:01:27,744 INFO L226 Difference]: Without dead ends: 24086 [2025-01-09 00:01:27,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 592 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:01:27,758 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 619 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:27,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 154 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:01:27,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24086 states. [2025-01-09 00:01:27,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24086 to 20489. [2025-01-09 00:01:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20489 states, 20488 states have (on average 1.0808766106989458) internal successors, (22145), 20488 states have internal predecessors, (22145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:28,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20489 states to 20489 states and 22145 transitions. [2025-01-09 00:01:28,031 INFO L78 Accepts]: Start accepts. Automaton has 20489 states and 22145 transitions. Word has length 594 [2025-01-09 00:01:28,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:28,032 INFO L471 AbstractCegarLoop]: Abstraction has 20489 states and 22145 transitions. [2025-01-09 00:01:28,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:28,032 INFO L276 IsEmpty]: Start isEmpty. Operand 20489 states and 22145 transitions. [2025-01-09 00:01:28,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2025-01-09 00:01:28,038 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:28,039 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:28,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 00:01:28,239 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-01-09 00:01:28,240 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:28,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:28,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2017698374, now seen corresponding path program 1 times [2025-01-09 00:01:28,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:28,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572163391] [2025-01-09 00:01:28,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:28,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:28,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 638 statements into 1 equivalence classes. [2025-01-09 00:01:28,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 638 of 638 statements. [2025-01-09 00:01:28,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:28,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:28,639 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2025-01-09 00:01:28,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:28,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572163391] [2025-01-09 00:01:28,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572163391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:28,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:28,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:28,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330976946] [2025-01-09 00:01:28,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:28,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:28,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:28,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:28,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:28,642 INFO L87 Difference]: Start difference. First operand 20489 states and 22145 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:29,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:29,693 INFO L93 Difference]: Finished difference Result 44566 states and 48444 transitions. [2025-01-09 00:01:29,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:29,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 638 [2025-01-09 00:01:29,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:29,739 INFO L225 Difference]: With dead ends: 44566 [2025-01-09 00:01:29,739 INFO L226 Difference]: Without dead ends: 24079 [2025-01-09 00:01:29,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:29,758 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 252 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:29,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 546 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:01:29,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24079 states. [2025-01-09 00:01:30,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24079 to 23779. [2025-01-09 00:01:30,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23779 states, 23778 states have (on average 1.0647657498528051) internal successors, (25318), 23778 states have internal predecessors, (25318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:30,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23779 states to 23779 states and 25318 transitions. [2025-01-09 00:01:30,090 INFO L78 Accepts]: Start accepts. Automaton has 23779 states and 25318 transitions. Word has length 638 [2025-01-09 00:01:30,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:30,090 INFO L471 AbstractCegarLoop]: Abstraction has 23779 states and 25318 transitions. [2025-01-09 00:01:30,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:30,091 INFO L276 IsEmpty]: Start isEmpty. Operand 23779 states and 25318 transitions. [2025-01-09 00:01:30,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-01-09 00:01:30,100 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:30,101 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:30,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:01:30,101 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:30,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:30,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1999509683, now seen corresponding path program 1 times [2025-01-09 00:01:30,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:30,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5807218] [2025-01-09 00:01:30,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:30,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:30,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-01-09 00:01:30,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-01-09 00:01:30,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:30,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:30,535 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2025-01-09 00:01:30,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:30,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5807218] [2025-01-09 00:01:30,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5807218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:30,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:30,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:30,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384975139] [2025-01-09 00:01:30,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:30,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:30,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:30,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:30,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:30,537 INFO L87 Difference]: Start difference. First operand 23779 states and 25318 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:31,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:31,579 INFO L93 Difference]: Finished difference Result 48167 states and 51252 transitions. [2025-01-09 00:01:31,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:31,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 688 [2025-01-09 00:01:31,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:31,616 INFO L225 Difference]: With dead ends: 48167 [2025-01-09 00:01:31,617 INFO L226 Difference]: Without dead ends: 24390 [2025-01-09 00:01:31,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:31,638 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 264 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:31,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 525 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:01:31,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24390 states. [2025-01-09 00:01:31,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24390 to 23477. [2025-01-09 00:01:31,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23477 states, 23476 states have (on average 1.0616800136309423) internal successors, (24924), 23476 states have internal predecessors, (24924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:31,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23477 states to 23477 states and 24924 transitions. [2025-01-09 00:01:31,952 INFO L78 Accepts]: Start accepts. Automaton has 23477 states and 24924 transitions. Word has length 688 [2025-01-09 00:01:31,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:31,952 INFO L471 AbstractCegarLoop]: Abstraction has 23477 states and 24924 transitions. [2025-01-09 00:01:31,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:31,953 INFO L276 IsEmpty]: Start isEmpty. Operand 23477 states and 24924 transitions. [2025-01-09 00:01:31,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 745 [2025-01-09 00:01:31,967 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:31,967 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:31,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:01:31,968 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:31,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:31,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1779943485, now seen corresponding path program 1 times [2025-01-09 00:01:31,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:31,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999552679] [2025-01-09 00:01:31,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:31,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:32,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 744 statements into 1 equivalence classes. [2025-01-09 00:01:32,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 744 of 744 statements. [2025-01-09 00:01:32,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:32,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 602 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-01-09 00:01:32,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:32,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999552679] [2025-01-09 00:01:32,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999552679] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:32,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:32,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:32,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376948220] [2025-01-09 00:01:32,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:32,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:32,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:32,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:32,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:32,405 INFO L87 Difference]: Start difference. First operand 23477 states and 24924 transitions. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:33,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:33,290 INFO L93 Difference]: Finished difference Result 46653 states and 49545 transitions. [2025-01-09 00:01:33,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:33,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 744 [2025-01-09 00:01:33,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:33,315 INFO L225 Difference]: With dead ends: 46653 [2025-01-09 00:01:33,316 INFO L226 Difference]: Without dead ends: 23477 [2025-01-09 00:01:33,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:33,334 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 174 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:33,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 506 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:01:33,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23477 states. [2025-01-09 00:01:33,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23477 to 23477. [2025-01-09 00:01:33,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23477 states, 23476 states have (on average 1.0388481853808145) internal successors, (24388), 23476 states have internal predecessors, (24388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:33,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23477 states to 23477 states and 24388 transitions. [2025-01-09 00:01:33,552 INFO L78 Accepts]: Start accepts. Automaton has 23477 states and 24388 transitions. Word has length 744 [2025-01-09 00:01:33,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:33,552 INFO L471 AbstractCegarLoop]: Abstraction has 23477 states and 24388 transitions. [2025-01-09 00:01:33,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:33,552 INFO L276 IsEmpty]: Start isEmpty. Operand 23477 states and 24388 transitions. [2025-01-09 00:01:33,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 749 [2025-01-09 00:01:33,562 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:33,562 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:33,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:01:33,562 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:33,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:33,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1915603578, now seen corresponding path program 1 times [2025-01-09 00:01:33,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:33,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117662486] [2025-01-09 00:01:33,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:33,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:33,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 748 statements into 1 equivalence classes. [2025-01-09 00:01:33,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 748 of 748 statements. [2025-01-09 00:01:33,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:33,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:34,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 749 proven. 338 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-01-09 00:01:34,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:34,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117662486] [2025-01-09 00:01:34,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117662486] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:34,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415518068] [2025-01-09 00:01:34,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:34,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:34,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:34,542 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:01:34,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 00:01:34,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 748 statements into 1 equivalence classes. [2025-01-09 00:01:34,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 748 of 748 statements. [2025-01-09 00:01:34,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:34,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:34,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 912 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:01:34,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:01:34,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 860 proven. 0 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2025-01-09 00:01:34,980 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:01:34,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415518068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:34,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:01:34,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 00:01:34,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113132993] [2025-01-09 00:01:34,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:34,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:34,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:34,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:34,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:01:34,983 INFO L87 Difference]: Start difference. First operand 23477 states and 24388 transitions. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:35,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:35,773 INFO L93 Difference]: Finished difference Result 46357 states and 48174 transitions. [2025-01-09 00:01:35,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:35,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 748 [2025-01-09 00:01:35,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:35,799 INFO L225 Difference]: With dead ends: 46357 [2025-01-09 00:01:35,799 INFO L226 Difference]: Without dead ends: 23181 [2025-01-09 00:01:35,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:01:35,814 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 266 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:35,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 397 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:01:35,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23181 states. [2025-01-09 00:01:35,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23181 to 22574. [2025-01-09 00:01:35,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22574 states, 22573 states have (on average 1.0364594869977406) internal successors, (23396), 22573 states have internal predecessors, (23396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:35,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22574 states to 22574 states and 23396 transitions. [2025-01-09 00:01:35,984 INFO L78 Accepts]: Start accepts. Automaton has 22574 states and 23396 transitions. Word has length 748 [2025-01-09 00:01:35,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:35,984 INFO L471 AbstractCegarLoop]: Abstraction has 22574 states and 23396 transitions. [2025-01-09 00:01:35,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:35,984 INFO L276 IsEmpty]: Start isEmpty. Operand 22574 states and 23396 transitions. [2025-01-09 00:01:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 751 [2025-01-09 00:01:35,992 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:35,992 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:35,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 00:01:36,193 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,SelfDestructingSolverStorable17 [2025-01-09 00:01:36,193 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:36,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:36,194 INFO L85 PathProgramCache]: Analyzing trace with hash -101966641, now seen corresponding path program 1 times [2025-01-09 00:01:36,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:36,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084298259] [2025-01-09 00:01:36,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:36,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:36,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 750 statements into 1 equivalence classes. [2025-01-09 00:01:36,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 750 of 750 statements. [2025-01-09 00:01:36,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:36,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:37,315 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 571 proven. 188 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-01-09 00:01:37,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:37,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084298259] [2025-01-09 00:01:37,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084298259] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:37,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417026162] [2025-01-09 00:01:37,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:37,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:37,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:37,320 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:01:37,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 00:01:37,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 750 statements into 1 equivalence classes. [2025-01-09 00:01:37,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 750 of 750 statements. [2025-01-09 00:01:37,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:37,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:37,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:01:37,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:01:37,806 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 606 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2025-01-09 00:01:37,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:01:37,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417026162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:37,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:01:37,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-01-09 00:01:37,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122087028] [2025-01-09 00:01:37,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:37,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:01:37,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:37,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:01:37,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:01:37,809 INFO L87 Difference]: Start difference. First operand 22574 states and 23396 transitions. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:39,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:39,165 INFO L93 Difference]: Finished difference Result 50556 states and 52468 transitions. [2025-01-09 00:01:39,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:01:39,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 750 [2025-01-09 00:01:39,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:39,192 INFO L225 Difference]: With dead ends: 50556 [2025-01-09 00:01:39,192 INFO L226 Difference]: Without dead ends: 29481 [2025-01-09 00:01:39,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 753 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:01:39,206 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 490 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 1720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:39,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 160 Invalid, 1720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1545 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:01:39,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29481 states. [2025-01-09 00:01:39,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29481 to 27380. [2025-01-09 00:01:39,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27380 states, 27379 states have (on average 1.0391175718616459) internal successors, (28450), 27379 states have internal predecessors, (28450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:39,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27380 states to 27380 states and 28450 transitions. [2025-01-09 00:01:39,443 INFO L78 Accepts]: Start accepts. Automaton has 27380 states and 28450 transitions. Word has length 750 [2025-01-09 00:01:39,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:39,444 INFO L471 AbstractCegarLoop]: Abstraction has 27380 states and 28450 transitions. [2025-01-09 00:01:39,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:39,444 INFO L276 IsEmpty]: Start isEmpty. Operand 27380 states and 28450 transitions. [2025-01-09 00:01:39,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 771 [2025-01-09 00:01:39,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:39,453 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:39,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 00:01:39,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:39,654 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:39,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:39,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1052815688, now seen corresponding path program 1 times [2025-01-09 00:01:39,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:39,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556765450] [2025-01-09 00:01:39,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:39,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:39,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 770 statements into 1 equivalence classes. [2025-01-09 00:01:39,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 770 of 770 statements. [2025-01-09 00:01:39,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:39,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:39,985 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2025-01-09 00:01:39,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:39,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556765450] [2025-01-09 00:01:39,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556765450] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:39,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:39,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:39,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084117243] [2025-01-09 00:01:39,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:39,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:39,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:39,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:39,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:39,988 INFO L87 Difference]: Start difference. First operand 27380 states and 28450 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:40,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:40,827 INFO L93 Difference]: Finished difference Result 55351 states and 57593 transitions. [2025-01-09 00:01:40,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:40,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 770 [2025-01-09 00:01:40,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:40,857 INFO L225 Difference]: With dead ends: 55351 [2025-01-09 00:01:40,857 INFO L226 Difference]: Without dead ends: 29470 [2025-01-09 00:01:40,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:40,875 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 348 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:40,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 426 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:01:40,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29470 states. [2025-01-09 00:01:41,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29470 to 15649. [2025-01-09 00:01:41,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15649 states, 15648 states have (on average 1.0368098159509203) internal successors, (16224), 15648 states have internal predecessors, (16224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:41,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15649 states to 15649 states and 16224 transitions. [2025-01-09 00:01:41,198 INFO L78 Accepts]: Start accepts. Automaton has 15649 states and 16224 transitions. Word has length 770 [2025-01-09 00:01:41,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:41,199 INFO L471 AbstractCegarLoop]: Abstraction has 15649 states and 16224 transitions. [2025-01-09 00:01:41,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:41,199 INFO L276 IsEmpty]: Start isEmpty. Operand 15649 states and 16224 transitions. [2025-01-09 00:01:41,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-01-09 00:01:41,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:41,208 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:41,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 00:01:41,208 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:41,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:41,209 INFO L85 PathProgramCache]: Analyzing trace with hash -251487558, now seen corresponding path program 1 times [2025-01-09 00:01:41,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:41,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546038579] [2025-01-09 00:01:41,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:41,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:41,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-01-09 00:01:41,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-01-09 00:01:41,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:41,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:42,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 643 proven. 188 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-01-09 00:01:42,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:42,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546038579] [2025-01-09 00:01:42,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546038579] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:42,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049833184] [2025-01-09 00:01:42,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:42,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:42,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:42,155 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-01-09 00:01:42,156 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-01-09 00:01:42,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-01-09 00:01:42,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-01-09 00:01:42,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:42,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:42,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 00:01:42,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:01:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 700 proven. 133 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-01-09 00:01:42,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:01:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 682 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-01-09 00:01:44,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049833184] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:44,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:01:44,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 10 [2025-01-09 00:01:44,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575520810] [2025-01-09 00:01:44,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:44,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:01:44,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:44,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:01:44,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:01:44,159 INFO L87 Difference]: Start difference. First operand 15649 states and 16224 transitions. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:45,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:45,724 INFO L93 Difference]: Finished difference Result 40593 states and 42151 transitions. [2025-01-09 00:01:45,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:01:45,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 785 [2025-01-09 00:01:45,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:45,752 INFO L225 Difference]: With dead ends: 40593 [2025-01-09 00:01:45,752 INFO L226 Difference]: Without dead ends: 24946 [2025-01-09 00:01:45,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1572 GetRequests, 1564 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:01:45,759 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 429 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:45,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 77 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:01:45,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24946 states. [2025-01-09 00:01:45,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24946 to 24623. [2025-01-09 00:01:45,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24623 states, 24622 states have (on average 1.0344001299650718) internal successors, (25469), 24622 states have internal predecessors, (25469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24623 states to 24623 states and 25469 transitions. [2025-01-09 00:01:46,082 INFO L78 Accepts]: Start accepts. Automaton has 24623 states and 25469 transitions. Word has length 785 [2025-01-09 00:01:46,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:46,082 INFO L471 AbstractCegarLoop]: Abstraction has 24623 states and 25469 transitions. [2025-01-09 00:01:46,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:46,083 INFO L276 IsEmpty]: Start isEmpty. Operand 24623 states and 25469 transitions. [2025-01-09 00:01:46,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-01-09 00:01:46,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:46,102 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:46,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 00:01:46,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-09 00:01:46,304 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:46,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:46,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1141522028, now seen corresponding path program 1 times [2025-01-09 00:01:46,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:46,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750700904] [2025-01-09 00:01:46,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:46,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:46,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-01-09 00:01:46,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-01-09 00:01:46,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:46,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1453 backedges. 1062 proven. 0 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2025-01-09 00:01:46,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:46,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750700904] [2025-01-09 00:01:46,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750700904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:46,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:46,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:01:46,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82144152] [2025-01-09 00:01:46,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:46,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:01:46,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:46,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:01:46,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:01:46,893 INFO L87 Difference]: Start difference. First operand 24623 states and 25469 transitions. Second operand has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:48,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:48,216 INFO L93 Difference]: Finished difference Result 52836 states and 54630 transitions. [2025-01-09 00:01:48,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:01:48,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 829 [2025-01-09 00:01:48,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:48,260 INFO L225 Difference]: With dead ends: 52836 [2025-01-09 00:01:48,260 INFO L226 Difference]: Without dead ends: 28514 [2025-01-09 00:01:48,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:01:48,280 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 752 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:48,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 151 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:01:48,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28514 states. [2025-01-09 00:01:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28514 to 24623. [2025-01-09 00:01:48,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24623 states, 24622 states have (on average 1.0344001299650718) internal successors, (25469), 24622 states have internal predecessors, (25469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:48,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24623 states to 24623 states and 25469 transitions. [2025-01-09 00:01:48,612 INFO L78 Accepts]: Start accepts. Automaton has 24623 states and 25469 transitions. Word has length 829 [2025-01-09 00:01:48,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:48,613 INFO L471 AbstractCegarLoop]: Abstraction has 24623 states and 25469 transitions. [2025-01-09 00:01:48,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:48,613 INFO L276 IsEmpty]: Start isEmpty. Operand 24623 states and 25469 transitions. [2025-01-09 00:01:48,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 895 [2025-01-09 00:01:48,626 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:48,626 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:48,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 00:01:48,626 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:48,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:48,627 INFO L85 PathProgramCache]: Analyzing trace with hash -222656637, now seen corresponding path program 1 times [2025-01-09 00:01:48,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:48,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828754394] [2025-01-09 00:01:48,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:48,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:48,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 894 statements into 1 equivalence classes. [2025-01-09 00:01:48,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 894 of 894 statements. [2025-01-09 00:01:48,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:48,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1586 backedges. 826 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 00:01:49,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:49,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828754394] [2025-01-09 00:01:49,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828754394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:49,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:49,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:01:49,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262926216] [2025-01-09 00:01:49,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:49,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:01:49,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:49,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:01:49,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:01:49,037 INFO L87 Difference]: Start difference. First operand 24623 states and 25469 transitions. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:50,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:50,242 INFO L93 Difference]: Finished difference Result 53733 states and 55558 transitions. [2025-01-09 00:01:50,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:01:50,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 894 [2025-01-09 00:01:50,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:50,275 INFO L225 Difference]: With dead ends: 53733 [2025-01-09 00:01:50,275 INFO L226 Difference]: Without dead ends: 29411 [2025-01-09 00:01:50,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:01:50,291 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 498 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:50,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 166 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:01:50,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29411 states. [2025-01-09 00:01:50,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29411 to 24623. [2025-01-09 00:01:50,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24623 states, 24622 states have (on average 1.03403460320039) internal successors, (25460), 24622 states have internal predecessors, (25460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:50,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24623 states to 24623 states and 25460 transitions. [2025-01-09 00:01:50,529 INFO L78 Accepts]: Start accepts. Automaton has 24623 states and 25460 transitions. Word has length 894 [2025-01-09 00:01:50,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:50,529 INFO L471 AbstractCegarLoop]: Abstraction has 24623 states and 25460 transitions. [2025-01-09 00:01:50,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:50,530 INFO L276 IsEmpty]: Start isEmpty. Operand 24623 states and 25460 transitions. [2025-01-09 00:01:50,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 917 [2025-01-09 00:01:50,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:50,543 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:50,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 00:01:50,543 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:50,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:50,544 INFO L85 PathProgramCache]: Analyzing trace with hash 412816768, now seen corresponding path program 1 times [2025-01-09 00:01:50,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:50,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488636104] [2025-01-09 00:01:50,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:50,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:50,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 916 statements into 1 equivalence classes. [2025-01-09 00:01:50,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 916 of 916 statements. [2025-01-09 00:01:50,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:50,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:51,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1604 backedges. 1178 proven. 0 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-01-09 00:01:51,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:51,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488636104] [2025-01-09 00:01:51,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488636104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:51,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:51,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:51,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116745125] [2025-01-09 00:01:51,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:51,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:51,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:51,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:51,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:51,278 INFO L87 Difference]: Start difference. First operand 24623 states and 25460 transitions. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:52,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:52,272 INFO L93 Difference]: Finished difference Result 54945 states and 56846 transitions. [2025-01-09 00:01:52,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:52,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 916 [2025-01-09 00:01:52,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:52,306 INFO L225 Difference]: With dead ends: 54945 [2025-01-09 00:01:52,306 INFO L226 Difference]: Without dead ends: 30623 [2025-01-09 00:01:52,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:52,323 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 229 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:52,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 140 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:01:52,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30623 states. [2025-01-09 00:01:52,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30623 to 28508. [2025-01-09 00:01:52,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28508 states, 28507 states have (on average 1.0335356228294805) internal successors, (29463), 28507 states have internal predecessors, (29463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28508 states to 28508 states and 29463 transitions. [2025-01-09 00:01:52,765 INFO L78 Accepts]: Start accepts. Automaton has 28508 states and 29463 transitions. Word has length 916 [2025-01-09 00:01:52,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:52,766 INFO L471 AbstractCegarLoop]: Abstraction has 28508 states and 29463 transitions. [2025-01-09 00:01:52,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand 28508 states and 29463 transitions. [2025-01-09 00:01:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 946 [2025-01-09 00:01:52,786 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:52,786 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:52,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 00:01:52,788 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:52,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:52,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1086053413, now seen corresponding path program 1 times [2025-01-09 00:01:52,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:52,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353030462] [2025-01-09 00:01:52,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:52,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:52,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 945 statements into 1 equivalence classes. [2025-01-09 00:01:52,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 945 of 945 statements. [2025-01-09 00:01:52,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:52,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1611 backedges. 809 proven. 0 refuted. 0 times theorem prover too weak. 802 trivial. 0 not checked. [2025-01-09 00:01:53,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:53,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353030462] [2025-01-09 00:01:53,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353030462] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:53,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:53,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:01:53,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765024470] [2025-01-09 00:01:53,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:53,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:01:53,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:53,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:01:53,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:01:53,175 INFO L87 Difference]: Start difference. First operand 28508 states and 29463 transitions. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:54,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:54,468 INFO L93 Difference]: Finished difference Result 65394 states and 67537 transitions. [2025-01-09 00:01:54,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:01:54,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 945 [2025-01-09 00:01:54,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:54,499 INFO L225 Difference]: With dead ends: 65394 [2025-01-09 00:01:54,499 INFO L226 Difference]: Without dead ends: 34792 [2025-01-09 00:01:54,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:01:54,513 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 612 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:54,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 131 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:01:54,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34792 states. [2025-01-09 00:01:54,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34792 to 28206. [2025-01-09 00:01:54,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28206 states, 28205 states have (on average 1.0331856053891153) internal successors, (29141), 28205 states have internal predecessors, (29141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:54,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28206 states to 28206 states and 29141 transitions. [2025-01-09 00:01:54,760 INFO L78 Accepts]: Start accepts. Automaton has 28206 states and 29141 transitions. Word has length 945 [2025-01-09 00:01:54,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:54,760 INFO L471 AbstractCegarLoop]: Abstraction has 28206 states and 29141 transitions. [2025-01-09 00:01:54,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:54,760 INFO L276 IsEmpty]: Start isEmpty. Operand 28206 states and 29141 transitions. [2025-01-09 00:01:54,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 968 [2025-01-09 00:01:54,780 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:54,780 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:54,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 00:01:54,780 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:54,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:54,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1392601398, now seen corresponding path program 1 times [2025-01-09 00:01:54,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:54,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981558740] [2025-01-09 00:01:54,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:54,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:54,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 967 statements into 1 equivalence classes. [2025-01-09 00:01:54,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 967 of 967 statements. [2025-01-09 00:01:54,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:54,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:55,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1655 backedges. 1053 proven. 0 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2025-01-09 00:01:55,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:55,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981558740] [2025-01-09 00:01:55,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981558740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:55,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:55,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:01:55,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212962390] [2025-01-09 00:01:55,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:55,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:01:55,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:55,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:01:55,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:01:55,526 INFO L87 Difference]: Start difference. First operand 28206 states and 29141 transitions. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:56,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:56,785 INFO L93 Difference]: Finished difference Result 34502 states and 35609 transitions. [2025-01-09 00:01:56,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:01:56,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 967 [2025-01-09 00:01:56,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:56,819 INFO L225 Difference]: With dead ends: 34502 [2025-01-09 00:01:56,819 INFO L226 Difference]: Without dead ends: 34500 [2025-01-09 00:01:56,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:01:56,829 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 485 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:56,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 134 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:01:56,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34500 states. [2025-01-09 00:01:57,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34500 to 26111. [2025-01-09 00:01:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26111 states, 26110 states have (on average 1.0340099578705477) internal successors, (26998), 26110 states have internal predecessors, (26998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:57,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26111 states to 26111 states and 26998 transitions. [2025-01-09 00:01:57,065 INFO L78 Accepts]: Start accepts. Automaton has 26111 states and 26998 transitions. Word has length 967 [2025-01-09 00:01:57,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:57,065 INFO L471 AbstractCegarLoop]: Abstraction has 26111 states and 26998 transitions. [2025-01-09 00:01:57,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:57,066 INFO L276 IsEmpty]: Start isEmpty. Operand 26111 states and 26998 transitions. [2025-01-09 00:01:57,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 987 [2025-01-09 00:01:57,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:57,081 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:57,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 00:01:57,081 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:57,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:57,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1593125029, now seen corresponding path program 1 times [2025-01-09 00:01:57,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:57,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770865053] [2025-01-09 00:01:57,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:57,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:57,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 986 statements into 1 equivalence classes. [2025-01-09 00:01:57,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 986 of 986 statements. [2025-01-09 00:01:57,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:57,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:58,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1629 backedges. 1030 proven. 0 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2025-01-09 00:01:58,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:58,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770865053] [2025-01-09 00:01:58,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770865053] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:58,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:58,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 00:01:58,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982869807] [2025-01-09 00:01:58,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:58,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:01:58,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:58,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:01:58,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:01:58,337 INFO L87 Difference]: Start difference. First operand 26111 states and 26998 transitions. Second operand has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)