./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/egcd-ll_unwindbound5.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 77987d39218daa3d8ca19fe9337f6493b276d704fa95c2d6fb7800ec30efdcea --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:33:09,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:33:09,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:33:09,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:33:09,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:33:09,137 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:33:09,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:33:09,139 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:33:09,139 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:33:09,139 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:33:09,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:33:09,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:33:09,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:33:09,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:33:09,141 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:33:09,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:33:09,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:33:09,141 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:33:09,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:33:09,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:33:09,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:33:09,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:33:09,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:33:09,142 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:33:09,142 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:33:09,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:33:09,142 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:33:09,142 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:33:09,142 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:33:09,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:33:09,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:33:09,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:33:09,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:33:09,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:33:09,143 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:33:09,143 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:33:09,143 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:33:09,143 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:33:09,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:33:09,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:33:09,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:33:09,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:33:09,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:33:09,144 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 -> 77987d39218daa3d8ca19fe9337f6493b276d704fa95c2d6fb7800ec30efdcea [2025-02-07 20:33:09,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:33:09,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:33:09,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:33:09,322 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:33:09,322 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:33:09,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound5.c [2025-02-07 20:33:10,413 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4f2450f8/37732199ea004b83ba8ac1caaa4e2759/FLAG9fdcfa16c [2025-02-07 20:33:10,575 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:33:10,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound5.c [2025-02-07 20:33:10,591 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4f2450f8/37732199ea004b83ba8ac1caaa4e2759/FLAG9fdcfa16c [2025-02-07 20:33:10,623 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4f2450f8/37732199ea004b83ba8ac1caaa4e2759 [2025-02-07 20:33:10,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:33:10,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:33:10,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:33:10,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:33:10,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:33:10,633 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:33:10" (1/1) ... [2025-02-07 20:33:10,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@416e98c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:10, skipping insertion in model container [2025-02-07 20:33:10,635 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:33:10" (1/1) ... [2025-02-07 20:33:10,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:33:10,736 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/egcd-ll_unwindbound5.c[489,502] [2025-02-07 20:33:10,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:33:10,759 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:33:10,767 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/egcd-ll_unwindbound5.c[489,502] [2025-02-07 20:33:10,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:33:10,786 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:33:10,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:10 WrapperNode [2025-02-07 20:33:10,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:33:10,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:33:10,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:33:10,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:33:10,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:10" (1/1) ... [2025-02-07 20:33:10,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:10" (1/1) ... [2025-02-07 20:33:10,807 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2025-02-07 20:33:10,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:33:10,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:33:10,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:33:10,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:33:10,815 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:10" (1/1) ... [2025-02-07 20:33:10,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:10" (1/1) ... [2025-02-07 20:33:10,817 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:10" (1/1) ... [2025-02-07 20:33:10,828 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 20:33:10,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:10" (1/1) ... [2025-02-07 20:33:10,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:10" (1/1) ... [2025-02-07 20:33:10,830 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:10" (1/1) ... [2025-02-07 20:33:10,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:10" (1/1) ... [2025-02-07 20:33:10,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:10" (1/1) ... [2025-02-07 20:33:10,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:10" (1/1) ... [2025-02-07 20:33:10,840 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:33:10,841 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:33:10,841 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:33:10,841 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:33:10,842 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:10" (1/1) ... [2025-02-07 20:33:10,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:33:10,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:10,865 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 20:33:10,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 20:33:10,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:33:10,883 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 20:33:10,883 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 20:33:10,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:33:10,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:33:10,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:33:10,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-07 20:33:10,883 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-07 20:33:10,922 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:33:10,924 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:33:11,052 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-02-07 20:33:11,053 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:33:11,060 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:33:11,060 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:33:11,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:33:11 BoogieIcfgContainer [2025-02-07 20:33:11,061 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:33:11,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:33:11,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:33:11,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:33:11,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:33:10" (1/3) ... [2025-02-07 20:33:11,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f5ee12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:33:11, skipping insertion in model container [2025-02-07 20:33:11,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:10" (2/3) ... [2025-02-07 20:33:11,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f5ee12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:33:11, skipping insertion in model container [2025-02-07 20:33:11,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:33:11" (3/3) ... [2025-02-07 20:33:11,069 INFO L128 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound5.c [2025-02-07 20:33:11,079 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:33:11,080 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG egcd-ll_unwindbound5.c that has 3 procedures, 28 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 20:33:11,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:33:11,129 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;@d4d8d80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:33:11,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:33:11,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 20:33:11,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-07 20:33:11,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:11,138 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:33:11,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:11,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:11,142 INFO L85 PathProgramCache]: Analyzing trace with hash 898335684, now seen corresponding path program 1 times [2025-02-07 20:33:11,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:11,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961039585] [2025-02-07 20:33:11,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:11,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:11,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-07 20:33:11,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-07 20:33:11,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:11,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:11,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 20:33:11,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:11,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961039585] [2025-02-07 20:33:11,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961039585] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:33:11,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761990391] [2025-02-07 20:33:11,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:11,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:11,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:11,246 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:33:11,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 20:33:11,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-07 20:33:11,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-07 20:33:11,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:11,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:11,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-07 20:33:11,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:11,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 20:33:11,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:33:11,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761990391] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:33:11,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 20:33:11,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-07 20:33:11,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134653868] [2025-02-07 20:33:11,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:33:11,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 20:33:11,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:11,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 20:33:11,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:33:11,319 INFO L87 Difference]: Start difference. First operand has 28 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:33:11,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:11,330 INFO L93 Difference]: Finished difference Result 54 states and 86 transitions. [2025-02-07 20:33:11,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 20:33:11,331 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2025-02-07 20:33:11,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:11,334 INFO L225 Difference]: With dead ends: 54 [2025-02-07 20:33:11,334 INFO L226 Difference]: Without dead ends: 25 [2025-02-07 20:33:11,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 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-02-07 20:33:11,337 INFO L435 NwaCegarLoop]: 37 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, 37 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-02-07 20:33:11,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:33:11,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-07 20:33:11,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-07 20:33:11,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-07 20:33:11,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-02-07 20:33:11,361 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 17 [2025-02-07 20:33:11,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:11,362 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-02-07 20:33:11,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:33:11,363 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2025-02-07 20:33:11,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 20:33:11,363 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:11,363 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:33:11,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 20:33:11,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-07 20:33:11,564 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:11,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:11,565 INFO L85 PathProgramCache]: Analyzing trace with hash -956624687, now seen corresponding path program 1 times [2025-02-07 20:33:11,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:11,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141098514] [2025-02-07 20:33:11,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:11,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:11,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 20:33:11,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:33:11,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:11,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:33:11,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1914534436] [2025-02-07 20:33:11,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:11,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:11,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:11,593 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:33:11,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 20:33:11,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 20:33:11,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:33:11,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:11,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:11,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-07 20:33:11,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:11,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 20:33:11,724 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:33:11,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:11,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141098514] [2025-02-07 20:33:11,724 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:33:11,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914534436] [2025-02-07 20:33:11,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914534436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:33:11,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:33:11,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:33:11,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541463549] [2025-02-07 20:33:11,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:33:11,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:33:11,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:11,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:33:11,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:33:11,726 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 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-02-07 20:33:11,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:11,772 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2025-02-07 20:33:11,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:33:11,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 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 18 [2025-02-07 20:33:11,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:11,774 INFO L225 Difference]: With dead ends: 42 [2025-02-07 20:33:11,774 INFO L226 Difference]: Without dead ends: 40 [2025-02-07 20:33:11,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:33:11,775 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:33:11,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 105 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:33:11,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-07 20:33:11,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2025-02-07 20:33:11,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-07 20:33:11,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2025-02-07 20:33:11,787 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 18 [2025-02-07 20:33:11,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:11,787 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 56 transitions. [2025-02-07 20:33:11,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 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-02-07 20:33:11,787 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 56 transitions. [2025-02-07 20:33:11,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 20:33:11,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:11,788 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:33:11,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 20:33:11,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:11,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:11,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:11,989 INFO L85 PathProgramCache]: Analyzing trace with hash -955879912, now seen corresponding path program 1 times [2025-02-07 20:33:11,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:11,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716139505] [2025-02-07 20:33:11,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:11,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:11,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 20:33:12,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:33:12,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:12,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:12,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 20:33:12,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:12,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716139505] [2025-02-07 20:33:12,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716139505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:33:12,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:33:12,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:33:12,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804095371] [2025-02-07 20:33:12,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:33:12,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:33:12,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:12,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:33:12,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:33:12,064 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 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-02-07 20:33:12,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:12,077 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2025-02-07 20:33:12,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:33:12,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 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 18 [2025-02-07 20:33:12,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:12,079 INFO L225 Difference]: With dead ends: 55 [2025-02-07 20:33:12,079 INFO L226 Difference]: Without dead ends: 41 [2025-02-07 20:33:12,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:33:12,079 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:33:12,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 85 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:33:12,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-07 20:33:12,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-02-07 20:33:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 24 states have internal predecessors, (29), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-07 20:33:12,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2025-02-07 20:33:12,089 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 18 [2025-02-07 20:33:12,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:12,089 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2025-02-07 20:33:12,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 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-02-07 20:33:12,090 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2025-02-07 20:33:12,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 20:33:12,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:12,090 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:33:12,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:33:12,090 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:12,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:12,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1313637675, now seen corresponding path program 1 times [2025-02-07 20:33:12,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:12,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722853112] [2025-02-07 20:33:12,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:12,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:12,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 20:33:12,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:33:12,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:12,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:33:12,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [565287800] [2025-02-07 20:33:12,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:12,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:12,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:12,106 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:33:12,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 20:33:12,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 20:33:12,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:33:12,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:12,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:12,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-07 20:33:12,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:12,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 20:33:12,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:33:12,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:12,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722853112] [2025-02-07 20:33:12,195 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:33:12,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565287800] [2025-02-07 20:33:12,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565287800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:33:12,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:33:12,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:33:12,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827457571] [2025-02-07 20:33:12,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:33:12,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:33:12,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:12,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:33:12,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:33:12,196 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 20:33:12,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:12,247 INFO L93 Difference]: Finished difference Result 66 states and 99 transitions. [2025-02-07 20:33:12,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:33:12,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2025-02-07 20:33:12,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:12,248 INFO L225 Difference]: With dead ends: 66 [2025-02-07 20:33:12,248 INFO L226 Difference]: Without dead ends: 64 [2025-02-07 20:33:12,248 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-02-07 20:33:12,249 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:33:12,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 122 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:33:12,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-07 20:33:12,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2025-02-07 20:33:12,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 33 states have internal predecessors, (43), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-07 20:33:12,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2025-02-07 20:33:12,263 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 23 [2025-02-07 20:33:12,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:12,264 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions. [2025-02-07 20:33:12,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 20:33:12,264 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions. [2025-02-07 20:33:12,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-07 20:33:12,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:12,265 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:33:12,270 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-02-07 20:33:12,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:12,466 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:12,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:12,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1027252561, now seen corresponding path program 1 times [2025-02-07 20:33:12,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:12,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425703699] [2025-02-07 20:33:12,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:12,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:12,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-07 20:33:12,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 20:33:12,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:12,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:33:12,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [162741179] [2025-02-07 20:33:12,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:12,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:12,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:12,484 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:33:12,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 20:33:12,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-07 20:33:12,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 20:33:12,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:12,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:12,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-07 20:33:12,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:12,568 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 20:33:12,568 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:33:12,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:12,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425703699] [2025-02-07 20:33:12,568 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:33:12,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162741179] [2025-02-07 20:33:12,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162741179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:33:12,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:33:12,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:33:12,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249608333] [2025-02-07 20:33:12,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:33:12,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:33:12,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:12,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:33:12,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:33:12,570 INFO L87 Difference]: Start difference. First operand 57 states and 84 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 20:33:12,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:12,629 INFO L93 Difference]: Finished difference Result 64 states and 90 transitions. [2025-02-07 20:33:12,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:33:12,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2025-02-07 20:33:12,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:12,630 INFO L225 Difference]: With dead ends: 64 [2025-02-07 20:33:12,630 INFO L226 Difference]: Without dead ends: 60 [2025-02-07 20:33:12,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:33:12,631 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:33:12,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 107 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:33:12,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-07 20:33:12,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-02-07 20:33:12,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 36 states have internal predecessors, (46), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-07 20:33:12,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 84 transitions. [2025-02-07 20:33:12,638 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 84 transitions. Word has length 28 [2025-02-07 20:33:12,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:12,638 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 84 transitions. [2025-02-07 20:33:12,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 20:33:12,639 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 84 transitions. [2025-02-07 20:33:12,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-07 20:33:12,639 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:12,639 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:33:12,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 20:33:12,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:12,843 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:12,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:12,843 INFO L85 PathProgramCache]: Analyzing trace with hash -234456630, now seen corresponding path program 1 times [2025-02-07 20:33:12,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:12,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786818725] [2025-02-07 20:33:12,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:12,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:12,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-07 20:33:12,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 20:33:12,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:12,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:12,953 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-07 20:33:12,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:12,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786818725] [2025-02-07 20:33:12,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786818725] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:33:12,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:33:12,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:33:12,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110976029] [2025-02-07 20:33:12,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:33:12,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:33:12,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:12,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:33:12,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:33:12,955 INFO L87 Difference]: Start difference. First operand 60 states and 84 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-07 20:33:12,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:12,992 INFO L93 Difference]: Finished difference Result 72 states and 99 transitions. [2025-02-07 20:33:12,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:33:12,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2025-02-07 20:33:12,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:12,993 INFO L225 Difference]: With dead ends: 72 [2025-02-07 20:33:12,993 INFO L226 Difference]: Without dead ends: 70 [2025-02-07 20:33:12,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:33:12,994 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 3 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:33:12,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 131 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:33:12,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-07 20:33:13,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2025-02-07 20:33:13,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 41 states have internal predecessors, (49), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-07 20:33:13,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2025-02-07 20:33:13,008 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 34 [2025-02-07 20:33:13,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:13,008 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2025-02-07 20:33:13,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-07 20:33:13,009 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2025-02-07 20:33:13,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-07 20:33:13,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:13,010 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:33:13,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 20:33:13,010 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:13,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:13,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1884812455, now seen corresponding path program 1 times [2025-02-07 20:33:13,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:13,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915560599] [2025-02-07 20:33:13,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:13,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:13,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-07 20:33:13,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-07 20:33:13,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:13,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-07 20:33:13,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:13,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915560599] [2025-02-07 20:33:13,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915560599] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:33:13,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420826279] [2025-02-07 20:33:13,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:13,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:13,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:13,089 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:33:13,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 20:33:13,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-07 20:33:13,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-07 20:33:13,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:13,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:13,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 20:33:13,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:13,189 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-07 20:33:13,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:33:13,249 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-07 20:33:13,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420826279] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:33:13,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:33:13,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2025-02-07 20:33:13,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127212307] [2025-02-07 20:33:13,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:33:13,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 20:33:13,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:13,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 20:33:13,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-07 20:33:13,254 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-07 20:33:13,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:13,346 INFO L93 Difference]: Finished difference Result 199 states and 254 transitions. [2025-02-07 20:33:13,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 20:33:13,346 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 37 [2025-02-07 20:33:13,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:13,348 INFO L225 Difference]: With dead ends: 199 [2025-02-07 20:33:13,348 INFO L226 Difference]: Without dead ends: 185 [2025-02-07 20:33:13,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-02-07 20:33:13,348 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 52 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:33:13,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 121 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:33:13,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-07 20:33:13,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2025-02-07 20:33:13,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 107 states have (on average 1.2242990654205608) internal successors, (131), 115 states have internal predecessors, (131), 51 states have call successors, (51), 21 states have call predecessors, (51), 20 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-07 20:33:13,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 226 transitions. [2025-02-07 20:33:13,365 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 226 transitions. Word has length 37 [2025-02-07 20:33:13,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:13,368 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 226 transitions. [2025-02-07 20:33:13,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-07 20:33:13,368 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 226 transitions. [2025-02-07 20:33:13,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-07 20:33:13,370 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:13,370 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:33:13,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-07 20:33:13,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:13,571 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:13,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:13,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1523395935, now seen corresponding path program 1 times [2025-02-07 20:33:13,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:13,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631476613] [2025-02-07 20:33:13,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:13,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:13,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-07 20:33:13,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-07 20:33:13,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:13,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:33:13,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [68257055] [2025-02-07 20:33:13,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:13,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:13,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:13,589 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:33:13,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 20:33:13,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-07 20:33:13,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-07 20:33:13,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:13,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:13,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 20:33:13,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:13,694 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-07 20:33:13,694 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:33:13,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:13,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631476613] [2025-02-07 20:33:13,694 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:33:13,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68257055] [2025-02-07 20:33:13,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68257055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:33:13,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:33:13,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:33:13,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481022032] [2025-02-07 20:33:13,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:33:13,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:33:13,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:13,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:33:13,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:33:13,697 INFO L87 Difference]: Start difference. First operand 179 states and 226 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 20:33:13,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:13,753 INFO L93 Difference]: Finished difference Result 202 states and 255 transitions. [2025-02-07 20:33:13,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:33:13,753 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2025-02-07 20:33:13,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:13,755 INFO L225 Difference]: With dead ends: 202 [2025-02-07 20:33:13,756 INFO L226 Difference]: Without dead ends: 200 [2025-02-07 20:33:13,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:33:13,756 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:33:13,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 108 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:33:13,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-07 20:33:13,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2025-02-07 20:33:13,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 116 states have (on average 1.206896551724138) internal successors, (140), 127 states have internal predecessors, (140), 58 states have call successors, (58), 24 states have call predecessors, (58), 23 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-07 20:33:13,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 249 transitions. [2025-02-07 20:33:13,778 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 249 transitions. Word has length 37 [2025-02-07 20:33:13,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:13,778 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 249 transitions. [2025-02-07 20:33:13,778 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 20:33:13,778 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2025-02-07 20:33:13,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-07 20:33:13,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:13,780 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:33:13,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-07 20:33:13,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-07 20:33:13,981 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:13,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:13,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1924237458, now seen corresponding path program 1 times [2025-02-07 20:33:13,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:13,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813160436] [2025-02-07 20:33:13,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:13,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:13,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-07 20:33:13,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 20:33:13,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:13,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:14,124 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-07 20:33:14,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:14,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813160436] [2025-02-07 20:33:14,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813160436] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:33:14,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712136809] [2025-02-07 20:33:14,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:14,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:14,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:14,126 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:33:14,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-07 20:33:14,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-07 20:33:14,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 20:33:14,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:14,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:14,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 20:33:14,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:14,249 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-07 20:33:14,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:33:14,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712136809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:33:14,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 20:33:14,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-02-07 20:33:14,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804034023] [2025-02-07 20:33:14,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:33:14,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:33:14,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:14,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:33:14,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-07 20:33:14,250 INFO L87 Difference]: Start difference. First operand 198 states and 249 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-07 20:33:14,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:14,324 INFO L93 Difference]: Finished difference Result 229 states and 278 transitions. [2025-02-07 20:33:14,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:33:14,325 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2025-02-07 20:33:14,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:14,326 INFO L225 Difference]: With dead ends: 229 [2025-02-07 20:33:14,326 INFO L226 Difference]: Without dead ends: 219 [2025-02-07 20:33:14,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-02-07 20:33:14,327 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:33:14,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 131 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:33:14,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-07 20:33:14,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2025-02-07 20:33:14,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 129 states have (on average 1.178294573643411) internal successors, (152), 140 states have internal predecessors, (152), 57 states have call successors, (57), 28 states have call predecessors, (57), 28 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-07 20:33:14,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 260 transitions. [2025-02-07 20:33:14,347 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 260 transitions. Word has length 39 [2025-02-07 20:33:14,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:14,347 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 260 transitions. [2025-02-07 20:33:14,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-07 20:33:14,347 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 260 transitions. [2025-02-07 20:33:14,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-07 20:33:14,347 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:14,348 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:33:14,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-07 20:33:14,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:14,549 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:14,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:14,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1828962300, now seen corresponding path program 1 times [2025-02-07 20:33:14,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:14,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788784648] [2025-02-07 20:33:14,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:14,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:14,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-07 20:33:14,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-07 20:33:14,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:14,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:33:14,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [985535618] [2025-02-07 20:33:14,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:14,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:14,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:14,560 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:33:14,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-07 20:33:14,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-07 20:33:14,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-07 20:33:14,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:14,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:14,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-07 20:33:14,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:14,735 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-07 20:33:14,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:33:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-07 20:33:14,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:14,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788784648] [2025-02-07 20:33:14,806 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:33:14,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985535618] [2025-02-07 20:33:14,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985535618] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:33:14,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:33:14,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-02-07 20:33:14,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862020167] [2025-02-07 20:33:14,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:33:14,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 20:33:14,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:14,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 20:33:14,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:33:14,807 INFO L87 Difference]: Start difference. First operand 215 states and 260 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-07 20:33:15,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:15,099 INFO L93 Difference]: Finished difference Result 254 states and 316 transitions. [2025-02-07 20:33:15,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:33:15,100 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 42 [2025-02-07 20:33:15,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:15,101 INFO L225 Difference]: With dead ends: 254 [2025-02-07 20:33:15,101 INFO L226 Difference]: Without dead ends: 212 [2025-02-07 20:33:15,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:33:15,102 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 15 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:33:15,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 169 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:33:15,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-02-07 20:33:15,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 187. [2025-02-07 20:33:15,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 119 states have (on average 1.1596638655462186) internal successors, (138), 125 states have internal predecessors, (138), 43 states have call successors, (43), 25 states have call predecessors, (43), 24 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-07 20:33:15,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 219 transitions. [2025-02-07 20:33:15,129 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 219 transitions. Word has length 42 [2025-02-07 20:33:15,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:15,129 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 219 transitions. [2025-02-07 20:33:15,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-07 20:33:15,129 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 219 transitions. [2025-02-07 20:33:15,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-07 20:33:15,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:15,130 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:33:15,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-07 20:33:15,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:15,335 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:15,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:15,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1239305138, now seen corresponding path program 1 times [2025-02-07 20:33:15,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:15,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200172502] [2025-02-07 20:33:15,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:15,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:15,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-07 20:33:15,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-07 20:33:15,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:15,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:33:15,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1494050504] [2025-02-07 20:33:15,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:15,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:15,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:15,352 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:33:15,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-07 20:33:15,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-07 20:33:15,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-07 20:33:15,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:15,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:15,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-07 20:33:15,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-07 20:33:15,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:33:15,727 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-07 20:33:15,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:15,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200172502] [2025-02-07 20:33:15,727 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:33:15,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494050504] [2025-02-07 20:33:15,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494050504] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:33:15,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:33:15,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2025-02-07 20:33:15,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204747707] [2025-02-07 20:33:15,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:33:15,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-07 20:33:15,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:15,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-07 20:33:15,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-02-07 20:33:15,729 INFO L87 Difference]: Start difference. First operand 187 states and 219 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 12 states have internal predecessors, (37), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-02-07 20:33:15,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:15,956 INFO L93 Difference]: Finished difference Result 207 states and 245 transitions. [2025-02-07 20:33:15,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 20:33:15,956 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 12 states have internal predecessors, (37), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 56 [2025-02-07 20:33:15,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:15,957 INFO L225 Difference]: With dead ends: 207 [2025-02-07 20:33:15,957 INFO L226 Difference]: Without dead ends: 200 [2025-02-07 20:33:15,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2025-02-07 20:33:15,958 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 30 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:33:15,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 414 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:33:15,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-07 20:33:15,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 178. [2025-02-07 20:33:15,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 119 states have (on average 1.1512605042016806) internal successors, (137), 121 states have internal predecessors, (137), 34 states have call successors, (34), 25 states have call predecessors, (34), 24 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-07 20:33:15,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 203 transitions. [2025-02-07 20:33:15,979 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 203 transitions. Word has length 56 [2025-02-07 20:33:15,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:15,979 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 203 transitions. [2025-02-07 20:33:15,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 12 states have internal predecessors, (37), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-02-07 20:33:15,980 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 203 transitions. [2025-02-07 20:33:15,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-07 20:33:15,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:15,980 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:33:15,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-07 20:33:16,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:16,181 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:16,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:16,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1704787613, now seen corresponding path program 1 times [2025-02-07 20:33:16,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:16,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198727366] [2025-02-07 20:33:16,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:16,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:16,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-07 20:33:16,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-07 20:33:16,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:16,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-07 20:33:16,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:16,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198727366] [2025-02-07 20:33:16,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198727366] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:33:16,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521521448] [2025-02-07 20:33:16,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:16,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:16,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:16,338 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:33:16,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-07 20:33:16,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-07 20:33:16,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-07 20:33:16,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:16,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:16,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-07 20:33:16,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-07 20:33:16,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:33:16,499 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-07 20:33:16,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521521448] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:33:16,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:33:16,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 13 [2025-02-07 20:33:16,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209592385] [2025-02-07 20:33:16,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:33:16,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 20:33:16,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:16,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 20:33:16,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-07 20:33:16,501 INFO L87 Difference]: Start difference. First operand 178 states and 203 transitions. Second operand has 13 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-07 20:33:16,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:16,583 INFO L93 Difference]: Finished difference Result 204 states and 232 transitions. [2025-02-07 20:33:16,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:33:16,583 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) Word has length 58 [2025-02-07 20:33:16,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:16,585 INFO L225 Difference]: With dead ends: 204 [2025-02-07 20:33:16,585 INFO L226 Difference]: Without dead ends: 184 [2025-02-07 20:33:16,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-02-07 20:33:16,586 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 19 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:33:16,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 99 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:33:16,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-07 20:33:16,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-02-07 20:33:16,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 123 states have (on average 1.113821138211382) internal successors, (137), 127 states have internal predecessors, (137), 36 states have call successors, (36), 24 states have call predecessors, (36), 24 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-07 20:33:16,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 207 transitions. [2025-02-07 20:33:16,607 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 207 transitions. Word has length 58 [2025-02-07 20:33:16,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:16,608 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 207 transitions. [2025-02-07 20:33:16,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-07 20:33:16,608 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 207 transitions. [2025-02-07 20:33:16,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-07 20:33:16,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:16,609 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:33:16,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-07 20:33:16,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-07 20:33:16,814 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:16,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:16,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1662798504, now seen corresponding path program 2 times [2025-02-07 20:33:16,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:16,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201206911] [2025-02-07 20:33:16,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:33:16,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:16,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-02-07 20:33:16,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-02-07 20:33:16,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:33:16,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:16,986 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-02-07 20:33:16,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:16,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201206911] [2025-02-07 20:33:16,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201206911] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:33:16,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440832239] [2025-02-07 20:33:16,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:33:16,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:16,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:16,989 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:33:16,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-07 20:33:17,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-02-07 20:33:17,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-02-07 20:33:17,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:33:17,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:17,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 20:33:17,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 266 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-07 20:33:17,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:33:17,214 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-02-07 20:33:17,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440832239] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:33:17,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:33:17,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 11 [2025-02-07 20:33:17,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482369514] [2025-02-07 20:33:17,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:33:17,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 20:33:17,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:17,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 20:33:17,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:33:17,216 INFO L87 Difference]: Start difference. First operand 184 states and 207 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 7 states have call successors, (31), 7 states have call predecessors, (31), 6 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) [2025-02-07 20:33:17,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:17,299 INFO L93 Difference]: Finished difference Result 246 states and 280 transitions. [2025-02-07 20:33:17,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 20:33:17,299 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 7 states have call successors, (31), 7 states have call predecessors, (31), 6 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) Word has length 94 [2025-02-07 20:33:17,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:17,300 INFO L225 Difference]: With dead ends: 246 [2025-02-07 20:33:17,300 INFO L226 Difference]: Without dead ends: 237 [2025-02-07 20:33:17,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 181 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-02-07 20:33:17,301 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:33:17,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 94 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:33:17,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-02-07 20:33:17,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2025-02-07 20:33:17,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 158 states have (on average 1.1075949367088607) internal successors, (175), 163 states have internal predecessors, (175), 47 states have call successors, (47), 31 states have call predecessors, (47), 31 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-07 20:33:17,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 267 transitions. [2025-02-07 20:33:17,339 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 267 transitions. Word has length 94 [2025-02-07 20:33:17,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:17,339 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 267 transitions. [2025-02-07 20:33:17,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 7 states have call successors, (31), 7 states have call predecessors, (31), 6 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) [2025-02-07 20:33:17,340 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 267 transitions. [2025-02-07 20:33:17,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-07 20:33:17,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:17,341 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:33:17,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-07 20:33:17,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-07 20:33:17,541 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:17,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:17,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1447355751, now seen corresponding path program 3 times [2025-02-07 20:33:17,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:17,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800674821] [2025-02-07 20:33:17,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:33:17,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:17,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 113 statements into 11 equivalence classes. [2025-02-07 20:33:17,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 113 of 113 statements. [2025-02-07 20:33:17,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-07 20:33:17,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:33:17,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1493906163] [2025-02-07 20:33:17,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:33:17,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:17,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:17,584 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:33:17,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-07 20:33:17,612 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 113 statements into 11 equivalence classes. [2025-02-07 20:33:17,642 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 113 of 113 statements. [2025-02-07 20:33:17,642 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-07 20:33:17,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 20:33:17,642 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 20:33:17,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-07 20:33:17,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-07 20:33:17,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:17,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 20:33:17,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 20:33:17,691 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 20:33:17,691 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 20:33:17,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-07 20:33:17,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:17,895 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:33:17,936 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 20:33:17,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 08:33:17 BoogieIcfgContainer [2025-02-07 20:33:17,941 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 20:33:17,941 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 20:33:17,941 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 20:33:17,942 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 20:33:17,942 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:33:11" (3/4) ... [2025-02-07 20:33:17,943 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-07 20:33:17,987 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 76. [2025-02-07 20:33:18,049 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 20:33:18,049 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 20:33:18,049 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 20:33:18,050 INFO L158 Benchmark]: Toolchain (without parser) took 7423.78ms. Allocated memory is still 201.3MB. Free memory was 156.1MB in the beginning and 120.5MB in the end (delta: 35.6MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2025-02-07 20:33:18,050 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:33:18,050 INFO L158 Benchmark]: CACSL2BoogieTranslator took 158.84ms. Allocated memory is still 201.3MB. Free memory was 155.7MB in the beginning and 144.3MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:33:18,050 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.16ms. Allocated memory is still 201.3MB. Free memory was 144.3MB in the beginning and 143.4MB in the end (delta: 932.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:33:18,050 INFO L158 Benchmark]: Boogie Preprocessor took 30.90ms. Allocated memory is still 201.3MB. Free memory was 143.4MB in the beginning and 142.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:33:18,050 INFO L158 Benchmark]: IcfgBuilder took 220.04ms. Allocated memory is still 201.3MB. Free memory was 142.1MB in the beginning and 130.1MB in the end (delta: 12.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 20:33:18,050 INFO L158 Benchmark]: TraceAbstraction took 6878.00ms. Allocated memory is still 201.3MB. Free memory was 129.2MB in the beginning and 130.7MB in the end (delta: -1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:33:18,050 INFO L158 Benchmark]: Witness Printer took 107.59ms. Allocated memory is still 201.3MB. Free memory was 130.7MB in the beginning and 120.5MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:33:18,051 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 158.84ms. Allocated memory is still 201.3MB. Free memory was 155.7MB in the beginning and 144.3MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.16ms. Allocated memory is still 201.3MB. Free memory was 144.3MB in the beginning and 143.4MB in the end (delta: 932.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.90ms. Allocated memory is still 201.3MB. Free memory was 143.4MB in the beginning and 142.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 220.04ms. Allocated memory is still 201.3MB. Free memory was 142.1MB in the beginning and 130.1MB in the end (delta: 12.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6878.00ms. Allocated memory is still 201.3MB. Free memory was 129.2MB in the beginning and 130.7MB in the end (delta: -1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 107.59ms. Allocated memory is still 201.3MB. Free memory was 130.7MB in the beginning and 120.5MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [counter=0, x=7, y=1] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [counter=0, x=7, y=1] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=7, b=1, counter=0, p=1, q=0, r=0, s=1, x=7, y=1] [L34] COND TRUE counter++<5 [L34] EXPR counter++ VAL [a=7, b=1, counter=1, p=1, q=0, r=0, s=1, x=7, y=1] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=7, b=1, counter=1, p=1, q=0, r=0, s=1, x=7, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=7, b=1, counter=1, p=1, q=0, r=0, s=1, x=7, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=7, b=1, counter=1, p=1, q=0, r=0, s=1, x=7, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=7, b=1, counter=1, p=1, q=0, r=0, s=1, x=7, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=6, b=1, counter=1, p=1, q=0, r=-1, s=1, x=7, y=1] [L34] COND TRUE counter++<5 [L34] EXPR counter++ VAL [a=6, b=1, counter=2, p=1, q=0, r=-1, s=1, x=7, y=1] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=6, b=1, counter=2, p=1, q=0, r=-1, s=1, x=7, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=6, b=1, counter=2, p=1, q=0, r=-1, s=1, x=7, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=6, b=1, counter=2, p=1, q=0, r=-1, s=1, x=7, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=6, b=1, counter=2, p=1, q=0, r=-1, s=1, x=7, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=5, b=1, counter=2, p=1, q=0, r=-2, s=1, x=7, y=1] [L34] COND TRUE counter++<5 [L34] EXPR counter++ VAL [a=5, b=1, counter=3, p=1, q=0, r=-2, s=1, x=7, y=1] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=5, b=1, counter=3, p=1, q=0, r=-2, s=1, x=7, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=5, b=1, counter=3, p=1, q=0, r=-2, s=1, x=7, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=5, b=1, counter=3, p=1, q=0, r=-2, s=1, x=7, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=5, b=1, counter=3, p=1, q=0, r=-2, s=1, x=7, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=4, b=1, counter=3, p=1, q=0, r=-3, s=1, x=7, y=1] [L34] COND TRUE counter++<5 [L34] EXPR counter++ VAL [a=4, b=1, counter=4, p=1, q=0, r=-3, s=1, x=7, y=1] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=4, b=1, counter=4, p=1, q=0, r=-3, s=1, x=7, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=4, b=1, counter=4, p=1, q=0, r=-3, s=1, x=7, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=4, b=1, counter=4, p=1, q=0, r=-3, s=1, x=7, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=4, b=1, counter=4, p=1, q=0, r=-3, s=1, x=7, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=3, b=1, counter=4, p=1, q=0, r=-4, s=1, x=7, y=1] [L34] COND TRUE counter++<5 [L34] EXPR counter++ VAL [a=3, b=1, counter=5, p=1, q=0, r=-4, s=1, x=7, y=1] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=3, b=1, counter=5, p=1, q=0, r=-4, s=1, x=7, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=3, b=1, counter=5, p=1, q=0, r=-4, s=1, x=7, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=3, b=1, counter=5, p=1, q=0, r=-4, s=1, x=7, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=3, b=1, counter=5, p=1, q=0, r=-4, s=1, x=7, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=2, b=1, counter=5, p=1, q=0, r=-5, s=1, x=7, y=1] [L34] COND TRUE counter++<5 [L34] EXPR counter++ VAL [a=2, b=1, counter=6, p=1, q=0, r=-5, s=1, x=7, y=1] [L34] COND FALSE !(counter++<5) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, counter=6] [L11] COND TRUE !(cond) VAL [\old(cond)=0, counter=6] [L13] reach_error() VAL [\old(cond)=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 14, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 197 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 1723 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1303 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 715 IncrementalHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 420 mSDtfsCounter, 715 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 788 GetRequests, 685 SyntacticMatches, 8 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=237occurred in iteration=13, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 71 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1176 NumberOfCodeBlocks, 1176 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 1010 ConstructedInterpolants, 0 QuantifiedInterpolants, 2848 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1289 ConjunctsInSsa, 139 ConjunctsInUnsatCore, 23 InterpolantComputations, 8 PerfectInterpolantSequences, 1404/1833 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-07 20:33:18,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE