./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound50.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2616f51a0d79e0bd682803708141b0dc94462ecdbaee78ea9cc6b43878e4310d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:12:10,099 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:12:10,142 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:12:10,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:12:10,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:12:10,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:12:10,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:12:10,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:12:10,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:12:10,159 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:12:10,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:12:10,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:12:10,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:12:10,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:12:10,160 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:12:10,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:12:10,161 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:12:10,161 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:12:10,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:12:10,161 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:12:10,161 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:12:10,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:12:10,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:12:10,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:12:10,161 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:12:10,161 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:12:10,161 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:12:10,161 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:12:10,161 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:12:10,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:12:10,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:12:10,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:12:10,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:12:10,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:12:10,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:12:10,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:12:10,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:12:10,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:12:10,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:12:10,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:12:10,162 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:12:10,162 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:12:10,162 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:12:10,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:12:10,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:12:10,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:12:10,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:12:10,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:12:10,162 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 -> 2616f51a0d79e0bd682803708141b0dc94462ecdbaee78ea9cc6b43878e4310d [2025-01-09 03:12:10,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:12:10,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:12:10,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:12:10,379 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:12:10,379 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:12:10,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound50.c [2025-01-09 03:12:11,465 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1d89274d/b8e09f3c4f9c40ce914743ee4c90b342/FLAGb529e89fd [2025-01-09 03:12:11,731 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:12:11,732 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound50.c [2025-01-09 03:12:11,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1d89274d/b8e09f3c4f9c40ce914743ee4c90b342/FLAGb529e89fd [2025-01-09 03:12:12,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1d89274d/b8e09f3c4f9c40ce914743ee4c90b342 [2025-01-09 03:12:12,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:12:12,072 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:12:12,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:12:12,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:12:12,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:12:12,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:12:12" (1/1) ... [2025-01-09 03:12:12,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4922ca42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:12, skipping insertion in model container [2025-01-09 03:12:12,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:12:12" (1/1) ... [2025-01-09 03:12:12,111 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:12:12,215 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/nla-digbench-scaling/dijkstra-u_unwindbound50.c[525,538] [2025-01-09 03:12:12,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:12:12,249 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:12:12,258 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/nla-digbench-scaling/dijkstra-u_unwindbound50.c[525,538] [2025-01-09 03:12:12,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:12:12,288 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:12:12,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:12 WrapperNode [2025-01-09 03:12:12,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:12:12,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:12:12,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:12:12,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:12:12,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:12" (1/1) ... [2025-01-09 03:12:12,302 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:12" (1/1) ... [2025-01-09 03:12:12,315 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2025-01-09 03:12:12,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:12:12,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:12:12,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:12:12,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:12:12,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:12" (1/1) ... [2025-01-09 03:12:12,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:12" (1/1) ... [2025-01-09 03:12:12,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:12" (1/1) ... [2025-01-09 03:12:12,337 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 03:12:12,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:12" (1/1) ... [2025-01-09 03:12:12,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:12" (1/1) ... [2025-01-09 03:12:12,339 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:12" (1/1) ... [2025-01-09 03:12:12,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:12" (1/1) ... [2025-01-09 03:12:12,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:12" (1/1) ... [2025-01-09 03:12:12,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:12" (1/1) ... [2025-01-09 03:12:12,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:12" (1/1) ... [2025-01-09 03:12:12,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:12:12,350 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:12:12,350 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:12:12,350 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:12:12,350 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:12" (1/1) ... [2025-01-09 03:12:12,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:12:12,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:12:12,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:12:12,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:12:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:12:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:12:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:12:12,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:12:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 03:12:12,395 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 03:12:12,440 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:12:12,442 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:12:12,618 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-01-09 03:12:12,618 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:12:12,626 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:12:12,626 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 03:12:12,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:12:12 BoogieIcfgContainer [2025-01-09 03:12:12,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:12:12,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:12:12,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:12:12,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:12:12,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:12:12" (1/3) ... [2025-01-09 03:12:12,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31fca2a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:12:12, skipping insertion in model container [2025-01-09 03:12:12,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:12:12" (2/3) ... [2025-01-09 03:12:12,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31fca2a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:12:12, skipping insertion in model container [2025-01-09 03:12:12,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:12:12" (3/3) ... [2025-01-09 03:12:12,635 INFO L128 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound50.c [2025-01-09 03:12:12,647 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:12:12,648 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dijkstra-u_unwindbound50.c that has 2 procedures, 30 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 03:12:12,698 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:12:12,710 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;@60ba174c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:12:12,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:12:12,713 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 03:12:12,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 03:12:12,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:12:12,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:12:12,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:12:12,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:12:12,722 INFO L85 PathProgramCache]: Analyzing trace with hash -797370321, now seen corresponding path program 1 times [2025-01-09 03:12:12,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:12:12,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809708130] [2025-01-09 03:12:12,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:12:12,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:12:12,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 03:12:12,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 03:12:12,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:12:12,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:12:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:12:12,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:12:12,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809708130] [2025-01-09 03:12:12,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809708130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:12:12,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:12:12,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 03:12:12,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527071638] [2025-01-09 03:12:12,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:12:12,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:12:12,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:12:12,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:12:12,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 03:12:12,857 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:12:12,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:12:12,874 INFO L93 Difference]: Finished difference Result 57 states and 97 transitions. [2025-01-09 03:12:12,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:12:12,875 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-09 03:12:12,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:12:12,879 INFO L225 Difference]: With dead ends: 57 [2025-01-09 03:12:12,880 INFO L226 Difference]: Without dead ends: 26 [2025-01-09 03:12:12,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 03:12:12,887 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:12:12,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:12:12,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-09 03:12:12,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-01-09 03:12:12,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 03:12:12,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2025-01-09 03:12:12,915 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 10 [2025-01-09 03:12:12,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:12:12,915 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2025-01-09 03:12:12,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:12:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2025-01-09 03:12:12,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 03:12:12,916 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:12:12,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:12:12,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:12:12,917 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:12:12,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:12:12,918 INFO L85 PathProgramCache]: Analyzing trace with hash 813389700, now seen corresponding path program 1 times [2025-01-09 03:12:12,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:12:12,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368474337] [2025-01-09 03:12:12,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:12:12,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:12:12,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 03:12:12,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 03:12:12,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:12:12,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:12:13,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:12:13,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:12:13,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368474337] [2025-01-09 03:12:13,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368474337] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:12:13,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:12:13,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:12:13,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579343589] [2025-01-09 03:12:13,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:12:13,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:12:13,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:12:13,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:12:13,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:12:13,029 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:12:13,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:12:13,057 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2025-01-09 03:12:13,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:12:13,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-09 03:12:13,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:12:13,058 INFO L225 Difference]: With dead ends: 47 [2025-01-09 03:12:13,058 INFO L226 Difference]: Without dead ends: 28 [2025-01-09 03:12:13,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:12:13,058 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:12:13,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:12:13,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-09 03:12:13,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-09 03:12:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 03:12:13,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2025-01-09 03:12:13,064 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 12 [2025-01-09 03:12:13,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:12:13,064 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2025-01-09 03:12:13,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:12:13,064 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2025-01-09 03:12:13,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 03:12:13,065 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:12:13,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:12:13,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:12:13,065 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:12:13,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:12:13,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1620178184, now seen corresponding path program 1 times [2025-01-09 03:12:13,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:12:13,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052465258] [2025-01-09 03:12:13,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:12:13,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:12:13,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 03:12:13,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 03:12:13,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:12:13,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:12:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:12:13,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:12:13,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052465258] [2025-01-09 03:12:13,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052465258] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:12:13,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:12:13,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:12:13,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129858460] [2025-01-09 03:12:13,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:12:13,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:12:13,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:12:13,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:12:13,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:12:13,418 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:12:13,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:12:13,551 INFO L93 Difference]: Finished difference Result 64 states and 97 transitions. [2025-01-09 03:12:13,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:12:13,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-09 03:12:13,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:12:13,553 INFO L225 Difference]: With dead ends: 64 [2025-01-09 03:12:13,553 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 03:12:13,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:12:13,553 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 8 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:12:13,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 143 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:12:13,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 03:12:13,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2025-01-09 03:12:13,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 25 states have internal predecessors, (32), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 03:12:13,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2025-01-09 03:12:13,562 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 13 [2025-01-09 03:12:13,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:12:13,562 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2025-01-09 03:12:13,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:12:13,562 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2025-01-09 03:12:13,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 03:12:13,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:12:13,563 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:12:13,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:12:13,563 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:12:13,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:12:13,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1622382718, now seen corresponding path program 1 times [2025-01-09 03:12:13,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:12:13,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25856863] [2025-01-09 03:12:13,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:12:13,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:12:13,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 03:12:13,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 03:12:13,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:12:13,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:12:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:12:13,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:12:13,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25856863] [2025-01-09 03:12:13,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25856863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:12:13,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:12:13,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:12:13,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889478952] [2025-01-09 03:12:13,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:12:13,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:12:13,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:12:13,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:12:13,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:12:13,604 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:12:13,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:12:13,620 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2025-01-09 03:12:13,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:12:13,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-09 03:12:13,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:12:13,621 INFO L225 Difference]: With dead ends: 52 [2025-01-09 03:12:13,621 INFO L226 Difference]: Without dead ends: 43 [2025-01-09 03:12:13,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:12:13,622 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:12:13,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 102 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:12:13,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-09 03:12:13,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2025-01-09 03:12:13,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 03:12:13,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2025-01-09 03:12:13,629 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 13 [2025-01-09 03:12:13,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:12:13,629 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2025-01-09 03:12:13,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:12:13,629 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2025-01-09 03:12:13,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 03:12:13,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:12:13,630 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:12:13,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:12:13,630 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:12:13,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:12:13,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1585768815, now seen corresponding path program 1 times [2025-01-09 03:12:13,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:12:13,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102739613] [2025-01-09 03:12:13,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:12:13,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:12:13,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 03:12:13,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 03:12:13,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:12:13,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:12:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:12:13,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:12:13,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102739613] [2025-01-09 03:12:13,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102739613] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:12:13,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214194687] [2025-01-09 03:12:13,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:12:13,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:12:13,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:12:13,672 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:12:13,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:12:13,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 03:12:13,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 03:12:13,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:12:13,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:12:13,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 03:12:13,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:12:13,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:12:13,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:12:13,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:12:13,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214194687] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:12:13,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:12:13,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:12:13,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329458777] [2025-01-09 03:12:13,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:12:13,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:12:13,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:12:13,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:12:13,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:12:13,763 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:12:14,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 03:12:18,961 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-09 03:12:22,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 03:12:22,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:12:22,986 INFO L93 Difference]: Finished difference Result 98 states and 142 transitions. [2025-01-09 03:12:22,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:12:22,987 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-09 03:12:22,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:12:22,988 INFO L225 Difference]: With dead ends: 98 [2025-01-09 03:12:22,988 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 03:12:22,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:12:22,989 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 64 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 16 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:12:22,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 197 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 84 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2025-01-09 03:12:22,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 03:12:22,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2025-01-09 03:12:22,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 03:12:22,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2025-01-09 03:12:22,997 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 15 [2025-01-09 03:12:22,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:12:22,997 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2025-01-09 03:12:22,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:12:22,997 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2025-01-09 03:12:22,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 03:12:22,998 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:12:22,998 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:12:23,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 03:12:23,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:12:23,202 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:12:23,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:12:23,203 INFO L85 PathProgramCache]: Analyzing trace with hash -205873027, now seen corresponding path program 1 times [2025-01-09 03:12:23,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:12:23,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55345288] [2025-01-09 03:12:23,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:12:23,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:12:23,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 03:12:23,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 03:12:23,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:12:23,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:12:23,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:12:23,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:12:23,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55345288] [2025-01-09 03:12:23,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55345288] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:12:23,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476091697] [2025-01-09 03:12:23,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:12:23,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:12:23,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:12:23,472 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:12:23,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:12:23,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 03:12:23,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 03:12:23,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:12:23,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:12:23,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 03:12:23,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:12:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:12:23,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:12:23,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:12:23,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476091697] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:12:23,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:12:23,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-01-09 03:12:23,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025987761] [2025-01-09 03:12:23,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:12:23,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 03:12:23,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:12:23,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 03:12:23,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-01-09 03:12:23,758 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:12:24,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:12:24,499 INFO L93 Difference]: Finished difference Result 146 states and 230 transitions. [2025-01-09 03:12:24,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 03:12:24,499 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-09 03:12:24,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:12:24,501 INFO L225 Difference]: With dead ends: 146 [2025-01-09 03:12:24,501 INFO L226 Difference]: Without dead ends: 123 [2025-01-09 03:12:24,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2025-01-09 03:12:24,502 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 64 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:12:24,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 291 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 03:12:24,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-09 03:12:24,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 88. [2025-01-09 03:12:24,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 50 states have (on average 1.28) internal successors, (64), 54 states have internal predecessors, (64), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 03:12:24,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 125 transitions. [2025-01-09 03:12:24,524 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 125 transitions. Word has length 16 [2025-01-09 03:12:24,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:12:24,524 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 125 transitions. [2025-01-09 03:12:24,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:12:24,524 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 125 transitions. [2025-01-09 03:12:24,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 03:12:24,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:12:24,525 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:12:24,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:12:24,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:12:24,726 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:12:24,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:12:24,727 INFO L85 PathProgramCache]: Analyzing trace with hash -203668493, now seen corresponding path program 1 times [2025-01-09 03:12:24,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:12:24,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515887633] [2025-01-09 03:12:24,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:12:24,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:12:24,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 03:12:24,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 03:12:24,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:12:24,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:12:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:12:24,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:12:24,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515887633] [2025-01-09 03:12:24,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515887633] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:12:24,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568349518] [2025-01-09 03:12:24,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:12:24,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:12:24,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:12:24,788 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:12:24,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:12:24,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 03:12:24,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 03:12:24,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:12:24,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:12:24,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 03:12:24,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:12:24,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:12:24,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:12:24,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:12:24,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568349518] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:12:24,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:12:24,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-09 03:12:24,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229808025] [2025-01-09 03:12:24,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:12:24,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:12:24,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:12:24,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:12:24,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:12:24,880 INFO L87 Difference]: Start difference. First operand 88 states and 125 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:12:29,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:12:33,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:12:33,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:12:33,297 INFO L93 Difference]: Finished difference Result 170 states and 232 transitions. [2025-01-09 03:12:33,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 03:12:33,297 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-09 03:12:33,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:12:33,300 INFO L225 Difference]: With dead ends: 170 [2025-01-09 03:12:33,300 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 03:12:33,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:12:33,300 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 115 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 23 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:12:33,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 172 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 88 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-01-09 03:12:33,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 03:12:33,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 151. [2025-01-09 03:12:33,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 88 states have (on average 1.25) internal successors, (110), 95 states have internal predecessors, (110), 51 states have call successors, (51), 11 states have call predecessors, (51), 11 states have return successors, (47), 44 states have call predecessors, (47), 47 states have call successors, (47) [2025-01-09 03:12:33,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 208 transitions. [2025-01-09 03:12:33,333 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 208 transitions. Word has length 16 [2025-01-09 03:12:33,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:12:33,333 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 208 transitions. [2025-01-09 03:12:33,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:12:33,333 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 208 transitions. [2025-01-09 03:12:33,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 03:12:33,334 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:12:33,334 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:12:33,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 03:12:33,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:12:33,534 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:12:33,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:12:33,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1365342360, now seen corresponding path program 1 times [2025-01-09 03:12:33,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:12:33,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195361851] [2025-01-09 03:12:33,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:12:33,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:12:33,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 03:12:33,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 03:12:33,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:12:33,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:12:33,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1501329205] [2025-01-09 03:12:33,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:12:33,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:12:33,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:12:33,555 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:12:33,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:12:33,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 03:12:33,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 03:12:33,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:12:33,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:12:33,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 03:12:33,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:12:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:12:33,631 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:12:33,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:12:33,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195361851] [2025-01-09 03:12:33,631 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:12:33,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501329205] [2025-01-09 03:12:33,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501329205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:12:33,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:12:33,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:12:33,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458727803] [2025-01-09 03:12:33,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:12:33,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:12:33,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:12:33,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:12:33,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:12:33,633 INFO L87 Difference]: Start difference. First operand 151 states and 208 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 03:12:37,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:12:37,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:12:37,699 INFO L93 Difference]: Finished difference Result 209 states and 289 transitions. [2025-01-09 03:12:37,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:12:37,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-01-09 03:12:37,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:12:37,701 INFO L225 Difference]: With dead ends: 209 [2025-01-09 03:12:37,701 INFO L226 Difference]: Without dead ends: 201 [2025-01-09 03:12:37,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:12:37,702 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:12:37,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 120 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 03:12:37,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-01-09 03:12:37,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-01-09 03:12:37,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 112 states have (on average 1.2142857142857142) internal successors, (136), 119 states have internal predecessors, (136), 72 states have call successors, (72), 17 states have call predecessors, (72), 16 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 03:12:37,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 273 transitions. [2025-01-09 03:12:37,721 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 273 transitions. Word has length 23 [2025-01-09 03:12:37,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:12:37,721 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 273 transitions. [2025-01-09 03:12:37,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 03:12:37,721 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 273 transitions. [2025-01-09 03:12:37,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 03:12:37,722 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:12:37,722 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:12:37,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:12:37,922 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,SelfDestructingSolverStorable7 [2025-01-09 03:12:37,923 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:12:37,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:12:37,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1490689287, now seen corresponding path program 1 times [2025-01-09 03:12:37,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:12:37,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198318171] [2025-01-09 03:12:37,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:12:37,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:12:37,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 03:12:37,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 03:12:37,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:12:37,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:12:37,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1400561399] [2025-01-09 03:12:37,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:12:37,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:12:37,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:12:37,949 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:12:37,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:12:37,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 03:12:37,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 03:12:37,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:12:37,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:12:37,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 03:12:37,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:12:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:12:38,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:12:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:12:40,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:12:40,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198318171] [2025-01-09 03:12:40,315 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:12:40,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400561399] [2025-01-09 03:12:40,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400561399] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:12:40,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:12:40,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2025-01-09 03:12:40,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208112992] [2025-01-09 03:12:40,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:12:40,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:12:40,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:12:40,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:12:40,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:12:40,317 INFO L87 Difference]: Start difference. First operand 201 states and 273 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 03:12:49,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:12:51,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:12:55,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:12:57,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:13:01,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:13:06,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.92s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:13:11,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:13:15,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:13:19,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:13:23,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:13:27,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:13:31,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:13:36,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:13:38,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:13:38,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:13:38,519 INFO L93 Difference]: Finished difference Result 287 states and 388 transitions. [2025-01-09 03:13:38,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:13:38,519 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-01-09 03:13:38,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:13:38,522 INFO L225 Difference]: With dead ends: 287 [2025-01-09 03:13:38,522 INFO L226 Difference]: Without dead ends: 251 [2025-01-09 03:13:38,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:13:38,524 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 33 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 64 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:13:38,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 331 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 193 Invalid, 11 Unknown, 0 Unchecked, 53.1s Time] [2025-01-09 03:13:38,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-01-09 03:13:38,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 243. [2025-01-09 03:13:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 138 states have (on average 1.181159420289855) internal successors, (163), 144 states have internal predecessors, (163), 82 states have call successors, (82), 23 states have call predecessors, (82), 22 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 03:13:38,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 321 transitions. [2025-01-09 03:13:38,568 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 321 transitions. Word has length 24 [2025-01-09 03:13:38,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:13:38,568 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 321 transitions. [2025-01-09 03:13:38,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 03:13:38,568 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 321 transitions. [2025-01-09 03:13:38,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 03:13:38,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:13:38,569 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:13:38,582 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-09 03:13:38,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:13:38,769 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:13:38,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:13:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash -386521148, now seen corresponding path program 2 times [2025-01-09 03:13:38,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:13:38,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838812899] [2025-01-09 03:13:38,770 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:13:38,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:13:38,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-09 03:13:38,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 24 statements. [2025-01-09 03:13:38,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:13:38,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:13:38,814 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 03:13:38,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:13:38,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838812899] [2025-01-09 03:13:38,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838812899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:13:38,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:13:38,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:13:38,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021644681] [2025-01-09 03:13:38,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:13:38,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:13:38,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:13:38,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:13:38,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:13:38,816 INFO L87 Difference]: Start difference. First operand 243 states and 321 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:13:38,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:13:38,906 INFO L93 Difference]: Finished difference Result 290 states and 382 transitions. [2025-01-09 03:13:38,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:13:38,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-01-09 03:13:38,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:13:38,910 INFO L225 Difference]: With dead ends: 290 [2025-01-09 03:13:38,911 INFO L226 Difference]: Without dead ends: 250 [2025-01-09 03:13:38,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:13:38,912 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 9 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:13:38,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 137 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:13:38,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-01-09 03:13:38,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 245. [2025-01-09 03:13:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 139 states have (on average 1.1654676258992807) internal successors, (162), 145 states have internal predecessors, (162), 82 states have call successors, (82), 24 states have call predecessors, (82), 23 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 03:13:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 320 transitions. [2025-01-09 03:13:38,945 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 320 transitions. Word has length 24 [2025-01-09 03:13:38,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:13:38,945 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 320 transitions. [2025-01-09 03:13:38,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:13:38,945 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 320 transitions. [2025-01-09 03:13:38,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 03:13:38,949 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:13:38,949 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:13:38,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:13:38,949 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:13:38,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:13:38,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1507446820, now seen corresponding path program 1 times [2025-01-09 03:13:38,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:13:38,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10118429] [2025-01-09 03:13:38,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:13:38,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:13:38,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 03:13:38,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 03:13:38,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:13:38,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:13:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:13:39,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:13:39,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10118429] [2025-01-09 03:13:39,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10118429] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:13:39,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692885776] [2025-01-09 03:13:39,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:13:39,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:13:39,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:13:39,076 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:13:39,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:13:39,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 03:13:39,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 03:13:39,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:13:39,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:13:39,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 03:13:39,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:13:39,149 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 03:13:39,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:13:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:13:39,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692885776] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:13:39,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:13:39,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2025-01-09 03:13:39,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446180846] [2025-01-09 03:13:39,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:13:39,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 03:13:39,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:13:39,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 03:13:39,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2025-01-09 03:13:39,259 INFO L87 Difference]: Start difference. First operand 245 states and 320 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 03:13:41,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:13:46,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:13:50,186 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-09 03:13:54,362 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-09 03:13:59,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []