./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Primes.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Primes.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 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:55:25,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:55:25,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:55:25,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:55:25,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:55:25,890 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:55:25,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:55:25,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:55:25,891 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:55:25,891 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:55:25,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:55:25,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:55:25,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:55:25,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:55:25,892 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:55:25,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:55:25,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:55:25,892 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:55:25,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:55:25,892 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:55:25,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:55:25,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:55:25,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:55:25,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:55:25,893 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:55:25,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:55:25,893 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:55:25,893 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:55:25,893 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:55:25,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:55:25,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:55:25,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:55:25,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:55:25,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:55:25,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:55:25,893 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:55:25,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:55:25,893 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:55:25,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:55:25,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:55:25,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:55:25,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:55:25,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:55:25,894 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 -> 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e [2025-02-05 15:55:26,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:55:26,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:55:26,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:55:26,116 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:55:26,116 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:55:26,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Primes.c [2025-02-05 15:55:27,261 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a393bb4b1/41257be3e7914b718a3a1d670744a930/FLAGa9d11aec2 [2025-02-05 15:55:27,511 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:55:27,511 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive/Primes.c [2025-02-05 15:55:27,518 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a393bb4b1/41257be3e7914b718a3a1d670744a930/FLAGa9d11aec2 [2025-02-05 15:55:27,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a393bb4b1/41257be3e7914b718a3a1d670744a930 [2025-02-05 15:55:27,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:55:27,538 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:55:27,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:55:27,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:55:27,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:55:27,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:55:27" (1/1) ... [2025-02-05 15:55:27,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e451d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:27, skipping insertion in model container [2025-02-05 15:55:27,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:55:27" (1/1) ... [2025-02-05 15:55:27,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:55:27,711 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/recursive/Primes.c[2190,2203] [2025-02-05 15:55:27,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:55:27,723 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:55:27,737 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/recursive/Primes.c[2190,2203] [2025-02-05 15:55:27,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:55:27,750 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:55:27,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:27 WrapperNode [2025-02-05 15:55:27,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:55:27,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:55:27,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:55:27,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:55:27,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:27" (1/1) ... [2025-02-05 15:55:27,766 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:27" (1/1) ... [2025-02-05 15:55:27,785 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 56 [2025-02-05 15:55:27,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:55:27,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:55:27,786 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:55:27,786 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:55:27,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:27" (1/1) ... [2025-02-05 15:55:27,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:27" (1/1) ... [2025-02-05 15:55:27,800 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:27" (1/1) ... [2025-02-05 15:55:27,812 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 15:55:27,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:27" (1/1) ... [2025-02-05 15:55:27,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:27" (1/1) ... [2025-02-05 15:55:27,815 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:27" (1/1) ... [2025-02-05 15:55:27,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:27" (1/1) ... [2025-02-05 15:55:27,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:27" (1/1) ... [2025-02-05 15:55:27,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:27" (1/1) ... [2025-02-05 15:55:27,822 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:55:27,827 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:55:27,827 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:55:27,827 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:55:27,828 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:27" (1/1) ... [2025-02-05 15:55:27,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:55:27,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:27,865 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:55:27,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:55:27,889 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2025-02-05 15:55:27,890 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2025-02-05 15:55:27,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:55:27,890 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2025-02-05 15:55:27,890 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2025-02-05 15:55:27,890 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2025-02-05 15:55:27,890 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2025-02-05 15:55:27,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:55:27,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:55:27,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:55:27,942 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:55:27,944 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:55:28,012 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L33: havoc #t~ret6; [2025-02-05 15:55:28,013 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L44: havoc #t~ret8; [2025-02-05 15:55:28,013 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L36: havoc #t~ret7; [2025-02-05 15:55:28,026 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L27: havoc #t~ret5; [2025-02-05 15:55:28,027 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L19: havoc #t~ret4; [2025-02-05 15:55:28,088 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L53: havoc is_prime_#t~ret9#1; [2025-02-05 15:55:28,120 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L71: havoc #t~ret11; [2025-02-05 15:55:28,140 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-05 15:55:28,140 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:55:28,152 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:55:28,152 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:55:28,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:55:28 BoogieIcfgContainer [2025-02-05 15:55:28,153 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:55:28,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:55:28,155 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:55:28,158 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:55:28,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:55:27" (1/3) ... [2025-02-05 15:55:28,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5535727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:55:28, skipping insertion in model container [2025-02-05 15:55:28,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:55:27" (2/3) ... [2025-02-05 15:55:28,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5535727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:55:28, skipping insertion in model container [2025-02-05 15:55:28,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:55:28" (3/3) ... [2025-02-05 15:55:28,161 INFO L128 eAbstractionObserver]: Analyzing ICFG Primes.c [2025-02-05 15:55:28,173 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:55:28,175 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Primes.c that has 4 procedures, 52 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 15:55:28,213 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:55:28,221 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;@1734e658, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:55:28,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:55:28,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 39 states have internal predecessors, (56), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-05 15:55:28,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 15:55:28,229 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:28,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:28,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:28,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:28,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1842113604, now seen corresponding path program 1 times [2025-02-05 15:55:28,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:28,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521194731] [2025-02-05 15:55:28,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:28,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:28,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 15:55:28,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 15:55:28,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:28,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:28,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:55:28,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:28,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521194731] [2025-02-05 15:55:28,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521194731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:28,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:55:28,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:55:28,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475563536] [2025-02-05 15:55:28,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:28,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:55:28,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:28,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:55:28,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:55:28,390 INFO L87 Difference]: Start difference. First operand has 52 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 39 states have internal predecessors, (56), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:55:28,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:28,425 INFO L93 Difference]: Finished difference Result 58 states and 80 transitions. [2025-02-05 15:55:28,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:55:28,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-02-05 15:55:28,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:28,431 INFO L225 Difference]: With dead ends: 58 [2025-02-05 15:55:28,432 INFO L226 Difference]: Without dead ends: 49 [2025-02-05 15:55:28,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:55:28,435 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:28,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:55:28,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-05 15:55:28,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-05 15:55:28,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-05 15:55:28,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2025-02-05 15:55:28,462 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 15 [2025-02-05 15:55:28,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:28,463 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2025-02-05 15:55:28,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:55:28,464 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2025-02-05 15:55:28,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 15:55:28,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:28,466 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] [2025-02-05 15:55:28,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:55:28,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:28,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:28,467 INFO L85 PathProgramCache]: Analyzing trace with hash 415110216, now seen corresponding path program 1 times [2025-02-05 15:55:28,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:28,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431262969] [2025-02-05 15:55:28,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:28,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:28,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 15:55:28,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 15:55:28,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:28,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:28,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:55:28,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:28,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431262969] [2025-02-05 15:55:28,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431262969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:28,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:55:28,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:55:28,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356725985] [2025-02-05 15:55:28,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:28,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:55:28,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:28,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:55:28,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:55:28,686 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:55:28,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:28,732 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2025-02-05 15:55:28,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:55:28,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2025-02-05 15:55:28,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:28,737 INFO L225 Difference]: With dead ends: 71 [2025-02-05 15:55:28,737 INFO L226 Difference]: Without dead ends: 51 [2025-02-05 15:55:28,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:55:28,738 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:28,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 366 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:55:28,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-05 15:55:28,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-05 15:55:28,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-02-05 15:55:28,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2025-02-05 15:55:28,753 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 22 [2025-02-05 15:55:28,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:28,753 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2025-02-05 15:55:28,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:55:28,753 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2025-02-05 15:55:28,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 15:55:28,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:28,755 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] [2025-02-05 15:55:28,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:55:28,755 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:28,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:28,756 INFO L85 PathProgramCache]: Analyzing trace with hash -92580458, now seen corresponding path program 1 times [2025-02-05 15:55:28,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:28,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271703773] [2025-02-05 15:55:28,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:28,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:28,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 15:55:28,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 15:55:28,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:28,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:28,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:55:28,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:28,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271703773] [2025-02-05 15:55:28,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271703773] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:28,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:55:28,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:55:28,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104113060] [2025-02-05 15:55:28,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:28,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:55:28,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:28,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:55:28,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:55:28,884 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:55:28,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:28,928 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2025-02-05 15:55:28,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:55:28,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-02-05 15:55:28,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:28,930 INFO L225 Difference]: With dead ends: 57 [2025-02-05 15:55:28,930 INFO L226 Difference]: Without dead ends: 53 [2025-02-05 15:55:28,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:55:28,931 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:28,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 248 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:55:28,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-05 15:55:28,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-02-05 15:55:28,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 40 states have internal predecessors, (50), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-05 15:55:28,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2025-02-05 15:55:28,938 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 23 [2025-02-05 15:55:28,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:28,938 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2025-02-05 15:55:28,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:55:28,939 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2025-02-05 15:55:28,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 15:55:28,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:28,940 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] [2025-02-05 15:55:28,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:55:28,940 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:28,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:28,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1970568421, now seen corresponding path program 1 times [2025-02-05 15:55:28,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:28,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125932837] [2025-02-05 15:55:28,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:28,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:28,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 15:55:28,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 15:55:28,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:28,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:55:29,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:29,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125932837] [2025-02-05 15:55:29,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125932837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:29,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:55:29,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:55:29,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498352203] [2025-02-05 15:55:29,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:29,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:55:29,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:29,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:55:29,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:55:29,026 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:55:29,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:29,103 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2025-02-05 15:55:29,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:55:29,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-02-05 15:55:29,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:29,104 INFO L225 Difference]: With dead ends: 61 [2025-02-05 15:55:29,104 INFO L226 Difference]: Without dead ends: 57 [2025-02-05 15:55:29,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:55:29,108 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 6 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:29,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 215 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:55:29,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-05 15:55:29,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2025-02-05 15:55:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 40 states have internal predecessors, (50), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-05 15:55:29,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2025-02-05 15:55:29,119 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 24 [2025-02-05 15:55:29,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:29,120 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2025-02-05 15:55:29,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:55:29,120 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2025-02-05 15:55:29,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-05 15:55:29,121 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:29,121 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:55:29,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:55:29,121 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:29,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:29,121 INFO L85 PathProgramCache]: Analyzing trace with hash 982536466, now seen corresponding path program 1 times [2025-02-05 15:55:29,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:29,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633198448] [2025-02-05 15:55:29,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:29,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:29,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-05 15:55:29,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 15:55:29,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:29,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:55:29,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:29,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633198448] [2025-02-05 15:55:29,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633198448] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:29,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299856433] [2025-02-05 15:55:29,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:29,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:29,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:29,230 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:29,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:55:29,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-05 15:55:29,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 15:55:29,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:29,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:29,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:55:29,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:55:29,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:29,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:55:29,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299856433] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:29,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:29,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2025-02-05 15:55:29,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876965954] [2025-02-05 15:55:29,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:29,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:55:29,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:29,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:55:29,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:55:29,511 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-05 15:55:29,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:29,624 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2025-02-05 15:55:29,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:55:29,625 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2025-02-05 15:55:29,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:29,626 INFO L225 Difference]: With dead ends: 70 [2025-02-05 15:55:29,626 INFO L226 Difference]: Without dead ends: 51 [2025-02-05 15:55:29,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-02-05 15:55:29,627 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 17 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:29,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 375 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:55:29,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-05 15:55:29,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-05 15:55:29,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 39 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-05 15:55:29,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2025-02-05 15:55:29,640 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 31 [2025-02-05 15:55:29,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:29,640 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2025-02-05 15:55:29,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-05 15:55:29,640 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2025-02-05 15:55:29,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-05 15:55:29,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:29,641 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:55:29,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:55:29,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:29,842 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:29,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:29,842 INFO L85 PathProgramCache]: Analyzing trace with hash 389818559, now seen corresponding path program 1 times [2025-02-05 15:55:29,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:29,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918769101] [2025-02-05 15:55:29,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:29,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:29,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 15:55:29,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 15:55:29,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:29,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:30,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:55:30,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:30,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918769101] [2025-02-05 15:55:30,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918769101] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:30,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018705175] [2025-02-05 15:55:30,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:30,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:30,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:30,059 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:30,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:55:30,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 15:55:30,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 15:55:30,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:30,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:30,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 15:55:30,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:30,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:55:30,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:30,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:55:30,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018705175] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:30,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:30,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 21 [2025-02-05 15:55:30,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127737212] [2025-02-05 15:55:30,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:30,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 15:55:30,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:30,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 15:55:30,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-02-05 15:55:30,511 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 21 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 15 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-05 15:55:30,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:30,756 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2025-02-05 15:55:30,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 15:55:30,757 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 15 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2025-02-05 15:55:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:30,757 INFO L225 Difference]: With dead ends: 72 [2025-02-05 15:55:30,757 INFO L226 Difference]: Without dead ends: 54 [2025-02-05 15:55:30,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2025-02-05 15:55:30,758 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 26 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:30,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 607 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:55:30,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-05 15:55:30,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2025-02-05 15:55:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 states have internal predecessors, (44), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-05 15:55:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2025-02-05 15:55:30,769 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 32 [2025-02-05 15:55:30,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:30,770 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2025-02-05 15:55:30,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 15 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-05 15:55:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2025-02-05 15:55:30,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 15:55:30,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:30,771 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:55:30,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:55:30,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:30,976 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:30,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:30,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1757502951, now seen corresponding path program 1 times [2025-02-05 15:55:30,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:30,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087192618] [2025-02-05 15:55:30,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:30,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:30,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 15:55:30,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 15:55:30,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:30,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 15:55:31,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:31,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087192618] [2025-02-05 15:55:31,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087192618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:31,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:55:31,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:55:31,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281582204] [2025-02-05 15:55:31,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:31,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:55:31,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:31,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:55:31,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:55:31,127 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 15:55:31,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:31,171 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2025-02-05 15:55:31,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:55:31,171 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2025-02-05 15:55:31,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:31,172 INFO L225 Difference]: With dead ends: 73 [2025-02-05 15:55:31,172 INFO L226 Difference]: Without dead ends: 53 [2025-02-05 15:55:31,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:55:31,173 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 21 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:31,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 274 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:55:31,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-05 15:55:31,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2025-02-05 15:55:31,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 states have internal predecessors, (44), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-05 15:55:31,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2025-02-05 15:55:31,184 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 34 [2025-02-05 15:55:31,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:31,184 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2025-02-05 15:55:31,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 15:55:31,184 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2025-02-05 15:55:31,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 15:55:31,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:31,185 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:55:31,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:55:31,185 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:31,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:31,185 INFO L85 PathProgramCache]: Analyzing trace with hash 276018557, now seen corresponding path program 1 times [2025-02-05 15:55:31,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:31,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201596944] [2025-02-05 15:55:31,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:31,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:31,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 15:55:31,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 15:55:31,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:31,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:31,242 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:55:31,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:31,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201596944] [2025-02-05 15:55:31,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201596944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:31,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:55:31,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:55:31,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125753239] [2025-02-05 15:55:31,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:31,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:55:31,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:31,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:55:31,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:55:31,244 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 15:55:31,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:31,256 INFO L93 Difference]: Finished difference Result 102 states and 129 transitions. [2025-02-05 15:55:31,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:55:31,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2025-02-05 15:55:31,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:31,259 INFO L225 Difference]: With dead ends: 102 [2025-02-05 15:55:31,259 INFO L226 Difference]: Without dead ends: 55 [2025-02-05 15:55:31,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:55:31,260 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:31,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:55:31,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-05 15:55:31,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-05 15:55:31,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (14), 9 states have call predecessors, (14), 8 states have call successors, (14) [2025-02-05 15:55:31,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2025-02-05 15:55:31,269 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 52 [2025-02-05 15:55:31,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:31,270 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2025-02-05 15:55:31,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 15:55:31,270 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2025-02-05 15:55:31,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 15:55:31,272 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:31,273 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:55:31,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:55:31,273 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:31,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:31,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1244786785, now seen corresponding path program 1 times [2025-02-05 15:55:31,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:31,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038178411] [2025-02-05 15:55:31,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:31,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:31,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 15:55:31,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 15:55:31,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:31,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:31,383 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 15:55:31,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:31,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038178411] [2025-02-05 15:55:31,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038178411] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:31,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165365903] [2025-02-05 15:55:31,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:31,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:31,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:31,386 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:31,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:55:31,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 15:55:31,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 15:55:31,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:31,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:31,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:55:31,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 15:55:31,457 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:55:31,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165365903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:31,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:55:31,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-02-05 15:55:31,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248829127] [2025-02-05 15:55:31,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:31,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:55:31,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:31,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:55:31,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:55:31,459 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 15:55:31,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:31,504 INFO L93 Difference]: Finished difference Result 111 states and 147 transitions. [2025-02-05 15:55:31,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:55:31,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2025-02-05 15:55:31,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:31,506 INFO L225 Difference]: With dead ends: 111 [2025-02-05 15:55:31,507 INFO L226 Difference]: Without dead ends: 60 [2025-02-05 15:55:31,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:55:31,508 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 16 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:31,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 173 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:55:31,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-05 15:55:31,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-02-05 15:55:31,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (17), 10 states have call predecessors, (17), 8 states have call successors, (17) [2025-02-05 15:55:31,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2025-02-05 15:55:31,520 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 53 [2025-02-05 15:55:31,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:31,520 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2025-02-05 15:55:31,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 15:55:31,520 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2025-02-05 15:55:31,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 15:55:31,520 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:31,520 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 15:55:31,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 15:55:31,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:31,721 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:31,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:31,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1909332967, now seen corresponding path program 1 times [2025-02-05 15:55:31,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:31,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073499702] [2025-02-05 15:55:31,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:31,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:31,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 15:55:31,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 15:55:31,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:31,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:31,768 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:55:31,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:31,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073499702] [2025-02-05 15:55:31,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073499702] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:31,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:55:31,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:55:31,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217239495] [2025-02-05 15:55:31,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:31,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:55:31,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:31,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:55:31,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:55:31,770 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 15:55:31,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:31,788 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2025-02-05 15:55:31,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:55:31,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 58 [2025-02-05 15:55:31,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:31,791 INFO L225 Difference]: With dead ends: 117 [2025-02-05 15:55:31,791 INFO L226 Difference]: Without dead ends: 63 [2025-02-05 15:55:31,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:55:31,791 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:31,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:55:31,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-05 15:55:31,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2025-02-05 15:55:31,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 44 states have internal predecessors, (50), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (17), 11 states have call predecessors, (17), 8 states have call successors, (17) [2025-02-05 15:55:31,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2025-02-05 15:55:31,803 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 58 [2025-02-05 15:55:31,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:31,803 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2025-02-05 15:55:31,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 15:55:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2025-02-05 15:55:31,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 15:55:31,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:31,805 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:55:31,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:55:31,805 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:31,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:31,806 INFO L85 PathProgramCache]: Analyzing trace with hash -40373995, now seen corresponding path program 1 times [2025-02-05 15:55:31,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:31,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934821972] [2025-02-05 15:55:31,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:31,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:31,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 15:55:31,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 15:55:31,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:31,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:31,867 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 15:55:31,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:31,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934821972] [2025-02-05 15:55:31,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934821972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:31,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:55:31,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:55:31,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537749620] [2025-02-05 15:55:31,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:31,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:55:31,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:31,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:55:31,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:55:31,869 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 15:55:31,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:31,884 INFO L93 Difference]: Finished difference Result 123 states and 163 transitions. [2025-02-05 15:55:31,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:55:31,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2025-02-05 15:55:31,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:31,887 INFO L225 Difference]: With dead ends: 123 [2025-02-05 15:55:31,887 INFO L226 Difference]: Without dead ends: 68 [2025-02-05 15:55:31,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:55:31,888 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:31,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:55:31,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-05 15:55:31,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2025-02-05 15:55:31,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 48 states have internal predecessors, (53), 8 states have call successors, (8), 3 states have call predecessors, (8), 9 states have return successors, (25), 12 states have call predecessors, (25), 8 states have call successors, (25) [2025-02-05 15:55:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2025-02-05 15:55:31,900 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 86 transitions. Word has length 61 [2025-02-05 15:55:31,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:31,900 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 86 transitions. [2025-02-05 15:55:31,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 15:55:31,901 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2025-02-05 15:55:31,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 15:55:31,901 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:31,902 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-02-05 15:55:31,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:55:31,902 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:31,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:31,902 INFO L85 PathProgramCache]: Analyzing trace with hash -646414407, now seen corresponding path program 1 times [2025-02-05 15:55:31,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:31,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124293790] [2025-02-05 15:55:31,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:31,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:31,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 15:55:31,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 15:55:31,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:31,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:31,979 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:55:31,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:31,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124293790] [2025-02-05 15:55:31,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124293790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:31,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:55:31,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:55:31,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469467044] [2025-02-05 15:55:31,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:31,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:55:31,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:31,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:55:31,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:55:31,981 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 15:55:32,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:32,013 INFO L93 Difference]: Finished difference Result 130 states and 179 transitions. [2025-02-05 15:55:32,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:55:32,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2025-02-05 15:55:32,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:32,014 INFO L225 Difference]: With dead ends: 130 [2025-02-05 15:55:32,015 INFO L226 Difference]: Without dead ends: 70 [2025-02-05 15:55:32,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:55:32,015 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:32,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:55:32,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-05 15:55:32,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2025-02-05 15:55:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (17), 12 states have call predecessors, (17), 8 states have call successors, (17) [2025-02-05 15:55:32,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2025-02-05 15:55:32,024 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 67 [2025-02-05 15:55:32,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:32,024 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2025-02-05 15:55:32,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 15:55:32,025 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2025-02-05 15:55:32,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 15:55:32,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:32,026 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:55:32,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:55:32,026 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:32,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:32,026 INFO L85 PathProgramCache]: Analyzing trace with hash -150854869, now seen corresponding path program 1 times [2025-02-05 15:55:32,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:32,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208533030] [2025-02-05 15:55:32,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:32,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:32,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 15:55:32,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 15:55:32,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:32,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:32,083 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 15:55:32,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:32,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208533030] [2025-02-05 15:55:32,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208533030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:32,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:55:32,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:55:32,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067303510] [2025-02-05 15:55:32,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:32,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:55:32,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:32,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:55:32,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:55:32,085 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 15:55:32,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:32,102 INFO L93 Difference]: Finished difference Result 129 states and 171 transitions. [2025-02-05 15:55:32,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:55:32,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2025-02-05 15:55:32,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:32,103 INFO L225 Difference]: With dead ends: 129 [2025-02-05 15:55:32,103 INFO L226 Difference]: Without dead ends: 73 [2025-02-05 15:55:32,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:55:32,104 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:32,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:55:32,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-05 15:55:32,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2025-02-05 15:55:32,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 8 states have call successors, (8), 3 states have call predecessors, (8), 10 states have return successors, (28), 15 states have call predecessors, (28), 8 states have call successors, (28) [2025-02-05 15:55:32,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2025-02-05 15:55:32,109 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 68 [2025-02-05 15:55:32,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:32,109 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2025-02-05 15:55:32,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 15:55:32,109 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2025-02-05 15:55:32,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 15:55:32,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:32,110 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:55:32,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:55:32,110 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:32,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:32,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1942840221, now seen corresponding path program 1 times [2025-02-05 15:55:32,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:32,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720599782] [2025-02-05 15:55:32,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:32,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:32,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 15:55:32,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 15:55:32,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:32,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:32,194 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 15:55:32,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:32,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720599782] [2025-02-05 15:55:32,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720599782] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:32,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804730842] [2025-02-05 15:55:32,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:32,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:32,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:32,197 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:32,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:55:32,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 15:55:32,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 15:55:32,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:32,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:32,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:55:32,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 15:55:32,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:32,598 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 15:55:32,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804730842] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:32,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:32,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-02-05 15:55:32,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361836027] [2025-02-05 15:55:32,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:32,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 15:55:32,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:32,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 15:55:32,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:55:32,600 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 9 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (12), 4 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-05 15:55:32,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:32,768 INFO L93 Difference]: Finished difference Result 111 states and 154 transitions. [2025-02-05 15:55:32,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:55:32,769 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 9 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (12), 4 states have call predecessors, (12), 9 states have call successors, (12) Word has length 62 [2025-02-05 15:55:32,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:32,770 INFO L225 Difference]: With dead ends: 111 [2025-02-05 15:55:32,770 INFO L226 Difference]: Without dead ends: 81 [2025-02-05 15:55:32,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-02-05 15:55:32,771 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 29 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:32,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 278 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:55:32,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-05 15:55:32,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2025-02-05 15:55:32,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 8 states have call successors, (8), 3 states have call predecessors, (8), 12 states have return successors, (34), 17 states have call predecessors, (34), 8 states have call successors, (34) [2025-02-05 15:55:32,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2025-02-05 15:55:32,779 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 103 transitions. Word has length 62 [2025-02-05 15:55:32,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:32,779 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 103 transitions. [2025-02-05 15:55:32,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 9 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (12), 4 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-05 15:55:32,780 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 103 transitions. [2025-02-05 15:55:32,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 15:55:32,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:32,782 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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] [2025-02-05 15:55:32,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 15:55:32,982 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,SelfDestructingSolverStorable13 [2025-02-05 15:55:32,983 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:32,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:32,984 INFO L85 PathProgramCache]: Analyzing trace with hash 827845035, now seen corresponding path program 1 times [2025-02-05 15:55:32,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:32,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099360533] [2025-02-05 15:55:32,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:32,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:32,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 15:55:32,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 15:55:32,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:32,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:33,058 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-05 15:55:33,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:33,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099360533] [2025-02-05 15:55:33,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099360533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:33,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:55:33,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:55:33,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911789165] [2025-02-05 15:55:33,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:33,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:55:33,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:33,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:55:33,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:55:33,059 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (8), 6 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:55:33,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:33,101 INFO L93 Difference]: Finished difference Result 159 states and 224 transitions. [2025-02-05 15:55:33,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:55:33,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (8), 6 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-02-05 15:55:33,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:33,103 INFO L225 Difference]: With dead ends: 159 [2025-02-05 15:55:33,103 INFO L226 Difference]: Without dead ends: 88 [2025-02-05 15:55:33,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:55:33,104 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:33,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 315 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:55:33,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-05 15:55:33,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2025-02-05 15:55:33,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 50 states have internal predecessors, (58), 8 states have call successors, (8), 3 states have call predecessors, (8), 10 states have return successors, (26), 16 states have call predecessors, (26), 8 states have call successors, (26) [2025-02-05 15:55:33,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2025-02-05 15:55:33,111 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 74 [2025-02-05 15:55:33,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:33,111 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2025-02-05 15:55:33,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (8), 6 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:55:33,111 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2025-02-05 15:55:33,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 15:55:33,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:33,113 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-02-05 15:55:33,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:55:33,113 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:33,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:33,113 INFO L85 PathProgramCache]: Analyzing trace with hash -882036813, now seen corresponding path program 1 times [2025-02-05 15:55:33,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:33,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388039123] [2025-02-05 15:55:33,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:33,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:33,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 15:55:33,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 15:55:33,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:33,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:33,161 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:55:33,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:33,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388039123] [2025-02-05 15:55:33,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388039123] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:33,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61769174] [2025-02-05 15:55:33,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:33,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:33,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:33,164 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:33,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:55:33,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 15:55:33,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 15:55:33,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:33,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:33,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:55:33,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:33,230 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 15:55:33,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:55:33,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61769174] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:33,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:33,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-05 15:55:33,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120800066] [2025-02-05 15:55:33,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:33,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:55:33,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:33,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:55:33,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:55:33,320 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand has 7 states, 5 states have (on average 11.2) internal successors, (56), 7 states have internal predecessors, (56), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 5 states have call successors, (11) [2025-02-05 15:55:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:33,374 INFO L93 Difference]: Finished difference Result 158 states and 221 transitions. [2025-02-05 15:55:33,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:55:33,375 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.2) internal successors, (56), 7 states have internal predecessors, (56), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 5 states have call successors, (11) Word has length 68 [2025-02-05 15:55:33,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:33,375 INFO L225 Difference]: With dead ends: 158 [2025-02-05 15:55:33,375 INFO L226 Difference]: Without dead ends: 69 [2025-02-05 15:55:33,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:55:33,376 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 18 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:33,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 282 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:55:33,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-05 15:55:33,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2025-02-05 15:55:33,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 49 states have internal predecessors, (53), 7 states have call successors, (7), 3 states have call predecessors, (7), 10 states have return successors, (20), 12 states have call predecessors, (20), 7 states have call successors, (20) [2025-02-05 15:55:33,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2025-02-05 15:55:33,384 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 68 [2025-02-05 15:55:33,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:33,384 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2025-02-05 15:55:33,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.2) internal successors, (56), 7 states have internal predecessors, (56), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 5 states have call successors, (11) [2025-02-05 15:55:33,384 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2025-02-05 15:55:33,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 15:55:33,387 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:33,387 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-02-05 15:55:33,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 15:55:33,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 15:55:33,588 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:33,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:33,588 INFO L85 PathProgramCache]: Analyzing trace with hash -177559633, now seen corresponding path program 2 times [2025-02-05 15:55:33,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:33,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695632756] [2025-02-05 15:55:33,589 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:55:33,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:33,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-02-05 15:55:33,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 15:55:33,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:55:33,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:33,788 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 15:55:33,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:33,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695632756] [2025-02-05 15:55:33,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695632756] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:33,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48899530] [2025-02-05 15:55:33,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:55:33,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:33,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:33,790 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:33,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:55:33,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-02-05 15:55:33,841 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 15:55:33,842 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:55:33,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:33,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 15:55:33,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:34,001 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:55:34,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:34,595 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 15:55:34,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48899530] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:34,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:34,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 21 [2025-02-05 15:55:34,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527544961] [2025-02-05 15:55:34,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:34,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 15:55:34,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:34,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 15:55:34,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2025-02-05 15:55:34,599 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 21 states, 17 states have (on average 5.470588235294118) internal successors, (93), 21 states have internal predecessors, (93), 13 states have call successors, (16), 2 states have call predecessors, (16), 7 states have return successors, (18), 6 states have call predecessors, (18), 13 states have call successors, (18) [2025-02-05 15:55:34,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:34,865 INFO L93 Difference]: Finished difference Result 110 states and 141 transitions. [2025-02-05 15:55:34,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 15:55:34,865 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 5.470588235294118) internal successors, (93), 21 states have internal predecessors, (93), 13 states have call successors, (16), 2 states have call predecessors, (16), 7 states have return successors, (18), 6 states have call predecessors, (18), 13 states have call successors, (18) Word has length 71 [2025-02-05 15:55:34,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:34,867 INFO L225 Difference]: With dead ends: 110 [2025-02-05 15:55:34,867 INFO L226 Difference]: Without dead ends: 90 [2025-02-05 15:55:34,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 131 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2025-02-05 15:55:34,868 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 46 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:34,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 455 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:55:34,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-05 15:55:34,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 77. [2025-02-05 15:55:34,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 57 states have internal predecessors, (62), 8 states have call successors, (8), 3 states have call predecessors, (8), 13 states have return successors, (29), 16 states have call predecessors, (29), 8 states have call successors, (29) [2025-02-05 15:55:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2025-02-05 15:55:34,877 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 71 [2025-02-05 15:55:34,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:34,877 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2025-02-05 15:55:34,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 5.470588235294118) internal successors, (93), 21 states have internal predecessors, (93), 13 states have call successors, (16), 2 states have call predecessors, (16), 7 states have return successors, (18), 6 states have call predecessors, (18), 13 states have call successors, (18) [2025-02-05 15:55:34,878 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2025-02-05 15:55:34,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 15:55:34,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:34,879 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2025-02-05 15:55:34,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 15:55:35,083 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,SelfDestructingSolverStorable16 [2025-02-05 15:55:35,083 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:35,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:35,083 INFO L85 PathProgramCache]: Analyzing trace with hash 210319419, now seen corresponding path program 1 times [2025-02-05 15:55:35,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:35,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181559423] [2025-02-05 15:55:35,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:35,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:35,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 15:55:35,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 15:55:35,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:35,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:35,142 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-05 15:55:35,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:35,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181559423] [2025-02-05 15:55:35,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181559423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:35,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:55:35,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:55:35,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331741473] [2025-02-05 15:55:35,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:35,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:55:35,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:35,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:55:35,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:55:35,145 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 15:55:35,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:35,173 INFO L93 Difference]: Finished difference Result 150 states and 215 transitions. [2025-02-05 15:55:35,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:55:35,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 78 [2025-02-05 15:55:35,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:35,175 INFO L225 Difference]: With dead ends: 150 [2025-02-05 15:55:35,175 INFO L226 Difference]: Without dead ends: 77 [2025-02-05 15:55:35,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:55:35,178 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 9 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:35,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 173 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:55:35,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-05 15:55:35,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-05 15:55:35,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 57 states have internal predecessors, (62), 8 states have call successors, (8), 3 states have call predecessors, (8), 13 states have return successors, (26), 16 states have call predecessors, (26), 8 states have call successors, (26) [2025-02-05 15:55:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 96 transitions. [2025-02-05 15:55:35,185 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 96 transitions. Word has length 78 [2025-02-05 15:55:35,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:35,185 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 96 transitions. [2025-02-05 15:55:35,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 15:55:35,185 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2025-02-05 15:55:35,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 15:55:35,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:35,186 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 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] [2025-02-05 15:55:35,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:55:35,186 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:35,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:35,187 INFO L85 PathProgramCache]: Analyzing trace with hash -291314303, now seen corresponding path program 2 times [2025-02-05 15:55:35,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:35,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035025444] [2025-02-05 15:55:35,187 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:55:35,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:35,193 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-02-05 15:55:35,201 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 15:55:35,201 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:55:35,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 19 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:55:35,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:35,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035025444] [2025-02-05 15:55:35,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035025444] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:35,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710941608] [2025-02-05 15:55:35,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:55:35,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:35,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:35,319 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:35,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:55:35,350 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-02-05 15:55:35,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 15:55:35,370 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:55:35,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:35,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 15:55:35,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:35,532 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 60 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 15:55:35,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:36,871 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 62 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 15:55:36,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710941608] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:36,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:36,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 24 [2025-02-05 15:55:36,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644045498] [2025-02-05 15:55:36,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:36,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 15:55:36,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:36,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 15:55:36,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2025-02-05 15:55:36,873 INFO L87 Difference]: Start difference. First operand 77 states and 96 transitions. Second operand has 24 states, 23 states have (on average 5.260869565217392) internal successors, (121), 24 states have internal predecessors, (121), 16 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (23), 7 states have call predecessors, (23), 16 states have call successors, (23) [2025-02-05 15:55:37,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:37,144 INFO L93 Difference]: Finished difference Result 125 states and 174 transitions. [2025-02-05 15:55:37,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 15:55:37,144 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.260869565217392) internal successors, (121), 24 states have internal predecessors, (121), 16 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (23), 7 states have call predecessors, (23), 16 states have call successors, (23) Word has length 87 [2025-02-05 15:55:37,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:37,145 INFO L225 Difference]: With dead ends: 125 [2025-02-05 15:55:37,145 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 15:55:37,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 154 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 15:55:37,146 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 58 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:37,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 296 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:55:37,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 15:55:37,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 15:55:37,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-02-05 15:55:37,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 15:55:37,147 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2025-02-05 15:55:37,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:37,148 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 15:55:37,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.260869565217392) internal successors, (121), 24 states have internal predecessors, (121), 16 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (23), 7 states have call predecessors, (23), 16 states have call successors, (23) [2025-02-05 15:55:37,149 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 15:55:37,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 15:55:37,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:55:37,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 15:55:37,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:37,354 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:37,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 15:55:38,072 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:55:38,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:55:38 BoogieIcfgContainer [2025-02-05 15:55:38,076 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:55:38,076 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:55:38,077 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:55:38,077 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:55:38,077 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:55:28" (3/4) ... [2025-02-05 15:55:38,078 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 15:55:38,082 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure multiple_of [2025-02-05 15:55:38,083 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure mult [2025-02-05 15:55:38,083 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure is_prime_ [2025-02-05 15:55:38,085 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-02-05 15:55:38,085 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-05 15:55:38,086 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 15:55:38,086 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 15:55:38,148 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:55:38,149 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:55:38,149 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:55:38,149 INFO L158 Benchmark]: Toolchain (without parser) took 10611.01ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 104.3MB in the beginning and 109.2MB in the end (delta: -5.0MB). Peak memory consumption was 148.6MB. Max. memory is 16.1GB. [2025-02-05 15:55:38,149 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:55:38,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.36ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 93.3MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:55:38,150 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.87ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:55:38,150 INFO L158 Benchmark]: Boogie Preprocessor took 36.44ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 90.7MB in the end (delta: 877.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:55:38,150 INFO L158 Benchmark]: IcfgBuilder took 326.50ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 77.0MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:55:38,150 INFO L158 Benchmark]: TraceAbstraction took 9920.85ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 75.7MB in the beginning and 114.1MB in the end (delta: -38.4MB). Peak memory consumption was 132.4MB. Max. memory is 16.1GB. [2025-02-05 15:55:38,150 INFO L158 Benchmark]: Witness Printer took 72.20ms. Allocated memory is still 293.6MB. Free memory was 114.1MB in the beginning and 109.2MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:55:38,151 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.36ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 93.3MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.87ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.44ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 90.7MB in the end (delta: 877.3kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 326.50ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 77.0MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9920.85ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 75.7MB in the beginning and 114.1MB in the end (delta: -38.4MB). Peak memory consumption was 132.4MB. Max. memory is 16.1GB. * Witness Printer took 72.20ms. Allocated memory is still 293.6MB. Free memory was 114.1MB in the beginning and 109.2MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 98]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 19, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 285 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 246 mSDsluCounter, 5318 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4289 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1593 IncrementalHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 1029 mSDtfsCounter, 1593 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 917 GetRequests, 728 SyntacticMatches, 20 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=17, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 74 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1384 NumberOfCodeBlocks, 1384 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1703 ConstructedInterpolants, 0 QuantifiedInterpolants, 3717 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1185 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 32 InterpolantComputations, 13 PerfectInterpolantSequences, 487/757 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-05 15:55:38,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE