./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/nested_1-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-acceleration/nested_1-2.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 8828f6ff39cd2bcfba4fe3d04f0119d60137bcad91eabef2e2b840cbd0802b98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:55:51,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:55:51,974 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:55:51,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:55:51,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:55:52,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:55:52,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:55:52,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:55:52,003 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:55:52,003 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:55:52,004 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:55:52,004 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:55:52,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:55:52,004 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:55:52,005 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:55:52,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:55:52,005 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:55:52,005 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:55:52,005 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:55:52,005 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:55:52,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:55:52,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:55:52,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:55:52,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:55:52,006 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:55:52,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:55:52,006 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:55:52,006 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:55:52,006 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:55:52,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:55:52,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:55:52,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:55:52,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:55:52,007 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:55:52,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:55:52,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:55:52,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:55:52,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:55:52,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:55:52,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:55:52,007 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:55:52,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:55:52,008 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:55:52,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:55:52,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:55:52,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:55:52,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:55:52,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:55:52,008 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 -> 8828f6ff39cd2bcfba4fe3d04f0119d60137bcad91eabef2e2b840cbd0802b98 [2025-01-09 02:55:52,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:55:52,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:55:52,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:55:52,246 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:55:52,246 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:55:52,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/nested_1-2.c [2025-01-09 02:55:53,462 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90405951c/67b1d55a14dc4ad09230981953d84e6a/FLAG903d4324a [2025-01-09 02:55:53,650 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:55:53,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-acceleration/nested_1-2.c [2025-01-09 02:55:53,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90405951c/67b1d55a14dc4ad09230981953d84e6a/FLAG903d4324a [2025-01-09 02:55:54,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90405951c/67b1d55a14dc4ad09230981953d84e6a [2025-01-09 02:55:54,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:55:54,030 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:55:54,031 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:55:54,031 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:55:54,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:55:54,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:55:54" (1/1) ... [2025-01-09 02:55:54,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4238d22e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:54, skipping insertion in model container [2025-01-09 02:55:54,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:55:54" (1/1) ... [2025-01-09 02:55:54,044 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:55:54,130 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/loop-acceleration/nested_1-2.c[322,335] [2025-01-09 02:55:54,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:55:54,144 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:55:54,150 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/loop-acceleration/nested_1-2.c[322,335] [2025-01-09 02:55:54,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:55:54,161 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:55:54,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:54 WrapperNode [2025-01-09 02:55:54,162 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:55:54,163 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:55:54,163 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:55:54,163 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:55:54,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:54" (1/1) ... [2025-01-09 02:55:54,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:54" (1/1) ... [2025-01-09 02:55:54,177 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27 [2025-01-09 02:55:54,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:55:54,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:55:54,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:55:54,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:55:54,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:54" (1/1) ... [2025-01-09 02:55:54,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:54" (1/1) ... [2025-01-09 02:55:54,184 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:54" (1/1) ... [2025-01-09 02:55:54,189 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 02:55:54,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:54" (1/1) ... [2025-01-09 02:55:54,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:54" (1/1) ... [2025-01-09 02:55:54,191 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:54" (1/1) ... [2025-01-09 02:55:54,191 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:54" (1/1) ... [2025-01-09 02:55:54,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:54" (1/1) ... [2025-01-09 02:55:54,193 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:54" (1/1) ... [2025-01-09 02:55:54,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:54" (1/1) ... [2025-01-09 02:55:54,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:55:54,195 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:55:54,195 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:55:54,195 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:55:54,196 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:54" (1/1) ... [2025-01-09 02:55:54,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:55:54,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:55:54,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 02:55:54,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 02:55:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:55:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:55:54,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:55:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:55:54,265 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:55:54,266 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:55:54,332 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 02:55:54,332 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:55:54,337 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:55:54,338 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 02:55:54,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:55:54 BoogieIcfgContainer [2025-01-09 02:55:54,339 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:55:54,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:55:54,342 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:55:54,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:55:54,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:55:54" (1/3) ... [2025-01-09 02:55:54,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d11f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:55:54, skipping insertion in model container [2025-01-09 02:55:54,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:55:54" (2/3) ... [2025-01-09 02:55:54,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d11f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:55:54, skipping insertion in model container [2025-01-09 02:55:54,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:55:54" (3/3) ... [2025-01-09 02:55:54,349 INFO L128 eAbstractionObserver]: Analyzing ICFG nested_1-2.c [2025-01-09 02:55:54,359 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:55:54,361 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nested_1-2.c that has 1 procedures, 11 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 02:55:54,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:55:54,412 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;@427083ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:55:54,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:55:54,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:54,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 02:55:54,419 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:55:54,419 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 02:55:54,420 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:55:54,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:55:54,425 INFO L85 PathProgramCache]: Analyzing trace with hash 28702733, now seen corresponding path program 1 times [2025-01-09 02:55:54,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:55:54,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486933141] [2025-01-09 02:55:54,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:55:54,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:55:54,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 02:55:54,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 02:55:54,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:55:54,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:54,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:55:54,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486933141] [2025-01-09 02:55:54,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486933141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:55:54,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:55:54,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:55:54,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886777855] [2025-01-09 02:55:54,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:55:54,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:55:54,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:55:54,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:55:54,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:55:54,633 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:54,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:55:54,675 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2025-01-09 02:55:54,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:55:54,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 02:55:54,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:55:54,681 INFO L225 Difference]: With dead ends: 20 [2025-01-09 02:55:54,681 INFO L226 Difference]: Without dead ends: 9 [2025-01-09 02:55:54,683 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-01-09 02:55:54,685 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:55:54,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 23 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:55:54,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-01-09 02:55:54,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-01-09 02:55:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:54,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2025-01-09 02:55:54,703 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2025-01-09 02:55:54,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:55:54,703 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-01-09 02:55:54,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:54,703 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2025-01-09 02:55:54,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 02:55:54,703 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:55:54,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:55:54,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:55:54,704 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:55:54,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:55:54,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1805981255, now seen corresponding path program 1 times [2025-01-09 02:55:54,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:55:54,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180245324] [2025-01-09 02:55:54,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:55:54,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:55:54,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 02:55:54,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 02:55:54,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:55:54,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:54,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:54,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:55:54,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180245324] [2025-01-09 02:55:54,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180245324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:55:54,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:55:54,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:55:54,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71611710] [2025-01-09 02:55:54,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:55:54,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:55:54,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:55:54,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:55:54,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:55:54,784 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:55:54,792 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2025-01-09 02:55:54,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:55:54,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 02:55:54,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:55:54,793 INFO L225 Difference]: With dead ends: 14 [2025-01-09 02:55:54,793 INFO L226 Difference]: Without dead ends: 9 [2025-01-09 02:55:54,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:55:54,794 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:55:54,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:55:54,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-01-09 02:55:54,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-01-09 02:55:54,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:54,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2025-01-09 02:55:54,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2025-01-09 02:55:54,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:55:54,798 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-01-09 02:55:54,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:54,799 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2025-01-09 02:55:54,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 02:55:54,799 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:55:54,800 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:55:54,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:55:54,800 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:55:54,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:55:54,800 INFO L85 PathProgramCache]: Analyzing trace with hash 148934507, now seen corresponding path program 1 times [2025-01-09 02:55:54,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:55:54,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764103290] [2025-01-09 02:55:54,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:55:54,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:55:54,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 02:55:54,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 02:55:54,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:55:54,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:54,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:54,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:55:54,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764103290] [2025-01-09 02:55:54,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764103290] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:55:54,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496436134] [2025-01-09 02:55:54,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:55:54,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:55:54,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:55:54,920 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:55:54,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 02:55:54,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 02:55:54,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 02:55:54,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:55:54,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:54,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 02:55:54,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:55:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:54,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:55:55,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:55:55,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496436134] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:55:55,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:55:55,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2025-01-09 02:55:55,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902647270] [2025-01-09 02:55:55,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:55:55,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 02:55:55,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:55:55,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 02:55:55,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 02:55:55,035 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:55,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:55:55,196 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2025-01-09 02:55:55,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 02:55:55,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-09 02:55:55,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:55:55,197 INFO L225 Difference]: With dead ends: 28 [2025-01-09 02:55:55,197 INFO L226 Difference]: Without dead ends: 22 [2025-01-09 02:55:55,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2025-01-09 02:55:55,198 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:55:55,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:55:55,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-09 02:55:55,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-01-09 02:55:55,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:55,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-01-09 02:55:55,202 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 8 [2025-01-09 02:55:55,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:55:55,202 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-01-09 02:55:55,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:55,202 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-01-09 02:55:55,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 02:55:55,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:55:55,202 INFO L218 NwaCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1, 1, 1] [2025-01-09 02:55:55,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 02:55:55,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:55:55,403 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:55:55,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:55:55,403 INFO L85 PathProgramCache]: Analyzing trace with hash 716272885, now seen corresponding path program 2 times [2025-01-09 02:55:55,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:55:55,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081195903] [2025-01-09 02:55:55,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:55:55,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:55:55,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-09 02:55:55,427 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 02:55:55,427 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:55:55,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:55,641 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 02:55:55,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:55:55,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081195903] [2025-01-09 02:55:55,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081195903] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:55:55,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592798105] [2025-01-09 02:55:55,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:55:55,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:55:55,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:55:55,644 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:55:55,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 02:55:55,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-09 02:55:55,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 02:55:55,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:55:55,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:55,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 02:55:55,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:55:55,747 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 02:55:55,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:55:55,810 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 02:55:55,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592798105] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:55:55,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:55:55,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 12 [2025-01-09 02:55:55,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140738026] [2025-01-09 02:55:55,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:55:55,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 02:55:55,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:55:55,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 02:55:55,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 02:55:55,811 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:55,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:55:55,857 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2025-01-09 02:55:55,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 02:55:55,857 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-01-09 02:55:55,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:55:55,857 INFO L225 Difference]: With dead ends: 37 [2025-01-09 02:55:55,857 INFO L226 Difference]: Without dead ends: 33 [2025-01-09 02:55:55,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 02:55:55,858 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:55:55,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 48 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:55:55,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-09 02:55:55,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2025-01-09 02:55:55,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:55,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2025-01-09 02:55:55,864 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 21 [2025-01-09 02:55:55,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:55:55,864 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2025-01-09 02:55:55,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:55,864 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2025-01-09 02:55:55,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 02:55:55,864 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:55:55,864 INFO L218 NwaCegarLoop]: trace histogram [10, 5, 5, 1, 1, 1, 1, 1] [2025-01-09 02:55:55,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 02:55:56,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:55:56,068 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:55:56,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:55:56,068 INFO L85 PathProgramCache]: Analyzing trace with hash 649528239, now seen corresponding path program 3 times [2025-01-09 02:55:56,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:55:56,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22676873] [2025-01-09 02:55:56,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:55:56,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:55:56,073 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 11 equivalence classes. [2025-01-09 02:55:56,084 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 13 of 25 statements. [2025-01-09 02:55:56,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-09 02:55:56,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 41 proven. 3 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-09 02:55:56,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:55:56,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22676873] [2025-01-09 02:55:56,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22676873] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:55:56,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272358114] [2025-01-09 02:55:56,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:55:56,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:55:56,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:55:56,146 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:55:56,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 02:55:56,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 11 equivalence classes. [2025-01-09 02:55:56,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 13 of 25 statements. [2025-01-09 02:55:56,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-09 02:55:56,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:56,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 02:55:56,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:55:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 41 proven. 3 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-09 02:55:56,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:55:56,219 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 41 proven. 3 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-09 02:55:56,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272358114] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:55:56,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:55:56,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-09 02:55:56,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917343478] [2025-01-09 02:55:56,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:55:56,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 02:55:56,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:55:56,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 02:55:56,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-09 02:55:56,221 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:56,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:55:56,278 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2025-01-09 02:55:56,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 02:55:56,279 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-09 02:55:56,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:55:56,280 INFO L225 Difference]: With dead ends: 66 [2025-01-09 02:55:56,281 INFO L226 Difference]: Without dead ends: 46 [2025-01-09 02:55:56,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-01-09 02:55:56,282 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:55:56,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:55:56,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-09 02:55:56,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-01-09 02:55:56,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:56,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2025-01-09 02:55:56,295 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 25 [2025-01-09 02:55:56,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:55:56,295 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2025-01-09 02:55:56,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:56,296 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2025-01-09 02:55:56,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 02:55:56,296 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:55:56,296 INFO L218 NwaCegarLoop]: trace histogram [30, 5, 5, 1, 1, 1, 1, 1] [2025-01-09 02:55:56,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 02:55:56,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:55:56,497 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:55:56,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:55:56,497 INFO L85 PathProgramCache]: Analyzing trace with hash -562147665, now seen corresponding path program 4 times [2025-01-09 02:55:56,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:55:56,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799675204] [2025-01-09 02:55:56,498 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 02:55:56,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:55:56,503 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-01-09 02:55:56,516 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 02:55:56,516 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 02:55:56,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 201 proven. 21 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-01-09 02:55:56,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:55:56,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799675204] [2025-01-09 02:55:56,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799675204] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:55:56,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448961691] [2025-01-09 02:55:56,643 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 02:55:56,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:55:56,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:55:56,645 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:55:56,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 02:55:56,672 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-01-09 02:55:56,691 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 02:55:56,692 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 02:55:56,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:56,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 02:55:56,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:55:56,897 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 526 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 02:55:56,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:55:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 6 proven. 520 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 02:55:57,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448961691] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:55:57,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:55:57,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 33 [2025-01-09 02:55:57,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885554270] [2025-01-09 02:55:57,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:55:57,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 02:55:57,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:55:57,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 02:55:57,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=818, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 02:55:57,293 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 33 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:56:11,012 WARN L286 SmtUtils]: Spent 12.12s on a formula simplification. DAG size of input: 40 DAG size of output: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 02:56:35,188 WARN L286 SmtUtils]: Spent 24.10s on a formula simplification. DAG size of input: 44 DAG size of output: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 02:57:03,434 WARN L286 SmtUtils]: Spent 28.12s on a formula simplification. DAG size of input: 48 DAG size of output: 40 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)