./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/bh2017-ex-add.i --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/loop-lit/bh2017-ex-add.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9067bcd66b4865bfb6aa4fb5c23797c879c2b81c36d918479d6650dc5a4b5edc --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:16:42,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:16:42,703 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:16:42,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:16:42,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:16:42,730 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:16:42,731 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:16:42,731 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:16:42,731 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:16:42,731 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:16:42,732 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:16:42,732 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:16:42,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:16:42,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:16:42,733 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:16:42,733 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:16:42,733 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:16:42,733 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:16:42,734 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:16:42,734 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:16:42,734 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:16:42,734 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:16:42,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:16:42,734 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:16:42,734 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:16:42,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:16:42,734 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:16:42,734 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:16:42,734 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:16:42,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:16:42,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:16:42,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:16:42,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:16:42,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:16:42,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:16:42,735 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:16:42,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:16:42,735 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:16:42,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:16:42,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:16:42,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:16:42,736 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:16:42,736 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:16:42,736 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 -> 9067bcd66b4865bfb6aa4fb5c23797c879c2b81c36d918479d6650dc5a4b5edc [2025-02-07 20:16:42,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:16:42,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:16:42,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:16:42,958 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:16:42,958 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:16:42,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/bh2017-ex-add.i [2025-02-07 20:16:44,107 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3f90eaffd/a7687fdcf74b44fa8e96a81cd05701e7/FLAG3e1ff256b [2025-02-07 20:16:44,326 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:16:44,328 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex-add.i [2025-02-07 20:16:44,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3f90eaffd/a7687fdcf74b44fa8e96a81cd05701e7/FLAG3e1ff256b [2025-02-07 20:16:44,671 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3f90eaffd/a7687fdcf74b44fa8e96a81cd05701e7 [2025-02-07 20:16:44,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:16:44,675 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:16:44,676 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:16:44,676 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:16:44,679 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:16:44,679 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:16:44" (1/1) ... [2025-02-07 20:16:44,680 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a436c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:44, skipping insertion in model container [2025-02-07 20:16:44,680 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:16:44" (1/1) ... [2025-02-07 20:16:44,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:16:44,792 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex-add.i[802,815] [2025-02-07 20:16:44,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:16:44,809 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:16:44,817 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex-add.i[802,815] [2025-02-07 20:16:44,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:16:44,834 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:16:44,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:44 WrapperNode [2025-02-07 20:16:44,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:16:44,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:16:44,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:16:44,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:16:44,841 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:16:44" (1/1) ... [2025-02-07 20:16:44,846 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:16:44" (1/1) ... [2025-02-07 20:16:44,856 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2025-02-07 20:16:44,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:16:44,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:16:44,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:16:44,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:16:44,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:44" (1/1) ... [2025-02-07 20:16:44,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:44" (1/1) ... [2025-02-07 20:16:44,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:44" (1/1) ... [2025-02-07 20:16:44,877 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:16:44,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:44" (1/1) ... [2025-02-07 20:16:44,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:44" (1/1) ... [2025-02-07 20:16:44,879 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:44" (1/1) ... [2025-02-07 20:16:44,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:44" (1/1) ... [2025-02-07 20:16:44,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:44" (1/1) ... [2025-02-07 20:16:44,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:44" (1/1) ... [2025-02-07 20:16:44,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:16:44,884 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:16:44,884 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:16:44,884 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:16:44,885 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:44" (1/1) ... [2025-02-07 20:16:44,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:16:44,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:16:44,909 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:16:44,914 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:16:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:16:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:16:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:16:44,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:16:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-07 20:16:44,927 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-07 20:16:44,966 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:16:44,967 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:16:45,045 INFO L? ?]: Removed 2 outVars from TransFormulas that were not future-live. [2025-02-07 20:16:45,045 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:16:45,052 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:16:45,052 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:16:45,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:16:45 BoogieIcfgContainer [2025-02-07 20:16:45,052 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:16:45,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:16:45,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:16:45,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:16:45,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:16:44" (1/3) ... [2025-02-07 20:16:45,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac18c27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:16:45, skipping insertion in model container [2025-02-07 20:16:45,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:44" (2/3) ... [2025-02-07 20:16:45,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac18c27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:16:45, skipping insertion in model container [2025-02-07 20:16:45,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:16:45" (3/3) ... [2025-02-07 20:16:45,059 INFO L128 eAbstractionObserver]: Analyzing ICFG bh2017-ex-add.i [2025-02-07 20:16:45,068 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:16:45,069 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bh2017-ex-add.i that has 2 procedures, 24 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 20:16:45,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:16:45,114 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;@7326af2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:16:45,114 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:16:45,116 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 20:16:45,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-07 20:16:45,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:45,120 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-07 20:16:45,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:45,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:45,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1537839159, now seen corresponding path program 1 times [2025-02-07 20:16:45,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:45,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452762465] [2025-02-07 20:16:45,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:45,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:45,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 20:16:45,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 20:16:45,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:45,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:45,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:45,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:45,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452762465] [2025-02-07 20:16:45,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452762465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:45,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:45,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:16:45,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575233381] [2025-02-07 20:16:45,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:45,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:16:45,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:45,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:16:45,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:16:45,341 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 1.0) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:45,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:45,397 INFO L93 Difference]: Finished difference Result 49 states and 74 transitions. [2025-02-07 20:16:45,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:16:45,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.0) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-07 20:16:45,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:45,406 INFO L225 Difference]: With dead ends: 49 [2025-02-07 20:16:45,406 INFO L226 Difference]: Without dead ends: 26 [2025-02-07 20:16:45,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:16:45,412 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:45,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 81 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:16:45,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-07 20:16:45,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-02-07 20:16:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 20:16:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2025-02-07 20:16:45,435 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 6 [2025-02-07 20:16:45,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:45,435 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2025-02-07 20:16:45,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.0) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:45,436 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2025-02-07 20:16:45,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 20:16:45,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:45,436 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:45,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:16:45,437 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:45,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:45,437 INFO L85 PathProgramCache]: Analyzing trace with hash -612508028, now seen corresponding path program 1 times [2025-02-07 20:16:45,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:45,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279764809] [2025-02-07 20:16:45,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:45,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:45,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 20:16:45,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 20:16:45,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:45,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:45,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:45,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:45,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279764809] [2025-02-07 20:16:45,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279764809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:45,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:45,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:16:45,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100328078] [2025-02-07 20:16:45,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:45,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:16:45,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:45,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:16:45,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:16:45,517 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:16:45,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:45,562 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2025-02-07 20:16:45,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:16:45,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-07 20:16:45,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:45,563 INFO L225 Difference]: With dead ends: 32 [2025-02-07 20:16:45,563 INFO L226 Difference]: Without dead ends: 30 [2025-02-07 20:16:45,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:45,563 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:45,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 88 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:16:45,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-07 20:16:45,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-02-07 20:16:45,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 20:16:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2025-02-07 20:16:45,568 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 11 [2025-02-07 20:16:45,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:45,568 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-02-07 20:16:45,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:16:45,568 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2025-02-07 20:16:45,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-07 20:16:45,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:45,569 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:45,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:16:45,569 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:45,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:45,570 INFO L85 PathProgramCache]: Analyzing trace with hash -949831532, now seen corresponding path program 1 times [2025-02-07 20:16:45,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:45,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496174308] [2025-02-07 20:16:45,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:45,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:45,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-07 20:16:45,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 20:16:45,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:45,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:45,616 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 20:16:45,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:45,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496174308] [2025-02-07 20:16:45,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496174308] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:45,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:45,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:16:45,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115291281] [2025-02-07 20:16:45,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:45,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:16:45,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:45,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:16:45,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:16:45,618 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:16:45,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:45,635 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2025-02-07 20:16:45,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:16:45,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 20 [2025-02-07 20:16:45,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:45,636 INFO L225 Difference]: With dead ends: 72 [2025-02-07 20:16:45,636 INFO L226 Difference]: Without dead ends: 43 [2025-02-07 20:16:45,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:16:45,637 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:45,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 57 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:16:45,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-07 20:16:45,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-07 20:16:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 20:16:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2025-02-07 20:16:45,646 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 20 [2025-02-07 20:16:45,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:45,646 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2025-02-07 20:16:45,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:16:45,647 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2025-02-07 20:16:45,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 20:16:45,647 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:45,647 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:45,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:16:45,647 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:45,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:45,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1716723243, now seen corresponding path program 1 times [2025-02-07 20:16:45,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:45,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942989213] [2025-02-07 20:16:45,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:45,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:45,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 20:16:45,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 20:16:45,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:45,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:45,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 20:16:45,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:45,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942989213] [2025-02-07 20:16:45,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942989213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:45,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:45,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:16:45,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573665408] [2025-02-07 20:16:45,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:45,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:16:45,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:45,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:16:45,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:16:45,711 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:16:45,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:45,730 INFO L93 Difference]: Finished difference Result 109 states and 155 transitions. [2025-02-07 20:16:45,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:16:45,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 22 [2025-02-07 20:16:45,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:45,731 INFO L225 Difference]: With dead ends: 109 [2025-02-07 20:16:45,731 INFO L226 Difference]: Without dead ends: 67 [2025-02-07 20:16:45,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:16:45,732 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 8 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:45,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 60 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:16:45,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-07 20:16:45,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-07 20:16:45,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-07 20:16:45,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2025-02-07 20:16:45,743 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 22 [2025-02-07 20:16:45,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:45,743 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2025-02-07 20:16:45,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:16:45,743 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2025-02-07 20:16:45,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-07 20:16:45,744 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:45,744 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:45,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 20:16:45,744 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:45,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:45,744 INFO L85 PathProgramCache]: Analyzing trace with hash 387668052, now seen corresponding path program 1 times [2025-02-07 20:16:45,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:45,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136195532] [2025-02-07 20:16:45,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:45,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:45,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-07 20:16:45,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-07 20:16:45,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:45,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:45,836 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:16:45,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:45,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136195532] [2025-02-07 20:16:45,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136195532] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:16:45,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949290597] [2025-02-07 20:16:45,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:45,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:16:45,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:16:45,838 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:16:45,840 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:16:45,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-07 20:16:45,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-07 20:16:45,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:45,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:45,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 20:16:45,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:16:45,946 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:16:45,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:16:46,010 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:16:46,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949290597] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:16:46,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:16:46,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-07 20:16:46,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819364186] [2025-02-07 20:16:46,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:16:46,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:16:46,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:46,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:16:46,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:16:46,011 INFO L87 Difference]: Start difference. First operand 67 states and 96 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-07 20:16:46,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:46,052 INFO L93 Difference]: Finished difference Result 205 states and 311 transitions. [2025-02-07 20:16:46,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:16:46,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 37 [2025-02-07 20:16:46,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:46,054 INFO L225 Difference]: With dead ends: 205 [2025-02-07 20:16:46,054 INFO L226 Difference]: Without dead ends: 139 [2025-02-07 20:16:46,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:16:46,055 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 42 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:46,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 140 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:16:46,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-07 20:16:46,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-02-07 20:16:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 108 states have (on average 1.4444444444444444) internal successors, (156), 108 states have internal predecessors, (156), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-07 20:16:46,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 210 transitions. [2025-02-07 20:16:46,073 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 210 transitions. Word has length 37 [2025-02-07 20:16:46,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:46,076 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 210 transitions. [2025-02-07 20:16:46,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-07 20:16:46,077 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 210 transitions. [2025-02-07 20:16:46,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-07 20:16:46,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:46,077 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:46,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 20:16:46,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:16:46,280 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:46,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:46,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2144258123, now seen corresponding path program 1 times [2025-02-07 20:16:46,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:46,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955134339] [2025-02-07 20:16:46,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:46,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:46,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-07 20:16:46,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 20:16:46,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:46,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:46,324 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:16:46,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:46,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955134339] [2025-02-07 20:16:46,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955134339] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:16:46,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070566133] [2025-02-07 20:16:46,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:46,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:16:46,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:16:46,327 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:16:46,328 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:16:46,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-07 20:16:46,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 20:16:46,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:46,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:46,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 20:16:46,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:16:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:16:46,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:16:46,441 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:16:46,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070566133] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:16:46,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:16:46,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-07 20:16:46,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207023632] [2025-02-07 20:16:46,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:16:46,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:16:46,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:46,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:16:46,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:46,442 INFO L87 Difference]: Start difference. First operand 139 states and 210 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-07 20:16:46,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:46,486 INFO L93 Difference]: Finished difference Result 448 states and 701 transitions. [2025-02-07 20:16:46,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:16:46,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 39 [2025-02-07 20:16:46,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:46,488 INFO L225 Difference]: With dead ends: 448 [2025-02-07 20:16:46,489 INFO L226 Difference]: Without dead ends: 310 [2025-02-07 20:16:46,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:46,490 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 54 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:46,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 118 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:16:46,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-02-07 20:16:46,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2025-02-07 20:16:46,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 246 states have (on average 1.451219512195122) internal successors, (357), 246 states have internal predecessors, (357), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-07 20:16:46,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 477 transitions. [2025-02-07 20:16:46,524 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 477 transitions. Word has length 39 [2025-02-07 20:16:46,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:46,524 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 477 transitions. [2025-02-07 20:16:46,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-07 20:16:46,525 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 477 transitions. [2025-02-07 20:16:46,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-07 20:16:46,531 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:46,532 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2025-02-07 20:16:46,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 20:16:46,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:16:46,732 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:46,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:46,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1975801708, now seen corresponding path program 2 times [2025-02-07 20:16:46,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:46,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642785089] [2025-02-07 20:16:46,733 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:16:46,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:46,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-02-07 20:16:46,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-02-07 20:16:46,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:16:46,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:46,905 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 63 proven. 4 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-02-07 20:16:46,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:46,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642785089] [2025-02-07 20:16:46,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642785089] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:16:46,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838890689] [2025-02-07 20:16:46,905 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:16:46,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:16:46,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:16:46,907 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:16:46,909 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:16:46,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-02-07 20:16:46,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-02-07 20:16:46,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:16:46,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:46,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 20:16:46,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:16:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 20 proven. 82 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 20:16:47,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:16:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 20 proven. 82 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 20:16:47,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838890689] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:16:47,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:16:47,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-02-07 20:16:47,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460895495] [2025-02-07 20:16:47,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:16:47,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-07 20:16:47,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:47,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-07 20:16:47,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-02-07 20:16:47,217 INFO L87 Difference]: Start difference. First operand 310 states and 477 transitions. Second operand has 17 states, 16 states have (on average 5.6875) internal successors, (91), 17 states have internal predecessors, (91), 14 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-02-07 20:16:47,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:47,402 INFO L93 Difference]: Finished difference Result 963 states and 1520 transitions. [2025-02-07 20:16:47,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-07 20:16:47,402 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.6875) internal successors, (91), 17 states have internal predecessors, (91), 14 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) Word has length 88 [2025-02-07 20:16:47,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:47,407 INFO L225 Difference]: With dead ends: 963 [2025-02-07 20:16:47,407 INFO L226 Difference]: Without dead ends: 654 [2025-02-07 20:16:47,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-02-07 20:16:47,408 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 164 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:47,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 293 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:47,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-02-07 20:16:47,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 654. [2025-02-07 20:16:47,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 524 states have (on average 1.452290076335878) internal successors, (761), 523 states have internal predecessors, (761), 126 states have call successors, (126), 4 states have call predecessors, (126), 3 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-02-07 20:16:47,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1013 transitions. [2025-02-07 20:16:47,444 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1013 transitions. Word has length 88 [2025-02-07 20:16:47,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:47,445 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 1013 transitions. [2025-02-07 20:16:47,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.6875) internal successors, (91), 17 states have internal predecessors, (91), 14 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-02-07 20:16:47,445 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1013 transitions. [2025-02-07 20:16:47,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-07 20:16:47,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:47,448 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2025-02-07 20:16:47,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 20:16:47,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:16:47,648 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:47,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:47,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1736255019, now seen corresponding path program 2 times [2025-02-07 20:16:47,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:47,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295324329] [2025-02-07 20:16:47,649 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:16:47,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:47,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-02-07 20:16:47,660 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 90 of 90 statements. [2025-02-07 20:16:47,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:16:47,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:47,769 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-02-07 20:16:47,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:47,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295324329] [2025-02-07 20:16:47,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295324329] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:47,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:47,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:16:47,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603105973] [2025-02-07 20:16:47,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:47,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:16:47,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:47,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:16:47,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:47,770 INFO L87 Difference]: Start difference. First operand 654 states and 1013 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 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:16:47,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:47,829 INFO L93 Difference]: Finished difference Result 656 states and 1014 transitions. [2025-02-07 20:16:47,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:16:47,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 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 90 [2025-02-07 20:16:47,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:47,830 INFO L225 Difference]: With dead ends: 656 [2025-02-07 20:16:47,830 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 20:16:47,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:16:47,832 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:47,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 92 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:16:47,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 20:16:47,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 20:16:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 20:16:47,833 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2025-02-07 20:16:47,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:47,833 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 20:16:47,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 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:16:47,834 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 20:16:47,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 20:16:47,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 20:16:47,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 20:16:47,841 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-02-07 20:16:47,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 20:16:48,858 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 20:16:48,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 08:16:48 BoogieIcfgContainer [2025-02-07 20:16:48,868 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 20:16:48,868 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 20:16:48,869 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 20:16:48,869 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 20:16:48,869 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:16:45" (3/4) ... [2025-02-07 20:16:48,871 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 20:16:48,874 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-07 20:16:48,878 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-07 20:16:48,878 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-07 20:16:48,878 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 20:16:48,878 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 20:16:48,933 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 20:16:48,933 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 20:16:48,933 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 20:16:48,934 INFO L158 Benchmark]: Toolchain (without parser) took 4258.52ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 111.9MB in the beginning and 286.8MB in the end (delta: -174.9MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. [2025-02-07 20:16:48,934 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:16:48,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.23ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 101.1MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:16:48,935 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.56ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 100.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:16:48,935 INFO L158 Benchmark]: Boogie Preprocessor took 23.25ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 99.0MB in the end (delta: 994.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:16:48,935 INFO L158 Benchmark]: IcfgBuilder took 168.58ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 87.4MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 20:16:48,936 INFO L158 Benchmark]: TraceAbstraction took 3814.43ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 86.9MB in the beginning and 291.1MB in the end (delta: -204.2MB). Peak memory consumption was 219.5MB. Max. memory is 16.1GB. [2025-02-07 20:16:48,936 INFO L158 Benchmark]: Witness Printer took 64.52ms. Allocated memory is still 427.8MB. Free memory was 291.1MB in the beginning and 286.8MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:16:48,937 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.34ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 160.23ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 101.1MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.56ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 100.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.25ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 99.0MB in the end (delta: 994.4kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 168.58ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 87.4MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3814.43ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 86.9MB in the beginning and 291.1MB in the end (delta: -204.2MB). Peak memory consumption was 219.5MB. Max. memory is 16.1GB. * Witness Printer took 64.52ms. Allocated memory is still 427.8MB. Free memory was 291.1MB in the beginning and 286.8MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 354 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 323 mSDsluCounter, 929 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 693 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 234 IncrementalHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 236 mSDtfsCounter, 234 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 365 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=654occurred in iteration=7, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 477 NumberOfCodeBlocks, 477 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 627 ConstructedInterpolants, 0 QuantifiedInterpolants, 1109 SizeOfPredicates, 0 NumberOfNonLiveVariables, 339 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 1178/1394 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Location Invariant Derived location invariant: ((m <= 60) && (n <= 60)) RESULT: Ultimate proved your program to be correct! [2025-02-07 20:16:48,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE