./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/interleave_bits.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/interleave_bits.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:47:11,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:47:11,207 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:47:11,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:47:11,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:47:11,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:47:11,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:47:11,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:47:11,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:47:11,235 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:47:11,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:47:11,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:47:11,235 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:47:11,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:47:11,235 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:47:11,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:47:11,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:47:11,235 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:47:11,235 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:47:11,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:47:11,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:47:11,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:47:11,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:47:11,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:47:11,236 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:47:11,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:47:11,236 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:47:11,236 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:47:11,236 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:47:11,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:47:11,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:47:11,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:47:11,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:47:11,236 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:47:11,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:47:11,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:47:11,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:47:11,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:47:11,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:47:11,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:47:11,238 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:47:11,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:47:11,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:47:11,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:47:11,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:47:11,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:47:11,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:47:11,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:47:11,239 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 -> 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb [2025-01-08 22:47:11,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:47:11,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:47:11,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:47:11,441 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:47:11,442 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:47:11,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/interleave_bits.i [2025-01-08 22:47:12,520 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5736e3d4/ff158a90067f46fab8a311faa3f9ed37/FLAGdf20c9325 [2025-01-08 22:47:12,781 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:47:12,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2025-01-08 22:47:12,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5736e3d4/ff158a90067f46fab8a311faa3f9ed37/FLAGdf20c9325 [2025-01-08 22:47:12,802 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5736e3d4/ff158a90067f46fab8a311faa3f9ed37 [2025-01-08 22:47:12,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:47:12,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:47:12,806 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:47:12,806 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:47:12,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:47:12,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:47:12" (1/1) ... [2025-01-08 22:47:12,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f13129e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:12, skipping insertion in model container [2025-01-08 22:47:12,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:47:12" (1/1) ... [2025-01-08 22:47:12,838 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:47:12,953 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/bitvector/interleave_bits.i[1175,1188] [2025-01-08 22:47:12,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:47:12,982 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:47:12,989 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/bitvector/interleave_bits.i[1175,1188] [2025-01-08 22:47:13,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:47:13,010 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:47:13,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:13 WrapperNode [2025-01-08 22:47:13,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:47:13,012 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:47:13,012 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:47:13,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:47:13,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:13" (1/1) ... [2025-01-08 22:47:13,022 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:13" (1/1) ... [2025-01-08 22:47:13,044 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 232 [2025-01-08 22:47:13,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:47:13,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:47:13,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:47:13,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:47:13,056 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:13" (1/1) ... [2025-01-08 22:47:13,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:13" (1/1) ... [2025-01-08 22:47:13,061 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:13" (1/1) ... [2025-01-08 22:47:13,076 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-08 22:47:13,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:13" (1/1) ... [2025-01-08 22:47:13,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:13" (1/1) ... [2025-01-08 22:47:13,079 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:13" (1/1) ... [2025-01-08 22:47:13,084 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:13" (1/1) ... [2025-01-08 22:47:13,089 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:13" (1/1) ... [2025-01-08 22:47:13,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:13" (1/1) ... [2025-01-08 22:47:13,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:13" (1/1) ... [2025-01-08 22:47:13,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:47:13,096 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:47:13,096 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:47:13,096 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:47:13,096 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:13" (1/1) ... [2025-01-08 22:47:13,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:47:13,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:13,119 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-08 22:47:13,122 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-08 22:47:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:47:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:47:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:47:13,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:47:13,184 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:47:13,186 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:47:14,607 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-01-08 22:47:14,607 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:47:14,619 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:47:14,619 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:47:14,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:47:14 BoogieIcfgContainer [2025-01-08 22:47:14,619 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:47:14,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:47:14,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:47:14,624 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:47:14,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:47:12" (1/3) ... [2025-01-08 22:47:14,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735cc23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:47:14, skipping insertion in model container [2025-01-08 22:47:14,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:13" (2/3) ... [2025-01-08 22:47:14,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735cc23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:47:14, skipping insertion in model container [2025-01-08 22:47:14,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:47:14" (3/3) ... [2025-01-08 22:47:14,625 INFO L128 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2025-01-08 22:47:14,634 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:47:14,635 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interleave_bits.i that has 1 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:47:14,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:47:14,674 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;@af191b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:47:14,674 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:47:14,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 89 states have (on average 1.550561797752809) internal successors, (138), 90 states have internal predecessors, (138), 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-08 22:47:14,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-08 22:47:14,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:14,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:14,681 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:14,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:14,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1285029374, now seen corresponding path program 1 times [2025-01-08 22:47:14,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:14,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575879163] [2025-01-08 22:47:14,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:14,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:14,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-08 22:47:14,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-08 22:47:14,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:14,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:14,909 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-08 22:47:14,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:14,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575879163] [2025-01-08 22:47:14,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575879163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:14,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:14,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:47:14,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491329888] [2025-01-08 22:47:14,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:14,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:47:14,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:14,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:47:14,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:47:14,945 INFO L87 Difference]: Start difference. First operand has 91 states, 89 states have (on average 1.550561797752809) internal successors, (138), 90 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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-08 22:47:14,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:15,000 INFO L93 Difference]: Finished difference Result 199 states and 306 transitions. [2025-01-08 22:47:15,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:47:15,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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) Word has length 31 [2025-01-08 22:47:15,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:15,005 INFO L225 Difference]: With dead ends: 199 [2025-01-08 22:47:15,005 INFO L226 Difference]: Without dead ends: 106 [2025-01-08 22:47:15,007 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-08 22:47:15,009 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 27 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:15,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 254 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:47:15,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-08 22:47:15,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2025-01-08 22:47:15,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 93 states have internal predecessors, (142), 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-08 22:47:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 142 transitions. [2025-01-08 22:47:15,030 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 142 transitions. Word has length 31 [2025-01-08 22:47:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:15,030 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 142 transitions. [2025-01-08 22:47:15,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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-08 22:47:15,030 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 142 transitions. [2025-01-08 22:47:15,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-08 22:47:15,031 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:15,031 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:15,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:47:15,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:15,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:15,032 INFO L85 PathProgramCache]: Analyzing trace with hash 923415867, now seen corresponding path program 1 times [2025-01-08 22:47:15,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:15,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208915740] [2025-01-08 22:47:15,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:15,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:15,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-08 22:47:15,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-08 22:47:15,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:15,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:15,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:15,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:15,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208915740] [2025-01-08 22:47:15,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208915740] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:15,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252174528] [2025-01-08 22:47:15,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:15,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:15,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:15,161 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-08 22:47:15,165 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-08 22:47:15,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-08 22:47:15,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-08 22:47:15,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:15,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:15,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-08 22:47:15,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:15,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:15,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:15,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252174528] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:15,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:47:15,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-08 22:47:15,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30189171] [2025-01-08 22:47:15,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:15,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:47:15,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:15,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:47:15,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:47:15,289 INFO L87 Difference]: Start difference. First operand 94 states and 142 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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-08 22:47:15,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:15,372 INFO L93 Difference]: Finished difference Result 236 states and 364 transitions. [2025-01-08 22:47:15,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:47:15,373 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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 41 [2025-01-08 22:47:15,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:15,376 INFO L225 Difference]: With dead ends: 236 [2025-01-08 22:47:15,376 INFO L226 Difference]: Without dead ends: 151 [2025-01-08 22:47:15,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:47:15,377 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 157 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:15,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 628 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:15,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-08 22:47:15,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-01-08 22:47:15,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.52) internal successors, (228), 150 states have internal predecessors, (228), 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-08 22:47:15,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 228 transitions. [2025-01-08 22:47:15,389 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 228 transitions. Word has length 41 [2025-01-08 22:47:15,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:15,390 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 228 transitions. [2025-01-08 22:47:15,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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-08 22:47:15,390 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 228 transitions. [2025-01-08 22:47:15,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-08 22:47:15,392 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:15,393 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-01-08 22:47:15,400 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-08 22:47:15,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:15,594 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:15,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:15,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1475458010, now seen corresponding path program 1 times [2025-01-08 22:47:15,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:15,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594488899] [2025-01-08 22:47:15,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:15,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:15,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-08 22:47:15,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-08 22:47:15,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:15,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:15,872 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:47:15,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:15,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594488899] [2025-01-08 22:47:15,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594488899] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:15,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036072472] [2025-01-08 22:47:15,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:15,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:15,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:15,875 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-08 22:47:15,877 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-08 22:47:15,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-08 22:47:15,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-08 22:47:15,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:15,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:15,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-08 22:47:15,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:15,999 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:47:16,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:47:16,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036072472] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:16,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:47:16,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-08 22:47:16,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150449236] [2025-01-08 22:47:16,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:16,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-08 22:47:16,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:16,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-08 22:47:16,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-08 22:47:16,083 INFO L87 Difference]: Start difference. First operand 151 states and 228 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 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-08 22:47:16,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:16,196 INFO L93 Difference]: Finished difference Result 256 states and 390 transitions. [2025-01-08 22:47:16,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:47:16,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 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 75 [2025-01-08 22:47:16,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:16,198 INFO L225 Difference]: With dead ends: 256 [2025-01-08 22:47:16,198 INFO L226 Difference]: Without dead ends: 151 [2025-01-08 22:47:16,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:47:16,199 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 290 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:16,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 599 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:16,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-08 22:47:16,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-01-08 22:47:16,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.4933333333333334) internal successors, (224), 150 states have internal predecessors, (224), 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-08 22:47:16,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 224 transitions. [2025-01-08 22:47:16,205 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 224 transitions. Word has length 75 [2025-01-08 22:47:16,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:16,205 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 224 transitions. [2025-01-08 22:47:16,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 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-08 22:47:16,205 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 224 transitions. [2025-01-08 22:47:16,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-08 22:47:16,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:16,207 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:16,213 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-08 22:47:16,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:16,408 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:16,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:16,408 INFO L85 PathProgramCache]: Analyzing trace with hash 228491398, now seen corresponding path program 2 times [2025-01-08 22:47:16,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:16,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967039731] [2025-01-08 22:47:16,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:47:16,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:16,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-01-08 22:47:16,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-01-08 22:47:16,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:47:16,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:16,602 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:16,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:16,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967039731] [2025-01-08 22:47:16,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967039731] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:16,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021644681] [2025-01-08 22:47:16,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:47:16,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:16,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:16,604 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-08 22:47:16,605 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-08 22:47:16,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-01-08 22:47:16,676 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-01-08 22:47:16,676 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:47:16,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:16,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-08 22:47:16,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:16,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:16,903 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:16,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021644681] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:16,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:47:16,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-08 22:47:16,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955058855] [2025-01-08 22:47:16,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:16,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-08 22:47:16,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:16,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-08 22:47:16,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-01-08 22:47:16,904 INFO L87 Difference]: Start difference. First operand 151 states and 224 transitions. Second operand has 13 states, 13 states have (on average 9.76923076923077) internal successors, (127), 13 states have internal predecessors, (127), 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-08 22:47:17,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:17,170 INFO L93 Difference]: Finished difference Result 346 states and 518 transitions. [2025-01-08 22:47:17,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-08 22:47:17,170 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.76923076923077) internal successors, (127), 13 states have internal predecessors, (127), 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 77 [2025-01-08 22:47:17,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:17,172 INFO L225 Difference]: With dead ends: 346 [2025-01-08 22:47:17,172 INFO L226 Difference]: Without dead ends: 283 [2025-01-08 22:47:17,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:47:17,173 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 699 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:17,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1386 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:47:17,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-01-08 22:47:17,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2025-01-08 22:47:17,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.475177304964539) internal successors, (416), 282 states have internal predecessors, (416), 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-08 22:47:17,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 416 transitions. [2025-01-08 22:47:17,186 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 416 transitions. Word has length 77 [2025-01-08 22:47:17,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:17,186 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 416 transitions. [2025-01-08 22:47:17,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.76923076923077) internal successors, (127), 13 states have internal predecessors, (127), 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-08 22:47:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 416 transitions. [2025-01-08 22:47:17,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-08 22:47:17,188 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:17,189 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:17,200 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-08 22:47:17,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:17,396 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:17,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:17,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1192376988, now seen corresponding path program 3 times [2025-01-08 22:47:17,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:17,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550475108] [2025-01-08 22:47:17,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:47:17,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:17,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 149 statements into 11 equivalence classes. [2025-01-08 22:47:17,442 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 43 of 149 statements. [2025-01-08 22:47:17,446 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-08 22:47:17,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-01-08 22:47:17,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:17,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550475108] [2025-01-08 22:47:17,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550475108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:17,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:17,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-08 22:47:17,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528526668] [2025-01-08 22:47:17,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:17,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 22:47:17,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:17,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 22:47:17,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:47:17,762 INFO L87 Difference]: Start difference. First operand 283 states and 416 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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-08 22:47:17,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:17,971 INFO L93 Difference]: Finished difference Result 883 states and 1346 transitions. [2025-01-08 22:47:17,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-08 22:47:17,972 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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 149 [2025-01-08 22:47:17,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:17,975 INFO L225 Difference]: With dead ends: 883 [2025-01-08 22:47:17,976 INFO L226 Difference]: Without dead ends: 611 [2025-01-08 22:47:17,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:47:17,979 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 108 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:17,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1136 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:47:17,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-01-08 22:47:18,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 604. [2025-01-08 22:47:18,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 603 states have (on average 1.4378109452736318) internal successors, (867), 603 states have internal predecessors, (867), 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-08 22:47:18,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 867 transitions. [2025-01-08 22:47:18,014 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 867 transitions. Word has length 149 [2025-01-08 22:47:18,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:18,014 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 867 transitions. [2025-01-08 22:47:18,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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-08 22:47:18,014 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 867 transitions. [2025-01-08 22:47:18,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-08 22:47:18,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:18,016 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:18,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:47:18,016 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:18,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:18,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1689323591, now seen corresponding path program 1 times [2025-01-08 22:47:18,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:18,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149986370] [2025-01-08 22:47:18,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:18,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:18,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-08 22:47:18,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-08 22:47:18,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:18,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:18,445 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:18,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:18,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149986370] [2025-01-08 22:47:18,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149986370] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:18,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117610251] [2025-01-08 22:47:18,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:18,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:18,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:18,450 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-08 22:47:18,453 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-08 22:47:18,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-08 22:47:18,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-08 22:47:18,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:18,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:18,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-08 22:47:18,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-01-08 22:47:18,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-01-08 22:47:18,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117610251] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:18,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:47:18,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13, 5] total 17 [2025-01-08 22:47:18,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283130546] [2025-01-08 22:47:18,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:18,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:47:18,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:18,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:47:18,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:47:18,649 INFO L87 Difference]: Start difference. First operand 604 states and 867 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-08 22:47:18,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:18,937 INFO L93 Difference]: Finished difference Result 669 states and 964 transitions. [2025-01-08 22:47:18,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:47:18,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 150 [2025-01-08 22:47:18,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:18,939 INFO L225 Difference]: With dead ends: 669 [2025-01-08 22:47:18,939 INFO L226 Difference]: Without dead ends: 660 [2025-01-08 22:47:18,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:47:18,940 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 32 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:18,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 361 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:47:18,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-01-08 22:47:18,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2025-01-08 22:47:18,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 659 states have (on average 1.4461305007587253) internal successors, (953), 659 states have internal predecessors, (953), 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-08 22:47:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 953 transitions. [2025-01-08 22:47:18,952 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 953 transitions. Word has length 150 [2025-01-08 22:47:18,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:18,952 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 953 transitions. [2025-01-08 22:47:18,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-08 22:47:18,953 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 953 transitions. [2025-01-08 22:47:18,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-08 22:47:18,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:18,954 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:18,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-08 22:47:19,154 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,SelfDestructingSolverStorable5 [2025-01-08 22:47:19,155 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:19,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:19,155 INFO L85 PathProgramCache]: Analyzing trace with hash -62228544, now seen corresponding path program 1 times [2025-01-08 22:47:19,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:19,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372130691] [2025-01-08 22:47:19,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:19,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:19,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-08 22:47:19,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-08 22:47:19,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:19,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:19,506 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:19,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:19,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372130691] [2025-01-08 22:47:19,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372130691] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:19,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382358825] [2025-01-08 22:47:19,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:19,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:19,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:19,510 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:19,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-08 22:47:19,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-08 22:47:19,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-08 22:47:19,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:19,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:19,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-08 22:47:19,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:19,640 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-01-08 22:47:19,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:19,689 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-01-08 22:47:19,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382358825] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:19,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:47:19,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13, 6] total 19 [2025-01-08 22:47:19,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621926463] [2025-01-08 22:47:19,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:19,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:47:19,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:19,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:47:19,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-01-08 22:47:19,691 INFO L87 Difference]: Start difference. First operand 660 states and 953 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-08 22:47:19,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:19,778 INFO L93 Difference]: Finished difference Result 701 states and 1011 transitions. [2025-01-08 22:47:19,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:47:19,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 150 [2025-01-08 22:47:19,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:19,781 INFO L225 Difference]: With dead ends: 701 [2025-01-08 22:47:19,781 INFO L226 Difference]: Without dead ends: 675 [2025-01-08 22:47:19,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-01-08 22:47:19,782 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:19,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 474 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:19,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2025-01-08 22:47:19,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 675. [2025-01-08 22:47:19,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 674 states have (on average 1.4391691394658754) internal successors, (970), 674 states have internal predecessors, (970), 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-08 22:47:19,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 970 transitions. [2025-01-08 22:47:19,794 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 970 transitions. Word has length 150 [2025-01-08 22:47:19,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:19,794 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 970 transitions. [2025-01-08 22:47:19,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-08 22:47:19,794 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 970 transitions. [2025-01-08 22:47:19,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-08 22:47:19,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:19,796 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:19,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-08 22:47:19,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:19,996 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:19,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:19,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1550195962, now seen corresponding path program 1 times [2025-01-08 22:47:19,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:19,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120451130] [2025-01-08 22:47:19,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:19,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:20,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-08 22:47:20,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-08 22:47:20,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:20,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:20,177 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2025-01-08 22:47:20,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:20,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120451130] [2025-01-08 22:47:20,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120451130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:20,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:20,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:47:20,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532969045] [2025-01-08 22:47:20,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:20,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:47:20,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:20,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:47:20,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:47:20,178 INFO L87 Difference]: Start difference. First operand 675 states and 970 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-08 22:47:20,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:20,200 INFO L93 Difference]: Finished difference Result 1532 states and 2225 transitions. [2025-01-08 22:47:20,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:47:20,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 150 [2025-01-08 22:47:20,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:20,202 INFO L225 Difference]: With dead ends: 1532 [2025-01-08 22:47:20,202 INFO L226 Difference]: Without dead ends: 883 [2025-01-08 22:47:20,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-08 22:47:20,203 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 7 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:20,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 381 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:47:20,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-01-08 22:47:20,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2025-01-08 22:47:20,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 1.4002267573696145) internal successors, (1235), 882 states have internal predecessors, (1235), 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-08 22:47:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1235 transitions. [2025-01-08 22:47:20,218 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1235 transitions. Word has length 150 [2025-01-08 22:47:20,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:20,218 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1235 transitions. [2025-01-08 22:47:20,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-08 22:47:20,218 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1235 transitions. [2025-01-08 22:47:20,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-08 22:47:20,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:20,220 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:20,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:47:20,220 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:20,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:20,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1756521535, now seen corresponding path program 1 times [2025-01-08 22:47:20,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:20,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312495224] [2025-01-08 22:47:20,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:20,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:20,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-08 22:47:20,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-08 22:47:20,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:20,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:20,403 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 91 proven. 9 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2025-01-08 22:47:20,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:20,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312495224] [2025-01-08 22:47:20,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312495224] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:20,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321100360] [2025-01-08 22:47:20,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:20,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:20,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:20,405 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:20,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-08 22:47:20,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-08 22:47:20,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-08 22:47:20,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:20,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:20,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-08 22:47:20,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:20,718 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 46 proven. 102 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-01-08 22:47:20,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:20,931 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 139 proven. 9 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-01-08 22:47:20,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321100360] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:20,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:47:20,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 6] total 11 [2025-01-08 22:47:20,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855973633] [2025-01-08 22:47:20,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:20,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 22:47:20,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:20,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 22:47:20,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:47:20,933 INFO L87 Difference]: Start difference. First operand 883 states and 1235 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 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-08 22:47:21,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:21,044 INFO L93 Difference]: Finished difference Result 2078 states and 2877 transitions. [2025-01-08 22:47:21,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-08 22:47:21,044 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 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 150 [2025-01-08 22:47:21,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:21,048 INFO L225 Difference]: With dead ends: 2078 [2025-01-08 22:47:21,048 INFO L226 Difference]: Without dead ends: 1294 [2025-01-08 22:47:21,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:47:21,049 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 82 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:21,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 799 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:21,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2025-01-08 22:47:21,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1294. [2025-01-08 22:47:21,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1293 states have (on average 1.3418406805877803) internal successors, (1735), 1293 states have internal predecessors, (1735), 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-08 22:47:21,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1735 transitions. [2025-01-08 22:47:21,070 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1735 transitions. Word has length 150 [2025-01-08 22:47:21,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:21,070 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 1735 transitions. [2025-01-08 22:47:21,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 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-08 22:47:21,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1735 transitions. [2025-01-08 22:47:21,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-08 22:47:21,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:21,073 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:21,079 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-01-08 22:47:21,275 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,SelfDestructingSolverStorable8 [2025-01-08 22:47:21,275 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:21,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:21,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1834012885, now seen corresponding path program 1 times [2025-01-08 22:47:21,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:21,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371051219] [2025-01-08 22:47:21,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:21,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:21,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-08 22:47:21,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-08 22:47:21,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:21,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:21,570 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:21,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:21,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371051219] [2025-01-08 22:47:21,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371051219] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:21,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963158272] [2025-01-08 22:47:21,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:21,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:21,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:21,578 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-01-08 22:47:21,579 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-01-08 22:47:21,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-08 22:47:21,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-08 22:47:21,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:21,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:21,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-08 22:47:21,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:21,698 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-01-08 22:47:21,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:21,745 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-01-08 22:47:21,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963158272] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:21,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:47:21,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13, 6] total 19 [2025-01-08 22:47:21,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717929570] [2025-01-08 22:47:21,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:21,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:47:21,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:21,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:47:21,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-01-08 22:47:21,746 INFO L87 Difference]: Start difference. First operand 1294 states and 1735 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-08 22:47:21,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:21,802 INFO L93 Difference]: Finished difference Result 1446 states and 1961 transitions. [2025-01-08 22:47:21,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:47:21,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 151 [2025-01-08 22:47:21,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:21,806 INFO L225 Difference]: With dead ends: 1446 [2025-01-08 22:47:21,806 INFO L226 Difference]: Without dead ends: 1302 [2025-01-08 22:47:21,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-01-08 22:47:21,807 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:21,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 475 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:47:21,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2025-01-08 22:47:21,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1302. [2025-01-08 22:47:21,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1301 states have (on average 1.3412759415833975) internal successors, (1745), 1301 states have internal predecessors, (1745), 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-08 22:47:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1745 transitions. [2025-01-08 22:47:21,827 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1745 transitions. Word has length 151 [2025-01-08 22:47:21,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:21,827 INFO L471 AbstractCegarLoop]: Abstraction has 1302 states and 1745 transitions. [2025-01-08 22:47:21,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-08 22:47:21,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1745 transitions. [2025-01-08 22:47:21,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-08 22:47:21,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:21,829 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:21,835 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-01-08 22:47:22,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:22,033 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:22,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:22,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1731789058, now seen corresponding path program 1 times [2025-01-08 22:47:22,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:22,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635838974] [2025-01-08 22:47:22,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:22,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:22,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-08 22:47:22,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-08 22:47:22,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:22,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:22,286 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:22,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:22,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635838974] [2025-01-08 22:47:22,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635838974] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:22,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109317313] [2025-01-08 22:47:22,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:22,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:22,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:22,288 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:22,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-08 22:47:22,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-08 22:47:22,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-08 22:47:22,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:22,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:22,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-08 22:47:22,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:22,415 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-01-08 22:47:22,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-01-08 22:47:22,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109317313] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:22,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:47:22,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13, 6] total 19 [2025-01-08 22:47:22,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644042261] [2025-01-08 22:47:22,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:22,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:47:22,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:22,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:47:22,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-01-08 22:47:22,469 INFO L87 Difference]: Start difference. First operand 1302 states and 1745 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-08 22:47:22,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:22,533 INFO L93 Difference]: Finished difference Result 1323 states and 1772 transitions. [2025-01-08 22:47:22,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:47:22,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 151 [2025-01-08 22:47:22,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:22,537 INFO L225 Difference]: With dead ends: 1323 [2025-01-08 22:47:22,537 INFO L226 Difference]: Without dead ends: 1296 [2025-01-08 22:47:22,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-01-08 22:47:22,537 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:22,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:22,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2025-01-08 22:47:22,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1296. [2025-01-08 22:47:22,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 1295 states have (on average 1.3397683397683398) internal successors, (1735), 1295 states have internal predecessors, (1735), 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-08 22:47:22,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1735 transitions. [2025-01-08 22:47:22,557 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1735 transitions. Word has length 151 [2025-01-08 22:47:22,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:22,557 INFO L471 AbstractCegarLoop]: Abstraction has 1296 states and 1735 transitions. [2025-01-08 22:47:22,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-08 22:47:22,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1735 transitions. [2025-01-08 22:47:22,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-08 22:47:22,559 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:22,559 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:22,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-08 22:47:22,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:22,760 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:22,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:22,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1656348823, now seen corresponding path program 1 times [2025-01-08 22:47:22,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:22,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970272275] [2025-01-08 22:47:22,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:22,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:22,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-08 22:47:22,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-08 22:47:22,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:22,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:22,887 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 99 proven. 9 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-01-08 22:47:22,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:22,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970272275] [2025-01-08 22:47:22,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970272275] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:22,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731928131] [2025-01-08 22:47:22,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:22,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:22,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:22,893 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:22,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-08 22:47:22,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-08 22:47:22,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-08 22:47:22,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:22,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:22,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-08 22:47:22,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:23,177 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 81 proven. 99 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-01-08 22:47:23,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:23,376 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 171 proven. 9 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-01-08 22:47:23,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731928131] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:23,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:47:23,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 6] total 11 [2025-01-08 22:47:23,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437573545] [2025-01-08 22:47:23,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:23,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 22:47:23,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:23,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 22:47:23,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:47:23,378 INFO L87 Difference]: Start difference. First operand 1296 states and 1735 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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-08 22:47:23,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:23,471 INFO L93 Difference]: Finished difference Result 2955 states and 3917 transitions. [2025-01-08 22:47:23,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-08 22:47:23,471 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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 151 [2025-01-08 22:47:23,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:23,476 INFO L225 Difference]: With dead ends: 2955 [2025-01-08 22:47:23,476 INFO L226 Difference]: Without dead ends: 1745 [2025-01-08 22:47:23,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:47:23,477 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 107 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:23,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 755 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:23,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2025-01-08 22:47:23,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1745. [2025-01-08 22:47:23,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1745 states, 1744 states have (on average 1.2987385321100917) internal successors, (2265), 1744 states have internal predecessors, (2265), 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-08 22:47:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2265 transitions. [2025-01-08 22:47:23,505 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2265 transitions. Word has length 151 [2025-01-08 22:47:23,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:23,505 INFO L471 AbstractCegarLoop]: Abstraction has 1745 states and 2265 transitions. [2025-01-08 22:47:23,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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-08 22:47:23,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2265 transitions. [2025-01-08 22:47:23,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-08 22:47:23,507 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:23,508 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 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] [2025-01-08 22:47:23,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-08 22:47:23,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:23,712 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:23,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:23,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1257459686, now seen corresponding path program 2 times [2025-01-08 22:47:23,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:23,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321432242] [2025-01-08 22:47:23,713 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:47:23,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:23,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 151 statements into 2 equivalence classes. [2025-01-08 22:47:23,734 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 151 of 151 statements. [2025-01-08 22:47:23,734 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:47:23,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 0 proven. 533 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:24,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:24,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321432242] [2025-01-08 22:47:24,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321432242] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:24,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365832504] [2025-01-08 22:47:24,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:47:24,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:24,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:24,018 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:24,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-08 22:47:24,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 151 statements into 2 equivalence classes. [2025-01-08 22:47:24,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 151 of 151 statements. [2025-01-08 22:47:24,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:47:24,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:24,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-08 22:47:24,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:24,479 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 44 proven. 65 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-01-08 22:47:24,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 8 proven. 101 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-01-08 22:47:24,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365832504] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:24,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:47:24,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 15] total 37 [2025-01-08 22:47:24,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249493946] [2025-01-08 22:47:24,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:24,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-08 22:47:24,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:24,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-08 22:47:24,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1192, Unknown=0, NotChecked=0, Total=1332 [2025-01-08 22:47:24,929 INFO L87 Difference]: Start difference. First operand 1745 states and 2265 transitions. Second operand has 37 states, 37 states have (on average 6.54054054054054) internal successors, (242), 37 states have internal predecessors, (242), 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-08 22:47:32,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:32,887 INFO L93 Difference]: Finished difference Result 5762 states and 7809 transitions. [2025-01-08 22:47:32,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 342 states. [2025-01-08 22:47:32,888 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 6.54054054054054) internal successors, (242), 37 states have internal predecessors, (242), 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 151 [2025-01-08 22:47:32,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:32,899 INFO L225 Difference]: With dead ends: 5762 [2025-01-08 22:47:32,899 INFO L226 Difference]: Without dead ends: 4622 [2025-01-08 22:47:32,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 277 SyntacticMatches, 1 SemanticMatches, 356 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55054 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=7332, Invalid=120474, Unknown=0, NotChecked=0, Total=127806 [2025-01-08 22:47:32,916 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 3557 mSDsluCounter, 5323 mSDsCounter, 0 mSdLazyCounter, 4639 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3557 SdHoareTripleChecker+Valid, 5581 SdHoareTripleChecker+Invalid, 4900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 4639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:32,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3557 Valid, 5581 Invalid, 4900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 4639 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 22:47:32,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2025-01-08 22:47:32,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2246. [2025-01-08 22:47:32,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2246 states, 2245 states have (on average 1.311358574610245) internal successors, (2944), 2245 states have internal predecessors, (2944), 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-08 22:47:32,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 2944 transitions. [2025-01-08 22:47:32,984 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 2944 transitions. Word has length 151 [2025-01-08 22:47:32,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:32,984 INFO L471 AbstractCegarLoop]: Abstraction has 2246 states and 2944 transitions. [2025-01-08 22:47:32,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 6.54054054054054) internal successors, (242), 37 states have internal predecessors, (242), 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-08 22:47:32,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 2944 transitions. [2025-01-08 22:47:32,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-08 22:47:32,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:32,988 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:32,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-08 22:47:33,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-08 22:47:33,192 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:33,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:33,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1045486752, now seen corresponding path program 1 times [2025-01-08 22:47:33,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:33,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92022800] [2025-01-08 22:47:33,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:33,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:33,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-08 22:47:33,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-08 22:47:33,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:33,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:33,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:33,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92022800] [2025-01-08 22:47:33,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92022800] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:33,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185436065] [2025-01-08 22:47:33,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:33,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:33,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:33,436 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:33,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-08 22:47:33,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-08 22:47:33,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-08 22:47:33,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:33,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:33,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-08 22:47:33,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:33,560 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-08 22:47:33,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:33,606 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2025-01-08 22:47:33,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185436065] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:33,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:47:33,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14, 6] total 20 [2025-01-08 22:47:33,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313741991] [2025-01-08 22:47:33,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:33,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:47:33,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:33,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:47:33,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-01-08 22:47:33,607 INFO L87 Difference]: Start difference. First operand 2246 states and 2944 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-08 22:47:33,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:33,711 INFO L93 Difference]: Finished difference Result 2324 states and 3053 transitions. [2025-01-08 22:47:33,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:47:33,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 164 [2025-01-08 22:47:33,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:33,716 INFO L225 Difference]: With dead ends: 2324 [2025-01-08 22:47:33,716 INFO L226 Difference]: Without dead ends: 2261 [2025-01-08 22:47:33,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-01-08 22:47:33,717 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:33,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 474 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:33,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2025-01-08 22:47:33,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2261. [2025-01-08 22:47:33,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 2260 states have (on average 1.3101769911504424) internal successors, (2961), 2260 states have internal predecessors, (2961), 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-08 22:47:33,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 2961 transitions. [2025-01-08 22:47:33,745 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 2961 transitions. Word has length 164 [2025-01-08 22:47:33,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:33,745 INFO L471 AbstractCegarLoop]: Abstraction has 2261 states and 2961 transitions. [2025-01-08 22:47:33,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-08 22:47:33,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 2961 transitions. [2025-01-08 22:47:33,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-08 22:47:33,748 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:33,748 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:33,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-08 22:47:33,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-08 22:47:33,949 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:33,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:33,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1494912858, now seen corresponding path program 1 times [2025-01-08 22:47:33,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:33,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322872356] [2025-01-08 22:47:33,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:33,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:33,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-08 22:47:33,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-08 22:47:33,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:33,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:34,189 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:34,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:34,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322872356] [2025-01-08 22:47:34,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322872356] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:34,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867634389] [2025-01-08 22:47:34,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:34,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:34,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:34,191 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:34,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-08 22:47:34,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-08 22:47:34,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-08 22:47:34,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:34,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:34,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:47:34,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2025-01-08 22:47:34,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:34,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867634389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:34,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:47:34,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2025-01-08 22:47:34,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514145597] [2025-01-08 22:47:34,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:34,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:47:34,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:34,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:47:34,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:47:34,305 INFO L87 Difference]: Start difference. First operand 2261 states and 2961 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-08 22:47:34,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:34,916 INFO L93 Difference]: Finished difference Result 2428 states and 3200 transitions. [2025-01-08 22:47:34,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:47:34,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 164 [2025-01-08 22:47:34,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:34,921 INFO L225 Difference]: With dead ends: 2428 [2025-01-08 22:47:34,921 INFO L226 Difference]: Without dead ends: 2257 [2025-01-08 22:47:34,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:47:34,921 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:34,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 480 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:47:34,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2025-01-08 22:47:34,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2257. [2025-01-08 22:47:34,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2256 states have (on average 1.30895390070922) internal successors, (2953), 2256 states have internal predecessors, (2953), 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-08 22:47:34,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 2953 transitions. [2025-01-08 22:47:34,949 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 2953 transitions. Word has length 164 [2025-01-08 22:47:34,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:34,949 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 2953 transitions. [2025-01-08 22:47:34,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-08 22:47:34,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 2953 transitions. [2025-01-08 22:47:34,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-08 22:47:34,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:34,952 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 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-01-08 22:47:34,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-08 22:47:35,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:35,153 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:35,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:35,153 INFO L85 PathProgramCache]: Analyzing trace with hash -320339281, now seen corresponding path program 2 times [2025-01-08 22:47:35,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:35,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148789839] [2025-01-08 22:47:35,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:47:35,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:35,161 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 164 statements into 2 equivalence classes. [2025-01-08 22:47:35,175 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-01-08 22:47:35,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:47:35,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:35,396 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:35,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:35,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148789839] [2025-01-08 22:47:35,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148789839] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:35,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537953905] [2025-01-08 22:47:35,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:47:35,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:35,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:35,400 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:35,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-08 22:47:35,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 164 statements into 2 equivalence classes. [2025-01-08 22:47:35,478 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-01-08 22:47:35,478 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:47:35,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:35,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-08 22:47:35,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-01-08 22:47:35,537 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:35,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537953905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:35,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:47:35,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2025-01-08 22:47:35,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317793228] [2025-01-08 22:47:35,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:35,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:47:35,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:35,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:47:35,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:47:35,539 INFO L87 Difference]: Start difference. First operand 2257 states and 2953 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-08 22:47:35,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:35,595 INFO L93 Difference]: Finished difference Result 4006 states and 5387 transitions. [2025-01-08 22:47:35,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:47:35,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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) Word has length 164 [2025-01-08 22:47:35,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:35,617 INFO L225 Difference]: With dead ends: 4006 [2025-01-08 22:47:35,617 INFO L226 Difference]: Without dead ends: 2619 [2025-01-08 22:47:35,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-01-08 22:47:35,618 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 45 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:35,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 417 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:47:35,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2619 states. [2025-01-08 22:47:35,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2619 to 2297. [2025-01-08 22:47:35,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2297 states, 2296 states have (on average 1.3209930313588851) internal successors, (3033), 2296 states have internal predecessors, (3033), 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-08 22:47:35,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2297 states to 2297 states and 3033 transitions. [2025-01-08 22:47:35,660 INFO L78 Accepts]: Start accepts. Automaton has 2297 states and 3033 transitions. Word has length 164 [2025-01-08 22:47:35,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:35,660 INFO L471 AbstractCegarLoop]: Abstraction has 2297 states and 3033 transitions. [2025-01-08 22:47:35,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-08 22:47:35,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2297 states and 3033 transitions. [2025-01-08 22:47:35,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-08 22:47:35,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:35,664 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:35,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-08 22:47:35,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:35,868 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:35,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:35,868 INFO L85 PathProgramCache]: Analyzing trace with hash 483246677, now seen corresponding path program 1 times [2025-01-08 22:47:35,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:35,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247744376] [2025-01-08 22:47:35,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:35,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:35,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-08 22:47:35,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-08 22:47:35,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:35,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:36,119 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:36,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:36,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247744376] [2025-01-08 22:47:36,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247744376] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:36,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640218455] [2025-01-08 22:47:36,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:36,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:36,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:36,121 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:36,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-08 22:47:36,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-08 22:47:36,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-08 22:47:36,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:36,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:36,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:47:36,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:36,239 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2025-01-08 22:47:36,240 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:36,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640218455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:36,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:47:36,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2025-01-08 22:47:36,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088623249] [2025-01-08 22:47:36,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:36,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:47:36,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:36,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:47:36,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:47:36,242 INFO L87 Difference]: Start difference. First operand 2297 states and 3033 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-08 22:47:36,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:36,349 INFO L93 Difference]: Finished difference Result 2355 states and 3111 transitions. [2025-01-08 22:47:36,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:47:36,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 165 [2025-01-08 22:47:36,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:36,353 INFO L225 Difference]: With dead ends: 2355 [2025-01-08 22:47:36,354 INFO L226 Difference]: Without dead ends: 2291 [2025-01-08 22:47:36,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:47:36,355 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:36,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:36,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2025-01-08 22:47:36,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2291. [2025-01-08 22:47:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2291 states, 2290 states have (on average 1.3200873362445416) internal successors, (3023), 2290 states have internal predecessors, (3023), 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-08 22:47:36,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3023 transitions. [2025-01-08 22:47:36,403 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3023 transitions. Word has length 165 [2025-01-08 22:47:36,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:36,404 INFO L471 AbstractCegarLoop]: Abstraction has 2291 states and 3023 transitions. [2025-01-08 22:47:36,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-08 22:47:36,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3023 transitions. [2025-01-08 22:47:36,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-08 22:47:36,411 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:36,411 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:36,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-08 22:47:36,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-08 22:47:36,612 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:36,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:36,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2025980555, now seen corresponding path program 1 times [2025-01-08 22:47:36,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:36,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646934620] [2025-01-08 22:47:36,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:36,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:36,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-08 22:47:36,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-08 22:47:36,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:36,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:36,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:36,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646934620] [2025-01-08 22:47:36,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646934620] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:36,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542010189] [2025-01-08 22:47:36,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:36,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:36,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:36,851 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:36,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-08 22:47:36,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-08 22:47:36,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-08 22:47:36,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:36,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:36,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-08 22:47:36,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:36,970 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-08 22:47:36,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:37,020 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2025-01-08 22:47:37,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542010189] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:37,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:47:37,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14, 6] total 20 [2025-01-08 22:47:37,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500325482] [2025-01-08 22:47:37,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:37,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:47:37,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:37,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:47:37,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-01-08 22:47:37,021 INFO L87 Difference]: Start difference. First operand 2291 states and 3023 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-08 22:47:37,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:37,112 INFO L93 Difference]: Finished difference Result 2512 states and 3340 transitions. [2025-01-08 22:47:37,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:47:37,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 165 [2025-01-08 22:47:37,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:37,117 INFO L225 Difference]: With dead ends: 2512 [2025-01-08 22:47:37,117 INFO L226 Difference]: Without dead ends: 2307 [2025-01-08 22:47:37,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-01-08 22:47:37,118 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:37,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 475 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:37,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-01-08 22:47:37,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-01-08 22:47:37,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.3196010407632264) internal successors, (3043), 2306 states have internal predecessors, (3043), 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-08 22:47:37,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3043 transitions. [2025-01-08 22:47:37,166 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3043 transitions. Word has length 165 [2025-01-08 22:47:37,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:37,166 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3043 transitions. [2025-01-08 22:47:37,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-08 22:47:37,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3043 transitions. [2025-01-08 22:47:37,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-08 22:47:37,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:37,169 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 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-01-08 22:47:37,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-08 22:47:37,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-08 22:47:37,374 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:37,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:37,375 INFO L85 PathProgramCache]: Analyzing trace with hash -614213078, now seen corresponding path program 1 times [2025-01-08 22:47:37,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:37,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770133818] [2025-01-08 22:47:37,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:37,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:37,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-08 22:47:37,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-08 22:47:37,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:37,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:37,616 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:37,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:37,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770133818] [2025-01-08 22:47:37,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770133818] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:37,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603744127] [2025-01-08 22:47:37,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:37,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:37,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:37,618 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:37,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-08 22:47:37,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-08 22:47:37,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-08 22:47:37,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:37,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:37,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-08 22:47:37,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:37,917 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:37,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:38,259 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:38,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603744127] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:38,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:47:38,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2025-01-08 22:47:38,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024869254] [2025-01-08 22:47:38,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:38,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-08 22:47:38,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:38,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-08 22:47:38,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2025-01-08 22:47:38,260 INFO L87 Difference]: Start difference. First operand 2307 states and 3043 transitions. Second operand has 27 states, 27 states have (on average 11.222222222222221) internal successors, (303), 27 states have internal predecessors, (303), 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-08 22:47:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:38,980 INFO L93 Difference]: Finished difference Result 3642 states and 4866 transitions. [2025-01-08 22:47:38,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-08 22:47:38,981 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 11.222222222222221) internal successors, (303), 27 states have internal predecessors, (303), 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 165 [2025-01-08 22:47:38,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:38,989 INFO L225 Difference]: With dead ends: 3642 [2025-01-08 22:47:38,989 INFO L226 Difference]: Without dead ends: 3357 [2025-01-08 22:47:38,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=241, Invalid=629, Unknown=0, NotChecked=0, Total=870 [2025-01-08 22:47:38,991 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 987 mSDsluCounter, 4642 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 5022 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:38,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 5022 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:47:38,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3357 states. [2025-01-08 22:47:39,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3357 to 3287. [2025-01-08 22:47:39,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3287 states, 3286 states have (on average 1.3125380401704199) internal successors, (4313), 3286 states have internal predecessors, (4313), 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-08 22:47:39,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3287 states to 3287 states and 4313 transitions. [2025-01-08 22:47:39,047 INFO L78 Accepts]: Start accepts. Automaton has 3287 states and 4313 transitions. Word has length 165 [2025-01-08 22:47:39,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:39,047 INFO L471 AbstractCegarLoop]: Abstraction has 3287 states and 4313 transitions. [2025-01-08 22:47:39,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 11.222222222222221) internal successors, (303), 27 states have internal predecessors, (303), 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-08 22:47:39,048 INFO L276 IsEmpty]: Start isEmpty. Operand 3287 states and 4313 transitions. [2025-01-08 22:47:39,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-01-08 22:47:39,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:39,051 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 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-01-08 22:47:39,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-01-08 22:47:39,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:39,256 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:39,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:39,257 INFO L85 PathProgramCache]: Analyzing trace with hash 43431015, now seen corresponding path program 2 times [2025-01-08 22:47:39,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:39,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127464463] [2025-01-08 22:47:39,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:47:39,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:39,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 225 statements into 2 equivalence classes. [2025-01-08 22:47:39,336 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 225 of 225 statements. [2025-01-08 22:47:39,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:47:39,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:39,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1427 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 1336 trivial. 0 not checked. [2025-01-08 22:47:39,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:39,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127464463] [2025-01-08 22:47:39,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127464463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:39,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:39,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:47:39,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481401114] [2025-01-08 22:47:39,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:39,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:47:39,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:39,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:47:39,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:47:39,582 INFO L87 Difference]: Start difference. First operand 3287 states and 4313 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-08 22:47:39,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:39,668 INFO L93 Difference]: Finished difference Result 4447 states and 5760 transitions. [2025-01-08 22:47:39,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:47:39,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2025-01-08 22:47:39,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:39,682 INFO L225 Difference]: With dead ends: 4447 [2025-01-08 22:47:39,683 INFO L226 Difference]: Without dead ends: 4058 [2025-01-08 22:47:39,689 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-08 22:47:39,689 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 48 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:39,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 471 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:39,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4058 states. [2025-01-08 22:47:39,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4058 to 4037. [2025-01-08 22:47:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4037 states, 4036 states have (on average 1.2926164519326064) internal successors, (5217), 4036 states have internal predecessors, (5217), 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-08 22:47:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4037 states to 4037 states and 5217 transitions. [2025-01-08 22:47:39,738 INFO L78 Accepts]: Start accepts. Automaton has 4037 states and 5217 transitions. Word has length 225 [2025-01-08 22:47:39,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:39,738 INFO L471 AbstractCegarLoop]: Abstraction has 4037 states and 5217 transitions. [2025-01-08 22:47:39,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-08 22:47:39,738 INFO L276 IsEmpty]: Start isEmpty. Operand 4037 states and 5217 transitions. [2025-01-08 22:47:39,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-01-08 22:47:39,741 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:39,741 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 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] [2025-01-08 22:47:39,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-08 22:47:39,742 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:39,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:39,742 INFO L85 PathProgramCache]: Analyzing trace with hash 946758477, now seen corresponding path program 1 times [2025-01-08 22:47:39,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:39,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386269437] [2025-01-08 22:47:39,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:39,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:39,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-08 22:47:39,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-08 22:47:39,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:39,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1427 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2025-01-08 22:47:40,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:40,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386269437] [2025-01-08 22:47:40,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386269437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:40,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:40,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-08 22:47:40,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778938211] [2025-01-08 22:47:40,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:40,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:47:40,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:40,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:47:40,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:47:40,132 INFO L87 Difference]: Start difference. First operand 4037 states and 5217 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 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-08 22:47:40,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:40,225 INFO L93 Difference]: Finished difference Result 7594 states and 9864 transitions. [2025-01-08 22:47:40,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:47:40,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2025-01-08 22:47:40,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:40,231 INFO L225 Difference]: With dead ends: 7594 [2025-01-08 22:47:40,231 INFO L226 Difference]: Without dead ends: 4384 [2025-01-08 22:47:40,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:47:40,234 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 50 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:40,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 685 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:40,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4384 states. [2025-01-08 22:47:40,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4384 to 4132. [2025-01-08 22:47:40,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4132 states, 4131 states have (on average 1.271604938271605) internal successors, (5253), 4131 states have internal predecessors, (5253), 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-08 22:47:40,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4132 states to 4132 states and 5253 transitions. [2025-01-08 22:47:40,275 INFO L78 Accepts]: Start accepts. Automaton has 4132 states and 5253 transitions. Word has length 225 [2025-01-08 22:47:40,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:40,275 INFO L471 AbstractCegarLoop]: Abstraction has 4132 states and 5253 transitions. [2025-01-08 22:47:40,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 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-08 22:47:40,275 INFO L276 IsEmpty]: Start isEmpty. Operand 4132 states and 5253 transitions. [2025-01-08 22:47:40,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-01-08 22:47:40,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:40,279 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:40,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-08 22:47:40,279 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:40,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:40,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1442470486, now seen corresponding path program 1 times [2025-01-08 22:47:40,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:40,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456275484] [2025-01-08 22:47:40,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:40,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:40,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-08 22:47:40,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-08 22:47:40,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:40,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-01-08 22:47:40,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:40,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456275484] [2025-01-08 22:47:40,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456275484] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:40,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:40,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:47:40,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513868019] [2025-01-08 22:47:40,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:40,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:47:40,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:40,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:47:40,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:47:40,496 INFO L87 Difference]: Start difference. First operand 4132 states and 5253 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-08 22:47:40,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:40,599 INFO L93 Difference]: Finished difference Result 4247 states and 5413 transitions. [2025-01-08 22:47:40,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:47:40,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 226 [2025-01-08 22:47:40,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:40,605 INFO L225 Difference]: With dead ends: 4247 [2025-01-08 22:47:40,605 INFO L226 Difference]: Without dead ends: 4141 [2025-01-08 22:47:40,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-08 22:47:40,607 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:40,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:40,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2025-01-08 22:47:40,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 4141. [2025-01-08 22:47:40,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4141 states, 4140 states have (on average 1.2705314009661837) internal successors, (5260), 4140 states have internal predecessors, (5260), 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-08 22:47:40,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4141 states to 4141 states and 5260 transitions. [2025-01-08 22:47:40,645 INFO L78 Accepts]: Start accepts. Automaton has 4141 states and 5260 transitions. Word has length 226 [2025-01-08 22:47:40,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:40,645 INFO L471 AbstractCegarLoop]: Abstraction has 4141 states and 5260 transitions. [2025-01-08 22:47:40,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-08 22:47:40,645 INFO L276 IsEmpty]: Start isEmpty. Operand 4141 states and 5260 transitions. [2025-01-08 22:47:40,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-01-08 22:47:40,649 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:40,649 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:40,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-08 22:47:40,649 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:40,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:40,650 INFO L85 PathProgramCache]: Analyzing trace with hash 2010166851, now seen corresponding path program 1 times [2025-01-08 22:47:40,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:40,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756184535] [2025-01-08 22:47:40,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:40,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:40,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-08 22:47:40,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-08 22:47:40,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:40,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:40,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-01-08 22:47:40,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:40,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756184535] [2025-01-08 22:47:40,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756184535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:40,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:40,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:47:40,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597866148] [2025-01-08 22:47:40,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:40,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:47:40,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:40,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:47:40,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:47:40,778 INFO L87 Difference]: Start difference. First operand 4141 states and 5260 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-08 22:47:40,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:40,858 INFO L93 Difference]: Finished difference Result 4351 states and 5546 transitions. [2025-01-08 22:47:40,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:47:40,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 226 [2025-01-08 22:47:40,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:40,864 INFO L225 Difference]: With dead ends: 4351 [2025-01-08 22:47:40,864 INFO L226 Difference]: Without dead ends: 4137 [2025-01-08 22:47:40,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-08 22:47:40,865 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:40,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 361 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:40,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4137 states. [2025-01-08 22:47:40,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4137 to 4137. [2025-01-08 22:47:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4137 states, 4136 states have (on average 1.269825918762089) internal successors, (5252), 4136 states have internal predecessors, (5252), 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-08 22:47:40,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 5252 transitions. [2025-01-08 22:47:40,918 INFO L78 Accepts]: Start accepts. Automaton has 4137 states and 5252 transitions. Word has length 226 [2025-01-08 22:47:40,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:40,918 INFO L471 AbstractCegarLoop]: Abstraction has 4137 states and 5252 transitions. [2025-01-08 22:47:40,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-08 22:47:40,918 INFO L276 IsEmpty]: Start isEmpty. Operand 4137 states and 5252 transitions. [2025-01-08 22:47:40,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-01-08 22:47:40,922 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:40,922 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 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-01-08 22:47:40,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-08 22:47:40,922 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:40,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:40,923 INFO L85 PathProgramCache]: Analyzing trace with hash 765174827, now seen corresponding path program 2 times [2025-01-08 22:47:40,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:40,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984537] [2025-01-08 22:47:40,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:47:40,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:40,930 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 226 statements into 2 equivalence classes. [2025-01-08 22:47:40,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 226 of 226 statements. [2025-01-08 22:47:40,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:47:40,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:41,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1382 trivial. 0 not checked. [2025-01-08 22:47:41,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:41,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984537] [2025-01-08 22:47:41,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984537] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:41,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:41,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:47:41,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528009368] [2025-01-08 22:47:41,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:41,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:47:41,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:41,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:47:41,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:47:41,122 INFO L87 Difference]: Start difference. First operand 4137 states and 5252 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-08 22:47:45,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-08 22:47:45,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:45,210 INFO L93 Difference]: Finished difference Result 4424 states and 5653 transitions. [2025-01-08 22:47:45,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:47:45,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 226 [2025-01-08 22:47:45,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:45,216 INFO L225 Difference]: With dead ends: 4424 [2025-01-08 22:47:45,216 INFO L226 Difference]: Without dead ends: 4146 [2025-01-08 22:47:45,218 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-08 22:47:45,218 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 16 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:45,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 394 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-08 22:47:45,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4146 states. [2025-01-08 22:47:45,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4146 to 4143. [2025-01-08 22:47:45,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4143 states, 4142 states have (on average 1.2689521970062771) internal successors, (5256), 4142 states have internal predecessors, (5256), 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-08 22:47:45,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 5256 transitions. [2025-01-08 22:47:45,288 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 5256 transitions. Word has length 226 [2025-01-08 22:47:45,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:45,289 INFO L471 AbstractCegarLoop]: Abstraction has 4143 states and 5256 transitions. [2025-01-08 22:47:45,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-08 22:47:45,289 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 5256 transitions. [2025-01-08 22:47:45,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-01-08 22:47:45,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:45,294 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:45,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-08 22:47:45,294 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:45,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:45,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1819856939, now seen corresponding path program 1 times [2025-01-08 22:47:45,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:45,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672349770] [2025-01-08 22:47:45,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:45,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:45,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-08 22:47:45,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-08 22:47:45,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:45,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-01-08 22:47:45,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:45,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672349770] [2025-01-08 22:47:45,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672349770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:45,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:45,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:47:45,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871369338] [2025-01-08 22:47:45,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:45,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:47:45,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:45,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:47:45,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:47:45,574 INFO L87 Difference]: Start difference. First operand 4143 states and 5256 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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-08 22:47:46,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:46,130 INFO L93 Difference]: Finished difference Result 4413 states and 5630 transitions. [2025-01-08 22:47:46,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:47:46,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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) Word has length 227 [2025-01-08 22:47:46,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:46,135 INFO L225 Difference]: With dead ends: 4413 [2025-01-08 22:47:46,136 INFO L226 Difference]: Without dead ends: 4155 [2025-01-08 22:47:46,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-08 22:47:46,137 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:46,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 480 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:47:46,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4155 states. [2025-01-08 22:47:46,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4155 to 4155. [2025-01-08 22:47:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4155 states, 4154 states have (on average 1.268175252768416) internal successors, (5268), 4154 states have internal predecessors, (5268), 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-08 22:47:46,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4155 states to 4155 states and 5268 transitions. [2025-01-08 22:47:46,178 INFO L78 Accepts]: Start accepts. Automaton has 4155 states and 5268 transitions. Word has length 227 [2025-01-08 22:47:46,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:46,178 INFO L471 AbstractCegarLoop]: Abstraction has 4155 states and 5268 transitions. [2025-01-08 22:47:46,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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-08 22:47:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 4155 states and 5268 transitions. [2025-01-08 22:47:46,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-01-08 22:47:46,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:46,183 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 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] [2025-01-08 22:47:46,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-08 22:47:46,183 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:46,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:46,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1341013276, now seen corresponding path program 1 times [2025-01-08 22:47:46,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:46,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129386930] [2025-01-08 22:47:46,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:46,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:46,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-08 22:47:46,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-08 22:47:46,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:46,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:46,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1427 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2025-01-08 22:47:46,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:46,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129386930] [2025-01-08 22:47:46,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129386930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:46,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:46,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:47:46,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310123353] [2025-01-08 22:47:46,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:46,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:47:46,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:46,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:47:46,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:47:46,304 INFO L87 Difference]: Start difference. First operand 4155 states and 5268 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-08 22:47:46,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:46,397 INFO L93 Difference]: Finished difference Result 4199 states and 5316 transitions. [2025-01-08 22:47:46,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:47:46,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 227 [2025-01-08 22:47:46,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:46,401 INFO L225 Difference]: With dead ends: 4199 [2025-01-08 22:47:46,401 INFO L226 Difference]: Without dead ends: 4159 [2025-01-08 22:47:46,402 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-08 22:47:46,402 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 4 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:46,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 328 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:46,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4159 states. [2025-01-08 22:47:46,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4159 to 4158. [2025-01-08 22:47:46,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4158 states, 4157 states have (on average 1.2679817175847967) internal successors, (5271), 4157 states have internal predecessors, (5271), 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-08 22:47:46,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4158 states to 4158 states and 5271 transitions. [2025-01-08 22:47:46,442 INFO L78 Accepts]: Start accepts. Automaton has 4158 states and 5271 transitions. Word has length 227 [2025-01-08 22:47:46,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:46,443 INFO L471 AbstractCegarLoop]: Abstraction has 4158 states and 5271 transitions. [2025-01-08 22:47:46,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-08 22:47:46,443 INFO L276 IsEmpty]: Start isEmpty. Operand 4158 states and 5271 transitions. [2025-01-08 22:47:46,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-01-08 22:47:46,446 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:46,447 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:46,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-08 22:47:46,448 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:46,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:46,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1526827139, now seen corresponding path program 1 times [2025-01-08 22:47:46,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:46,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590862793] [2025-01-08 22:47:46,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:46,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:46,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-08 22:47:46,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-08 22:47:46,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:46,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:46,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 76 proven. 15 refuted. 0 times theorem prover too weak. 1335 trivial. 0 not checked. [2025-01-08 22:47:46,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:46,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590862793] [2025-01-08 22:47:46,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590862793] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:46,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590597358] [2025-01-08 22:47:46,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:46,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:46,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:46,727 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:46,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-08 22:47:46,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-08 22:47:46,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-08 22:47:46,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:46,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:46,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-08 22:47:46,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:47,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2025-01-08 22:47:47,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:47,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-01-08 22:47:47,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590597358] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:47,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:47:47,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 9] total 11 [2025-01-08 22:47:47,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963183545] [2025-01-08 22:47:47,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:47,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:47:47,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:47,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:47:47,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:47:47,179 INFO L87 Difference]: Start difference. First operand 4158 states and 5271 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-08 22:47:47,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:47,218 INFO L93 Difference]: Finished difference Result 4279 states and 5437 transitions. [2025-01-08 22:47:47,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:47:47,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 228 [2025-01-08 22:47:47,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:47,221 INFO L225 Difference]: With dead ends: 4279 [2025-01-08 22:47:47,221 INFO L226 Difference]: Without dead ends: 4165 [2025-01-08 22:47:47,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 448 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:47:47,222 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:47,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 252 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:47:47,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4165 states. [2025-01-08 22:47:47,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4165 to 4165. [2025-01-08 22:47:47,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4165 states, 4164 states have (on average 1.2675312199807878) internal successors, (5278), 4164 states have internal predecessors, (5278), 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-08 22:47:47,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4165 states to 4165 states and 5278 transitions. [2025-01-08 22:47:47,266 INFO L78 Accepts]: Start accepts. Automaton has 4165 states and 5278 transitions. Word has length 228 [2025-01-08 22:47:47,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:47,266 INFO L471 AbstractCegarLoop]: Abstraction has 4165 states and 5278 transitions. [2025-01-08 22:47:47,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-08 22:47:47,267 INFO L276 IsEmpty]: Start isEmpty. Operand 4165 states and 5278 transitions. [2025-01-08 22:47:47,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-01-08 22:47:47,270 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:47,270 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 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] [2025-01-08 22:47:47,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-01-08 22:47:47,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:47,471 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:47,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:47,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1926874443, now seen corresponding path program 1 times [2025-01-08 22:47:47,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:47,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880177452] [2025-01-08 22:47:47,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:47,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:47,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-08 22:47:47,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-08 22:47:47,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:47,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1427 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2025-01-08 22:47:47,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:47,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880177452] [2025-01-08 22:47:47,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880177452] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:47,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:47,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:47:47,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235485764] [2025-01-08 22:47:47,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:47,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:47:47,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:47,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:47:47,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:47:47,715 INFO L87 Difference]: Start difference. First operand 4165 states and 5278 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-08 22:47:47,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:47,876 INFO L93 Difference]: Finished difference Result 4279 states and 5433 transitions. [2025-01-08 22:47:47,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:47:47,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 228 [2025-01-08 22:47:47,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:47,879 INFO L225 Difference]: With dead ends: 4279 [2025-01-08 22:47:47,879 INFO L226 Difference]: Without dead ends: 4181 [2025-01-08 22:47:47,880 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-08 22:47:47,880 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 2 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:47,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 363 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:47,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4181 states. [2025-01-08 22:47:47,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4181 to 4177. [2025-01-08 22:47:47,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4177 states, 4176 states have (on average 1.2667624521072798) internal successors, (5290), 4176 states have internal predecessors, (5290), 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-08 22:47:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4177 states to 4177 states and 5290 transitions. [2025-01-08 22:47:47,924 INFO L78 Accepts]: Start accepts. Automaton has 4177 states and 5290 transitions. Word has length 228 [2025-01-08 22:47:47,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:47,925 INFO L471 AbstractCegarLoop]: Abstraction has 4177 states and 5290 transitions. [2025-01-08 22:47:47,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-08 22:47:47,925 INFO L276 IsEmpty]: Start isEmpty. Operand 4177 states and 5290 transitions. [2025-01-08 22:47:47,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-01-08 22:47:47,929 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:47,929 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 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] [2025-01-08 22:47:47,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-08 22:47:47,929 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:47,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:47,930 INFO L85 PathProgramCache]: Analyzing trace with hash -2066192856, now seen corresponding path program 1 times [2025-01-08 22:47:47,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:47,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137481030] [2025-01-08 22:47:47,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:47,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:47,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-08 22:47:47,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-08 22:47:47,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:47,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:48,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2025-01-08 22:47:48,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:48,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137481030] [2025-01-08 22:47:48,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137481030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:48,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:48,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:47:48,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555681111] [2025-01-08 22:47:48,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:48,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:47:48,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:48,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:47:48,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:47:48,047 INFO L87 Difference]: Start difference. First operand 4177 states and 5290 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-08 22:47:49,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-08 22:47:49,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:49,195 INFO L93 Difference]: Finished difference Result 4299 states and 5436 transitions. [2025-01-08 22:47:49,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:47:49,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 228 [2025-01-08 22:47:49,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:49,198 INFO L225 Difference]: With dead ends: 4299 [2025-01-08 22:47:49,198 INFO L226 Difference]: Without dead ends: 4178 [2025-01-08 22:47:49,198 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-08 22:47:49,199 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 5 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:49,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 326 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-08 22:47:49,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4178 states. [2025-01-08 22:47:49,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4178 to 4178. [2025-01-08 22:47:49,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4178 states, 4177 states have (on average 1.2664591812305483) internal successors, (5290), 4177 states have internal predecessors, (5290), 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-08 22:47:49,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4178 states to 4178 states and 5290 transitions. [2025-01-08 22:47:49,234 INFO L78 Accepts]: Start accepts. Automaton has 4178 states and 5290 transitions. Word has length 228 [2025-01-08 22:47:49,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:49,234 INFO L471 AbstractCegarLoop]: Abstraction has 4178 states and 5290 transitions. [2025-01-08 22:47:49,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-08 22:47:49,234 INFO L276 IsEmpty]: Start isEmpty. Operand 4178 states and 5290 transitions. [2025-01-08 22:47:49,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-08 22:47:49,237 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:49,237 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:49,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-08 22:47:49,237 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:49,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:49,237 INFO L85 PathProgramCache]: Analyzing trace with hash 760078875, now seen corresponding path program 1 times [2025-01-08 22:47:49,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:49,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560817854] [2025-01-08 22:47:49,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:49,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:49,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-08 22:47:49,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-08 22:47:49,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:49,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 76 proven. 15 refuted. 0 times theorem prover too weak. 1335 trivial. 0 not checked. [2025-01-08 22:47:49,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:49,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560817854] [2025-01-08 22:47:49,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560817854] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:49,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718774856] [2025-01-08 22:47:49,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:49,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:49,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:49,581 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:49,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-08 22:47:49,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-08 22:47:49,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-08 22:47:49,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:49,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:49,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-08 22:47:49,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:49,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-01-08 22:47:49,714 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:49,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718774856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:49,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:47:49,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-01-08 22:47:49,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703958369] [2025-01-08 22:47:49,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:49,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:47:49,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:49,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:47:49,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-08 22:47:49,715 INFO L87 Difference]: Start difference. First operand 4178 states and 5290 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-08 22:47:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:49,797 INFO L93 Difference]: Finished difference Result 4255 states and 5394 transitions. [2025-01-08 22:47:49,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:47:49,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2025-01-08 22:47:49,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:49,800 INFO L225 Difference]: With dead ends: 4255 [2025-01-08 22:47:49,800 INFO L226 Difference]: Without dead ends: 4194 [2025-01-08 22:47:49,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-08 22:47:49,801 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:49,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 476 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:49,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4194 states. [2025-01-08 22:47:49,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4194 to 4190. [2025-01-08 22:47:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4190 states, 4189 states have (on average 1.2656958701360708) internal successors, (5302), 4189 states have internal predecessors, (5302), 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-08 22:47:49,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 5302 transitions. [2025-01-08 22:47:49,837 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 5302 transitions. Word has length 229 [2025-01-08 22:47:49,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:49,838 INFO L471 AbstractCegarLoop]: Abstraction has 4190 states and 5302 transitions. [2025-01-08 22:47:49,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-08 22:47:49,838 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 5302 transitions. [2025-01-08 22:47:49,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-08 22:47:49,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:49,841 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:47:49,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-01-08 22:47:50,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:50,042 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:50,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:50,042 INFO L85 PathProgramCache]: Analyzing trace with hash 269180402, now seen corresponding path program 1 times [2025-01-08 22:47:50,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:50,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656950955] [2025-01-08 22:47:50,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:50,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:50,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-08 22:47:50,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-08 22:47:50,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:50,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 31 proven. 15 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2025-01-08 22:47:50,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:47:50,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656950955] [2025-01-08 22:47:50,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656950955] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:47:50,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124621872] [2025-01-08 22:47:50,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:50,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:50,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:50,407 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:50,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-08 22:47:50,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-08 22:47:50,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-08 22:47:50,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:50,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:50,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-08 22:47:50,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:50,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2025-01-08 22:47:50,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 165 proven. 15 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2025-01-08 22:47:51,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124621872] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:51,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:47:51,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8] total 15 [2025-01-08 22:47:51,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228473367] [2025-01-08 22:47:51,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:51,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-08 22:47:51,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:47:51,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-08 22:47:51,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-01-08 22:47:51,128 INFO L87 Difference]: Start difference. First operand 4190 states and 5302 transitions. Second operand has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 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-08 22:47:51,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:51,308 INFO L93 Difference]: Finished difference Result 4462 states and 5659 transitions. [2025-01-08 22:47:51,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-08 22:47:51,309 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2025-01-08 22:47:51,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:51,311 INFO L225 Difference]: With dead ends: 4462 [2025-01-08 22:47:51,311 INFO L226 Difference]: Without dead ends: 4187 [2025-01-08 22:47:51,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 445 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-01-08 22:47:51,312 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 139 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:51,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 869 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:47:51,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4187 states. [2025-01-08 22:47:51,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4187 to 4187. [2025-01-08 22:47:51,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4187 states, 4186 states have (on average 1.2637362637362637) internal successors, (5290), 4186 states have internal predecessors, (5290), 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-08 22:47:51,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4187 states to 4187 states and 5290 transitions. [2025-01-08 22:47:51,348 INFO L78 Accepts]: Start accepts. Automaton has 4187 states and 5290 transitions. Word has length 229 [2025-01-08 22:47:51,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:51,348 INFO L471 AbstractCegarLoop]: Abstraction has 4187 states and 5290 transitions. [2025-01-08 22:47:51,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 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-08 22:47:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand 4187 states and 5290 transitions. [2025-01-08 22:47:51,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-08 22:47:51,351 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:51,351 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 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] [2025-01-08 22:47:51,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-01-08 22:47:51,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:51,552 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:51,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:51,552 INFO L85 PathProgramCache]: Analyzing trace with hash 379866759, now seen corresponding path program 1 times [2025-01-08 22:47:51,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:47:51,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378502304] [2025-01-08 22:47:51,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:51,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:47:51,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-08 22:47:51,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-08 22:47:51,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:51,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-08 22:47:51,616 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-08 22:47:51,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-08 22:47:51,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-08 22:47:51,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:51,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-08 22:47:51,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-08 22:47:51,726 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-08 22:47:51,726 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:47:51,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-08 22:47:51,729 INFO L422 BasicCegarLoop]: Path program histogram: [3, 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] [2025-01-08 22:47:51,785 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:47:51,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:47:51 BoogieIcfgContainer [2025-01-08 22:47:51,787 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:47:51,787 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:47:51,787 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:47:51,788 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:47:51,788 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:47:14" (3/4) ... [2025-01-08 22:47:51,789 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-08 22:47:51,790 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:47:51,790 INFO L158 Benchmark]: Toolchain (without parser) took 38985.17ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 110.8MB in the beginning and 798.7MB in the end (delta: -687.9MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2025-01-08 22:47:51,790 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:47:51,790 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.58ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 98.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:47:51,791 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.35ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 96.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:47:51,791 INFO L158 Benchmark]: Boogie Preprocessor took 47.21ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 95.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:47:51,791 INFO L158 Benchmark]: RCFGBuilder took 1523.64ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 68.8MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 22:47:51,791 INFO L158 Benchmark]: TraceAbstraction took 37166.37ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 67.8MB in the beginning and 799.0MB in the end (delta: -731.1MB). Peak memory consumption was 457.6MB. Max. memory is 16.1GB. [2025-01-08 22:47:51,791 INFO L158 Benchmark]: Witness Printer took 2.47ms. Allocated memory is still 847.2MB. Free memory was 799.0MB in the beginning and 798.7MB in the end (delta: 267.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:47:51,792 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.16ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.58ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 98.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.35ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 96.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.21ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 95.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1523.64ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 68.8MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 37166.37ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 67.8MB in the beginning and 799.0MB in the end (delta: -731.1MB). Peak memory consumption was 457.6MB. Max. memory is 16.1GB. * Witness Printer took 2.47ms. Allocated memory is still 847.2MB. Free memory was 799.0MB in the beginning and 798.7MB in the end (delta: 267.8kB). 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 - UnprovableResult [Line: 25]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 50, overapproximation of shiftLeft at line 50, overapproximation of shiftLeft at line 50, overapproximation of bitwiseOr at line 59, overapproximation of bitwiseAnd at line 50, overapproximation of bitwiseAnd at line 59. Possible FailurePath: [L42] unsigned short x = __VERIFIER_nondet_ushort(); [L43] unsigned short y = __VERIFIER_nondet_ushort(); [L44] unsigned int xx; [L45] unsigned int yy; [L46] unsigned int zz; [L47] unsigned int z = 0; [L48] unsigned int i = 0; VAL [i=0, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=0, z=0] [L50] EXPR 1U << i VAL [i=0, z=0] [L50] EXPR x & (1U << i) VAL [i=0, x=0, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=0, x=0, z=0] [L50] EXPR 1U << i VAL [i=0, x=0, z=0] [L50] EXPR y & (1U << i) VAL [i=0, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=0, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=0, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=1, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=1, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=1, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=1, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=1, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=1, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=1, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=1, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=1, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=2, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=2, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=2, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=2, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=2, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=2, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=2, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=2, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=2, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=3, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=3, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=3, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=3, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=3, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=3, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=3, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=3, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=3, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=4, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=4, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=4, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=4, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=4, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=4, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=4, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=4, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=4, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=5, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=5, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=5, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=5, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=5, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=5, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=5, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=5, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=5, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=6, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=6, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=6, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=6, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=6, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=6, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=6, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=6, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=6, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=7, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=7, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=7, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=7, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=7, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=7, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=7, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=7, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=7, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=8, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=8, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=8, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=8, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=8, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=8, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=8, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=8, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=8, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=9, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=9, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=9, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=9, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=9, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=9, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=9, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=9, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=9, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=10, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=10, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=10, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=10, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=10, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=10, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=10, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=10, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=10, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=11, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=11, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=11, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=11, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=11, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=11, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=11, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=11, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=11, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=12, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=12, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=12, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=12, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=12, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=12, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=12, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=12, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=12, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=13, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=13, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=13, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=13, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=13, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=13, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=13, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=13, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=13, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=14, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=14, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=14, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=14, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=14, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=14, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=14, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=14, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=14, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=15, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=15, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=15, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=15, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=15, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=15, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=15, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=15, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=15, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=16, x=0, y=2, z=-4294967295] [L49] COND FALSE !(i < sizeof(x) * 8) [L53] xx = x [L54] yy = y VAL [xx=0, yy=2, z=-4294967295] [L55] EXPR xx | (xx << 8u) VAL [yy=2, z=-4294967295] [L55] EXPR (xx | (xx << 8u)) & 16711935U VAL [yy=2, z=-4294967295] [L55] xx = (xx | (xx << 8u)) & 16711935U [L56] EXPR xx | (xx << 4u) VAL [yy=2, z=-4294967295] [L56] EXPR (xx | (xx << 4u)) & 252645135U VAL [yy=2, z=-4294967295] [L56] xx = (xx | (xx << 4u)) & 252645135U [L57] EXPR xx | (xx << 2u) VAL [yy=2, z=-4294967295] [L57] EXPR (xx | (xx << 2u)) & 858993459U VAL [yy=2, z=-4294967295] [L57] xx = (xx | (xx << 2u)) & 858993459U [L58] EXPR xx | (xx << 1u) VAL [yy=2, z=-4294967295] [L58] EXPR (xx | (xx << 1u)) & 1431655765U VAL [yy=2, z=-4294967295] [L58] xx = (xx | (xx << 1u)) & 1431655765U [L59] EXPR yy | (yy << 8u) VAL [xx=0, z=-4294967295] [L59] EXPR (yy | (yy << 8u)) & 16711935U VAL [xx=0, z=-4294967295] [L59] yy = (yy | (yy << 8u)) & 16711935U [L60] EXPR yy | (yy << 4u) VAL [xx=0, z=-4294967295] [L60] EXPR (yy | (yy << 4u)) & 252645135U VAL [xx=0, z=-4294967295] [L60] yy = (yy | (yy << 4u)) & 252645135U [L61] EXPR yy | (yy << 2u) VAL [xx=0, z=-4294967295] [L61] EXPR (yy | (yy << 2u)) & 858993459U VAL [xx=0, z=-4294967295] [L61] yy = (yy | (yy << 2u)) & 858993459U [L62] EXPR yy | (yy << 1u) VAL [xx=0, z=-4294967295] [L62] EXPR (yy | (yy << 1u)) & 1431655765U VAL [xx=0, z=-4294967295] [L62] yy = (yy | (yy << 1u)) & 1431655765U [L64] EXPR xx | (yy << 1U) VAL [z=-4294967295] [L64] zz = xx | (yy << 1U) [L66] CALL __VERIFIER_assert(z == zz) [L24] COND TRUE !(cond) [L25] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.1s, OverallIterations: 32, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 18.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 6368 SdHoareTripleChecker+Valid, 11.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6368 mSDsluCounter, 26139 SdHoareTripleChecker+Invalid, 10.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21530 mSDsCounter, 336 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7954 IncrementalHoareTripleChecker+Invalid, 8291 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 336 mSolverCounterUnsat, 4609 mSDtfsCounter, 7954 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5678 GetRequests, 5022 SyntacticMatches, 8 SemanticMatches, 648 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55354 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4190occurred in iteration=30, InterpolantAutomatonStates: 524, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 3072 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 8437 NumberOfCodeBlocks, 8331 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 10341 ConstructedInterpolants, 0 QuantifiedInterpolants, 26727 SizeOfPredicates, 33 NumberOfNonLiveVariables, 7491 ConjunctsInSsa, 247 ConjunctsInUnsatCore, 65 InterpolantComputations, 23 PerfectInterpolantSequences, 37601/46670 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-08 22:47:51,812 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/bitvector/interleave_bits.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:47:53,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:47:53,798 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-08 22:47:53,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:47:53,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:47:53,828 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:47:53,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:47:53,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:47:53,828 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:47:53,828 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:47:53,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:47:53,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:47:53,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:47:53,829 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:47:53,829 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:47:53,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:47:53,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:47:53,829 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:47:53,829 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:47:53,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:47:53,829 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:47:53,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:47:53,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:47:53,829 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-08 22:47:53,829 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-08 22:47:53,829 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-08 22:47:53,829 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:47:53,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:47:53,829 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:47:53,829 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:47:53,829 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:47:53,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:47:53,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:47:53,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:47:53,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:47:53,830 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:47:53,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:47:53,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:47:53,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:47:53,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:47:53,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:47:53,830 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:47:53,830 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:47:53,830 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:47:53,830 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-08 22:47:53,830 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-08 22:47:53,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:47:53,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:47:53,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:47:53,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:47:53,832 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 -> 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb [2025-01-08 22:47:54,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:47:54,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:47:54,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:47:54,072 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:47:54,072 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:47:54,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/interleave_bits.i [2025-01-08 22:47:55,202 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45758b381/fcf7b2f6737b495bb9773fc2dad99cde/FLAG82b813861 [2025-01-08 22:47:55,388 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:47:55,388 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2025-01-08 22:47:55,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45758b381/fcf7b2f6737b495bb9773fc2dad99cde/FLAG82b813861 [2025-01-08 22:47:55,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45758b381/fcf7b2f6737b495bb9773fc2dad99cde [2025-01-08 22:47:55,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:47:55,404 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:47:55,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:47:55,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:47:55,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:47:55,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:47:55" (1/1) ... [2025-01-08 22:47:55,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da4404c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:55, skipping insertion in model container [2025-01-08 22:47:55,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:47:55" (1/1) ... [2025-01-08 22:47:55,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:47:55,502 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/bitvector/interleave_bits.i[1175,1188] [2025-01-08 22:47:55,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:47:55,529 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:47:55,538 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/bitvector/interleave_bits.i[1175,1188] [2025-01-08 22:47:55,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:47:55,559 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:47:55,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:55 WrapperNode [2025-01-08 22:47:55,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:47:55,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:47:55,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:47:55,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:47:55,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:55" (1/1) ... [2025-01-08 22:47:55,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:55" (1/1) ... [2025-01-08 22:47:55,580 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2025-01-08 22:47:55,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:47:55,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:47:55,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:47:55,580 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:47:55,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:55" (1/1) ... [2025-01-08 22:47:55,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:55" (1/1) ... [2025-01-08 22:47:55,588 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:55" (1/1) ... [2025-01-08 22:47:55,600 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-08 22:47:55,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:55" (1/1) ... [2025-01-08 22:47:55,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:55" (1/1) ... [2025-01-08 22:47:55,603 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:55" (1/1) ... [2025-01-08 22:47:55,606 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:55" (1/1) ... [2025-01-08 22:47:55,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:55" (1/1) ... [2025-01-08 22:47:55,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:55" (1/1) ... [2025-01-08 22:47:55,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:55" (1/1) ... [2025-01-08 22:47:55,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:47:55,612 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:47:55,612 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:47:55,612 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:47:55,612 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:55" (1/1) ... [2025-01-08 22:47:55,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:47:55,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:55,635 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-08 22:47:55,640 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-08 22:47:55,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:47:55,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-08 22:47:55,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:47:55,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:47:55,688 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:47:55,690 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:47:55,770 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-08 22:47:55,773 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:47:55,778 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:47:55,778 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:47:55,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:47:55 BoogieIcfgContainer [2025-01-08 22:47:55,779 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:47:55,781 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:47:55,781 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:47:55,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:47:55,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:47:55" (1/3) ... [2025-01-08 22:47:55,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb754d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:47:55, skipping insertion in model container [2025-01-08 22:47:55,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:47:55" (2/3) ... [2025-01-08 22:47:55,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb754d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:47:55, skipping insertion in model container [2025-01-08 22:47:55,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:47:55" (3/3) ... [2025-01-08 22:47:55,787 INFO L128 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2025-01-08 22:47:55,797 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:47:55,798 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interleave_bits.i that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:47:55,834 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:47:55,844 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;@5c17361f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:47:55,844 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:47:55,847 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-08 22:47:55,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-08 22:47:55,850 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:55,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-08 22:47:55,850 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:55,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:55,854 INFO L85 PathProgramCache]: Analyzing trace with hash 28696775, now seen corresponding path program 1 times [2025-01-08 22:47:55,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:55,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2083243928] [2025-01-08 22:47:55,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:55,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:55,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:55,866 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-08 22:47:55,867 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-08 22:47:55,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-08 22:47:55,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-08 22:47:55,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:55,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:55,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:47:55,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:55,948 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-08 22:47:55,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:47:55,949 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:55,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083243928] [2025-01-08 22:47:55,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083243928] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:47:55,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:47:55,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:47:55,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357626963] [2025-01-08 22:47:55,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:47:55,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:47:55,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:55,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:47:55,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:47:55,964 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-08 22:47:55,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:55,984 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2025-01-08 22:47:55,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:47:55,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-08 22:47:55,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:55,990 INFO L225 Difference]: With dead ends: 18 [2025-01-08 22:47:55,990 INFO L226 Difference]: Without dead ends: 7 [2025-01-08 22:47:55,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:47:55,994 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:55,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:47:56,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2025-01-08 22:47:56,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-01-08 22:47:56,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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-08 22:47:56,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2025-01-08 22:47:56,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2025-01-08 22:47:56,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:56,016 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2025-01-08 22:47:56,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-08 22:47:56,016 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2025-01-08 22:47:56,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-08 22:47:56,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:56,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-08 22:47:56,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 22:47:56,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:56,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:56,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:56,222 INFO L85 PathProgramCache]: Analyzing trace with hash 889537511, now seen corresponding path program 1 times [2025-01-08 22:47:56,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:56,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1652949834] [2025-01-08 22:47:56,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:47:56,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:56,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:56,224 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-08 22:47:56,225 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-08 22:47:56,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-08 22:47:56,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-08 22:47:56,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:47:56,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:56,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:47:56,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:56,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:56,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:56,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:56,329 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:56,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652949834] [2025-01-08 22:47:56,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652949834] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:56,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:47:56,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-01-08 22:47:56,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085967588] [2025-01-08 22:47:56,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:56,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:47:56,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:56,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:47:56,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:47:56,333 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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-08 22:47:56,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:56,366 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2025-01-08 22:47:56,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:47:56,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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) Word has length 6 [2025-01-08 22:47:56,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:56,366 INFO L225 Difference]: With dead ends: 13 [2025-01-08 22:47:56,366 INFO L226 Difference]: Without dead ends: 10 [2025-01-08 22:47:56,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:47:56,367 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:56,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:47:56,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-01-08 22:47:56,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-01-08 22:47:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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-08 22:47:56,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2025-01-08 22:47:56,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2025-01-08 22:47:56,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:56,369 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2025-01-08 22:47:56,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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-08 22:47:56,370 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2025-01-08 22:47:56,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-08 22:47:56,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:56,370 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2025-01-08 22:47:56,376 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-08 22:47:56,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:56,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:56,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:56,575 INFO L85 PathProgramCache]: Analyzing trace with hash 201697479, now seen corresponding path program 2 times [2025-01-08 22:47:56,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:56,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1398510592] [2025-01-08 22:47:56,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:47:56,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:56,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:56,581 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-08 22:47:56,583 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-08 22:47:56,613 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-01-08 22:47:56,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-01-08 22:47:56,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:47:56,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:56,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-08 22:47:56,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:56,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:56,766 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:56,766 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:56,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398510592] [2025-01-08 22:47:56,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398510592] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:56,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:47:56,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-01-08 22:47:56,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118109319] [2025-01-08 22:47:56,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:56,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-08 22:47:56,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:56,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-08 22:47:56,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:47:56,768 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-08 22:47:56,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:56,869 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2025-01-08 22:47:56,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-08 22:47:56,870 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 9 [2025-01-08 22:47:56,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:56,870 INFO L225 Difference]: With dead ends: 19 [2025-01-08 22:47:56,870 INFO L226 Difference]: Without dead ends: 16 [2025-01-08 22:47:56,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-01-08 22:47:56,871 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:56,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:47:56,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-01-08 22:47:56,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-01-08 22:47:56,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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-08 22:47:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2025-01-08 22:47:56,874 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2025-01-08 22:47:56,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:56,874 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2025-01-08 22:47:56,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-08 22:47:56,874 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2025-01-08 22:47:56,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-08 22:47:56,875 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:56,875 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2025-01-08 22:47:56,881 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-08 22:47:57,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:57,075 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:57,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:57,076 INFO L85 PathProgramCache]: Analyzing trace with hash -763767609, now seen corresponding path program 3 times [2025-01-08 22:47:57,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:57,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [573351207] [2025-01-08 22:47:57,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:47:57,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:57,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:57,078 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-08 22:47:57,079 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-08 22:47:57,103 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 6 equivalence classes. [2025-01-08 22:47:57,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 15 of 15 statements. [2025-01-08 22:47:57,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-08 22:47:57,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:57,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-08 22:47:57,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:57,220 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:57,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:47:57,462 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:57,462 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:47:57,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573351207] [2025-01-08 22:47:57,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573351207] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:47:57,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:47:57,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2025-01-08 22:47:57,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24613532] [2025-01-08 22:47:57,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:47:57,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-08 22:47:57,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:47:57,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-08 22:47:57,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2025-01-08 22:47:57,463 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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-08 22:47:57,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:47:57,959 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2025-01-08 22:47:57,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-08 22:47:57,960 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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 15 [2025-01-08 22:47:57,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:47:57,960 INFO L225 Difference]: With dead ends: 31 [2025-01-08 22:47:57,960 INFO L226 Difference]: Without dead ends: 28 [2025-01-08 22:47:57,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=771, Unknown=0, NotChecked=0, Total=1122 [2025-01-08 22:47:57,961 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:47:57,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:47:57,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-08 22:47:57,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-08 22:47:57,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 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-08 22:47:57,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2025-01-08 22:47:57,966 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 15 [2025-01-08 22:47:57,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:47:57,966 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2025-01-08 22:47:57,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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-08 22:47:57,966 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2025-01-08 22:47:57,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-08 22:47:57,966 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:47:57,966 INFO L218 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1] [2025-01-08 22:47:57,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-08 22:47:58,166 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 [2025-01-08 22:47:58,167 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:47:58,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:47:58,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2078474041, now seen corresponding path program 4 times [2025-01-08 22:47:58,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:47:58,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2087432] [2025-01-08 22:47:58,167 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:47:58,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:47:58,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:47:58,170 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:47:58,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-08 22:47:58,193 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-01-08 22:47:58,235 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-01-08 22:47:58,235 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:47:58,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:47:58,239 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-01-08 22:47:58,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:47:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:47:59,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 120 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:18,016 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:48:18,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087432] [2025-01-08 22:48:18,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087432] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:48:18,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:48:18,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2025-01-08 22:48:18,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757404231] [2025-01-08 22:48:18,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:18,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-08 22:48:18,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:48:18,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-08 22:48:18,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=1004, Unknown=0, NotChecked=0, Total=1332 [2025-01-08 22:48:18,021 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 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-08 22:48:20,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:20,479 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2025-01-08 22:48:20,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-08 22:48:20,483 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 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-08 22:48:20,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:20,484 INFO L225 Difference]: With dead ends: 28 [2025-01-08 22:48:20,484 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 22:48:20,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=347, Invalid=1059, Unknown=0, NotChecked=0, Total=1406 [2025-01-08 22:48:20,485 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:20,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-08 22:48:20,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 22:48:20,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 22:48:20,486 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-01-08 22:48:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 22:48:20,486 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2025-01-08 22:48:20,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:20,486 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 22:48:20,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 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-08 22:48:20,486 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 22:48:20,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 22:48:20,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:48:20,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-08 22:48:20,688 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 [2025-01-08 22:48:20,695 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1] [2025-01-08 22:48:20,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 22:48:27,415 WARN L286 SmtUtils]: Spent 6.70s on a formula simplification. DAG size of input: 437 DAG size of output: 187 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-01-08 22:48:27,420 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:48:27,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:48:27 BoogieIcfgContainer [2025-01-08 22:48:27,461 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:48:27,462 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:48:27,462 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:48:27,462 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:48:27,463 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:47:55" (3/4) ... [2025-01-08 22:48:27,464 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 22:48:27,471 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-01-08 22:48:27,472 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 22:48:27,472 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 22:48:27,472 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 22:48:27,534 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 22:48:27,534 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 22:48:27,534 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:48:27,535 INFO L158 Benchmark]: Toolchain (without parser) took 32130.93ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 92.4MB in the beginning and 98.9MB in the end (delta: -6.5MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2025-01-08 22:48:27,535 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 62.3MB in the end (delta: 37.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:48:27,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.43ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 80.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:48:27,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.52ms. Allocated memory is still 117.4MB. Free memory was 80.5MB in the beginning and 79.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:48:27,537 INFO L158 Benchmark]: Boogie Preprocessor took 30.96ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 78.0MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:48:27,537 INFO L158 Benchmark]: RCFGBuilder took 167.78ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 67.9MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:48:27,537 INFO L158 Benchmark]: TraceAbstraction took 31680.56ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 67.2MB in the beginning and 107.3MB in the end (delta: -40.0MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. [2025-01-08 22:48:27,537 INFO L158 Benchmark]: Witness Printer took 72.23ms. Allocated memory is still 142.6MB. Free memory was 107.3MB in the beginning and 98.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:48:27,539 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.16ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 62.3MB in the end (delta: 37.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.43ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 80.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.52ms. Allocated memory is still 117.4MB. Free memory was 80.5MB in the beginning and 79.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.96ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 78.0MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 167.78ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 67.9MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 31680.56ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 67.2MB in the beginning and 107.3MB in the end (delta: -40.0MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. * Witness Printer took 72.23ms. Allocated memory is still 142.6MB. Free memory was 107.3MB in the beginning and 98.9MB in the end (delta: 8.4MB). 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: 25]: 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 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.9s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 97 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 436 IncrementalHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 25 mSDtfsCounter, 436 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 20.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=4, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 20.4s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 98 ConstructedInterpolants, 1 QuantifiedInterpolants, 9761 SizeOfPredicates, 2 NumberOfNonLiveVariables, 193 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 120/404 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 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((((((((((((i == 9) && (z == (((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))))) || ((z == ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) && (i == 7))) || ((((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) == z) && (i == 2))) || ((i == 1) && (z == (0 | (((y & 1) << 1) | ((x & 1) << 0)))))) || (!(i < 16) && (z == ((((y & 32768) << 16) | ((x & 32768) << 15)) | ((((y & 16384) << 15) | ((x & 16384) << 14)) | ((((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) | (((x & 4096) << 12) | ((y & 4096) << 13))) | (((y & 8192) << 14) | ((x & 8192) << 13)))))))) || ((i == 8) && (z == ((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4))))))))) || ((i == 10) && (z == ((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9)))))) || ((z == ((((y & 32768) << 16) | ((x & 32768) << 15)) | ((((y & 16384) << 15) | ((x & 16384) << 14)) | ((((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) | (((x & 4096) << 12) | ((y & 4096) << 13))) | (((y & 8192) << 14) | ((x & 8192) << 13)))))) && !(((i + 15) % 4294967296) < 16))) || ((i == 6) && (z == ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4))))))) || ((z == (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) && (i == 11))) || ((z == (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))) && (i == 5))) || ((z == ((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11))))) && (i == 12))) || ((z == ((((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) | (((x & 4096) << 12) | ((y & 4096) << 13))) | (((y & 8192) << 14) | ((x & 8192) << 13)))) && (i == 14))) || (((((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) | (((x & 4096) << 12) | ((y & 4096) << 13))) == z) && (i == 13))) || ((z == ((((y & 16384) << 15) | ((x & 16384) << 14)) | ((((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) | (((x & 4096) << 12) | ((y & 4096) << 13))) | (((y & 8192) << 14) | ((x & 8192) << 13))))) && (i == 15))) || ((i == 0) && (z == 0))) || ((z == ((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2))))) && (i == 4))) || ((i == 3) && (z == (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))))) RESULT: Ultimate proved your program to be correct! [2025-01-08 22:48:27,590 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