./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/heapsort.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-invgen/heapsort.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 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:16:15,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:16:15,893 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:15,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:16:15,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:16:15,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:16:15,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:16:15,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:16:15,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:16:15,911 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:16:15,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:16:15,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:16:15,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:16:15,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:16:15,912 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:16:15,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:16:15,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:16:15,912 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:16:15,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:16:15,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:16:15,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:16:15,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:16:15,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:16:15,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:16:15,913 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:16:15,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:16:15,913 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:16:15,913 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:16:15,913 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:16:15,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:16:15,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:16:15,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:16:15,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:16:15,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:16:15,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:16:15,914 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:16:15,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:16:15,914 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:16:15,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:16:15,914 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:16:15,914 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:16:15,914 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:16:15,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:16:15,915 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 -> 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 [2025-02-07 20:16:16,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:16:16,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:16:16,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:16:16,120 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:16:16,120 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:16:16,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/heapsort.i [2025-02-07 20:16:17,218 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ed89b0d1/709e130c3e564d0bb37d052aebcf2257/FLAG03b51552d [2025-02-07 20:16:17,452 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:16:17,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2025-02-07 20:16:17,461 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ed89b0d1/709e130c3e564d0bb37d052aebcf2257/FLAG03b51552d [2025-02-07 20:16:17,794 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ed89b0d1/709e130c3e564d0bb37d052aebcf2257 [2025-02-07 20:16:17,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:16:17,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:16:17,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:16:17,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:16:17,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:16:17,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:16:17" (1/1) ... [2025-02-07 20:16:17,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24750cd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:17, skipping insertion in model container [2025-02-07 20:16:17,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:16:17" (1/1) ... [2025-02-07 20:16:17,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:16:17,919 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-invgen/heapsort.i[893,906] [2025-02-07 20:16:17,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:16:17,942 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:16:17,949 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-invgen/heapsort.i[893,906] [2025-02-07 20:16:17,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:16:17,968 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:16:17,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:17 WrapperNode [2025-02-07 20:16:17,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:16:17,970 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:16:17,970 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:16:17,970 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:16:17,974 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:17" (1/1) ... [2025-02-07 20:16:17,980 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:17" (1/1) ... [2025-02-07 20:16:17,993 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 72 [2025-02-07 20:16:17,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:16:17,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:16:17,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:16:17,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:16:17,999 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:17" (1/1) ... [2025-02-07 20:16:17,999 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:17" (1/1) ... [2025-02-07 20:16:18,000 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:17" (1/1) ... [2025-02-07 20:16:18,006 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:18,007 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:17" (1/1) ... [2025-02-07 20:16:18,007 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:17" (1/1) ... [2025-02-07 20:16:18,008 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:17" (1/1) ... [2025-02-07 20:16:18,009 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:17" (1/1) ... [2025-02-07 20:16:18,009 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:17" (1/1) ... [2025-02-07 20:16:18,010 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:17" (1/1) ... [2025-02-07 20:16:18,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:16:18,011 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:16:18,011 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:16:18,011 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:16:18,012 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:17" (1/1) ... [2025-02-07 20:16:18,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:16:18,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:16:18,034 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:18,036 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:18,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:16:18,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:16:18,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:16:18,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:16:18,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-07 20:16:18,054 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-07 20:16:18,093 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:16:18,094 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:16:18,222 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-07 20:16:18,222 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:16:18,232 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:16:18,232 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:16:18,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:16:18 BoogieIcfgContainer [2025-02-07 20:16:18,233 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:16:18,234 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:16:18,234 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:16:18,238 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:16:18,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:16:17" (1/3) ... [2025-02-07 20:16:18,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@763bfe85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:16:18, skipping insertion in model container [2025-02-07 20:16:18,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:17" (2/3) ... [2025-02-07 20:16:18,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@763bfe85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:16:18, skipping insertion in model container [2025-02-07 20:16:18,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:16:18" (3/3) ... [2025-02-07 20:16:18,241 INFO L128 eAbstractionObserver]: Analyzing ICFG heapsort.i [2025-02-07 20:16:18,254 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:16:18,256 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG heapsort.i that has 2 procedures, 37 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-07 20:16:18,295 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:16:18,304 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;@7e8a8347, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:16:18,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:16:18,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 21 states have internal predecessors, (29), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-07 20:16:18,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 20:16:18,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:18,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:18,314 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:18,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:18,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1507356769, now seen corresponding path program 1 times [2025-02-07 20:16:18,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:18,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086850220] [2025-02-07 20:16:18,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:18,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:18,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 20:16:18,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 20:16:18,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:18,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:18,617 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:18,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:18,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086850220] [2025-02-07 20:16:18,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086850220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:18,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:18,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 20:16:18,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114363586] [2025-02-07 20:16:18,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:18,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:16:18,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:18,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:16:18,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:16:18,638 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 21 states have internal predecessors, (29), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:18,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:18,862 INFO L93 Difference]: Finished difference Result 108 states and 206 transitions. [2025-02-07 20:16:18,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:16:18,863 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-07 20:16:18,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:18,868 INFO L225 Difference]: With dead ends: 108 [2025-02-07 20:16:18,869 INFO L226 Difference]: Without dead ends: 72 [2025-02-07 20:16:18,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-07 20:16:18,874 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 41 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:18,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 224 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:16:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-07 20:16:18,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2025-02-07 20:16:18,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-07 20:16:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 95 transitions. [2025-02-07 20:16:18,911 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 95 transitions. Word has length 10 [2025-02-07 20:16:18,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:18,911 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 95 transitions. [2025-02-07 20:16:18,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:18,911 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 95 transitions. [2025-02-07 20:16:18,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 20:16:18,912 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:18,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:18,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:16:18,912 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:18,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:18,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1496989501, now seen corresponding path program 1 times [2025-02-07 20:16:18,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:18,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825184148] [2025-02-07 20:16:18,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:18,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:18,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 20:16:18,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 20:16:18,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:18,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:18,964 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:18,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:18,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825184148] [2025-02-07 20:16:18,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825184148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:18,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:18,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:16:18,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469094621] [2025-02-07 20:16:18,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:18,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:16:18,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:18,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:16:18,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:16:18,966 INFO L87 Difference]: Start difference. First operand 60 states and 95 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:18,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:18,986 INFO L93 Difference]: Finished difference Result 110 states and 178 transitions. [2025-02-07 20:16:18,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:16:18,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-07 20:16:18,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:18,988 INFO L225 Difference]: With dead ends: 110 [2025-02-07 20:16:18,988 INFO L226 Difference]: Without dead ends: 79 [2025-02-07 20:16:18,988 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:18,989 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 12 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:18,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 109 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:16:18,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-07 20:16:19,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-07 20:16:19,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-07 20:16:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 127 transitions. [2025-02-07 20:16:19,011 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 127 transitions. Word has length 10 [2025-02-07 20:16:19,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:19,011 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 127 transitions. [2025-02-07 20:16:19,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:19,011 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 127 transitions. [2025-02-07 20:16:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 20:16:19,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:19,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:19,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:16:19,012 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:19,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:19,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1495946816, now seen corresponding path program 1 times [2025-02-07 20:16:19,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:19,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753282056] [2025-02-07 20:16:19,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:19,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:19,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 20:16:19,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 20:16:19,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:19,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:19,082 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:19,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:19,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753282056] [2025-02-07 20:16:19,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753282056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:19,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:19,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:16:19,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376035152] [2025-02-07 20:16:19,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:19,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:16:19,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:19,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:16:19,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:16:19,085 INFO L87 Difference]: Start difference. First operand 79 states and 127 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:19,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:19,156 INFO L93 Difference]: Finished difference Result 85 states and 132 transitions. [2025-02-07 20:16:19,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:16:19,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-07 20:16:19,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:19,157 INFO L225 Difference]: With dead ends: 85 [2025-02-07 20:16:19,157 INFO L226 Difference]: Without dead ends: 83 [2025-02-07 20:16:19,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:19,158 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 16 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:19,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 142 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:19,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-07 20:16:19,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-02-07 20:16:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 states have internal predecessors, (58), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-07 20:16:19,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 130 transitions. [2025-02-07 20:16:19,177 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 130 transitions. Word has length 10 [2025-02-07 20:16:19,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:19,177 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 130 transitions. [2025-02-07 20:16:19,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:19,177 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 130 transitions. [2025-02-07 20:16:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 20:16:19,178 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:19,178 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:19,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:16:19,179 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:19,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:19,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1044800192, now seen corresponding path program 1 times [2025-02-07 20:16:19,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:19,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940827731] [2025-02-07 20:16:19,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:19,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:19,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 20:16:19,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 20:16:19,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:19,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:19,252 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:19,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:19,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940827731] [2025-02-07 20:16:19,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940827731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:19,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:19,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:16:19,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722601174] [2025-02-07 20:16:19,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:19,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:16:19,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:19,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:16:19,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:19,253 INFO L87 Difference]: Start difference. First operand 83 states and 130 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:19,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:19,371 INFO L93 Difference]: Finished difference Result 145 states and 229 transitions. [2025-02-07 20:16:19,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:16:19,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-07 20:16:19,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:19,374 INFO L225 Difference]: With dead ends: 145 [2025-02-07 20:16:19,374 INFO L226 Difference]: Without dead ends: 143 [2025-02-07 20:16:19,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:16:19,375 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 29 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:19,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 194 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:19,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-07 20:16:19,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2025-02-07 20:16:19,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-07 20:16:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 205 transitions. [2025-02-07 20:16:19,409 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 205 transitions. Word has length 10 [2025-02-07 20:16:19,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:19,409 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 205 transitions. [2025-02-07 20:16:19,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 205 transitions. [2025-02-07 20:16:19,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 20:16:19,410 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:19,410 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:19,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 20:16:19,411 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:19,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:19,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1852516780, now seen corresponding path program 1 times [2025-02-07 20:16:19,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:19,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452645017] [2025-02-07 20:16:19,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:19,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:19,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 20:16:19,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 20:16:19,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:19,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:19,465 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:19,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:19,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452645017] [2025-02-07 20:16:19,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452645017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:19,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:19,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:16:19,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274577681] [2025-02-07 20:16:19,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:19,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:16:19,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:19,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:16:19,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:16:19,468 INFO L87 Difference]: Start difference. First operand 128 states and 205 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:19,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:19,511 INFO L93 Difference]: Finished difference Result 144 states and 222 transitions. [2025-02-07 20:16:19,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:16:19,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 15 [2025-02-07 20:16:19,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:19,513 INFO L225 Difference]: With dead ends: 144 [2025-02-07 20:16:19,514 INFO L226 Difference]: Without dead ends: 108 [2025-02-07 20:16:19,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:19,515 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:19,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 133 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:16:19,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-07 20:16:19,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-07 20:16:19,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-07 20:16:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 172 transitions. [2025-02-07 20:16:19,543 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 172 transitions. Word has length 15 [2025-02-07 20:16:19,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:19,543 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 172 transitions. [2025-02-07 20:16:19,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:19,544 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 172 transitions. [2025-02-07 20:16:19,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 20:16:19,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:19,544 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:19,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 20:16:19,544 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:19,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:19,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1068125867, now seen corresponding path program 1 times [2025-02-07 20:16:19,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:19,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284075496] [2025-02-07 20:16:19,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:19,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:19,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 20:16:19,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 20:16:19,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:19,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:19,579 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:19,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:19,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284075496] [2025-02-07 20:16:19,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284075496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:19,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:19,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:16:19,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527100425] [2025-02-07 20:16:19,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:19,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:16:19,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:19,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:16:19,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:16:19,581 INFO L87 Difference]: Start difference. First operand 108 states and 172 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:19,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:19,656 INFO L93 Difference]: Finished difference Result 220 states and 351 transitions. [2025-02-07 20:16:19,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:16:19,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 15 [2025-02-07 20:16:19,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:19,658 INFO L225 Difference]: With dead ends: 220 [2025-02-07 20:16:19,658 INFO L226 Difference]: Without dead ends: 154 [2025-02-07 20:16:19,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:16:19,659 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 28 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:19,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 198 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:19,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-02-07 20:16:19,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 104. [2025-02-07 20:16:19,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-07 20:16:19,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 165 transitions. [2025-02-07 20:16:19,671 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 165 transitions. Word has length 15 [2025-02-07 20:16:19,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:19,671 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 165 transitions. [2025-02-07 20:16:19,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:19,671 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 165 transitions. [2025-02-07 20:16:19,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 20:16:19,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:19,672 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:19,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 20:16:19,672 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:19,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:19,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2145919787, now seen corresponding path program 1 times [2025-02-07 20:16:19,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:19,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032698246] [2025-02-07 20:16:19,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:19,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:19,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 20:16:19,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 20:16:19,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:19,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:19,723 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:19,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:19,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032698246] [2025-02-07 20:16:19,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032698246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:19,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:19,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:16:19,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286547309] [2025-02-07 20:16:19,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:19,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:16:19,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:19,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:16:19,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:19,724 INFO L87 Difference]: Start difference. First operand 104 states and 165 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:19,842 INFO L93 Difference]: Finished difference Result 162 states and 258 transitions. [2025-02-07 20:16:19,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:16:19,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 15 [2025-02-07 20:16:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:19,844 INFO L225 Difference]: With dead ends: 162 [2025-02-07 20:16:19,844 INFO L226 Difference]: Without dead ends: 160 [2025-02-07 20:16:19,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:16:19,845 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 25 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:19,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 236 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:19,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-07 20:16:19,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2025-02-07 20:16:19,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 65 states have (on average 1.353846153846154) internal successors, (88), 69 states have internal predecessors, (88), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-07 20:16:19,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 228 transitions. [2025-02-07 20:16:19,861 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 228 transitions. Word has length 15 [2025-02-07 20:16:19,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:19,861 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 228 transitions. [2025-02-07 20:16:19,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:19,862 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 228 transitions. [2025-02-07 20:16:19,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 20:16:19,862 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:19,862 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:19,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 20:16:19,862 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:19,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:19,863 INFO L85 PathProgramCache]: Analyzing trace with hash -778453694, now seen corresponding path program 1 times [2025-02-07 20:16:19,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:19,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301238084] [2025-02-07 20:16:19,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:19,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:19,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 20:16:19,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 20:16:19,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:19,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:19,917 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:19,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:19,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301238084] [2025-02-07 20:16:19,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301238084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:19,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:19,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:16:19,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80485341] [2025-02-07 20:16:19,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:19,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:16:19,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:19,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:16:19,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:19,919 INFO L87 Difference]: Start difference. First operand 140 states and 228 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (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:20,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:20,050 INFO L93 Difference]: Finished difference Result 202 states and 324 transitions. [2025-02-07 20:16:20,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:16:20,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (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 15 [2025-02-07 20:16:20,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:20,053 INFO L225 Difference]: With dead ends: 202 [2025-02-07 20:16:20,053 INFO L226 Difference]: Without dead ends: 200 [2025-02-07 20:16:20,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:16:20,054 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 31 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:20,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 185 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:20,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-07 20:16:20,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 180. [2025-02-07 20:16:20,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 87 states have internal predecessors, (106), 94 states have call successors, (94), 6 states have call predecessors, (94), 6 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-02-07 20:16:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 294 transitions. [2025-02-07 20:16:20,078 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 294 transitions. Word has length 15 [2025-02-07 20:16:20,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:20,078 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 294 transitions. [2025-02-07 20:16:20,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (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:20,078 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 294 transitions. [2025-02-07 20:16:20,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 20:16:20,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:20,079 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:20,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 20:16:20,079 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:20,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:20,079 INFO L85 PathProgramCache]: Analyzing trace with hash 194112391, now seen corresponding path program 1 times [2025-02-07 20:16:20,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:20,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047000083] [2025-02-07 20:16:20,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:20,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:20,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 20:16:20,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 20:16:20,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:20,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:20,149 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:20,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:20,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047000083] [2025-02-07 20:16:20,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047000083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:20,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:20,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 20:16:20,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618904287] [2025-02-07 20:16:20,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:20,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:16:20,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:20,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:16:20,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:16:20,150 INFO L87 Difference]: Start difference. First operand 180 states and 294 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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:20,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:20,258 INFO L93 Difference]: Finished difference Result 186 states and 299 transitions. [2025-02-07 20:16:20,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:16:20,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 15 [2025-02-07 20:16:20,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:20,259 INFO L225 Difference]: With dead ends: 186 [2025-02-07 20:16:20,260 INFO L226 Difference]: Without dead ends: 184 [2025-02-07 20:16:20,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-07 20:16:20,260 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 29 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:20,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 167 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:20,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-07 20:16:20,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-02-07 20:16:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 82 states have (on average 1.329268292682927) internal successors, (109), 90 states have internal predecessors, (109), 94 states have call successors, (94), 7 states have call predecessors, (94), 7 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-02-07 20:16:20,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 297 transitions. [2025-02-07 20:16:20,291 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 297 transitions. Word has length 15 [2025-02-07 20:16:20,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:20,291 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 297 transitions. [2025-02-07 20:16:20,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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:20,291 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 297 transitions. [2025-02-07 20:16:20,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 20:16:20,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:20,292 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:20,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 20:16:20,293 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:20,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:20,293 INFO L85 PathProgramCache]: Analyzing trace with hash 992200488, now seen corresponding path program 1 times [2025-02-07 20:16:20,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:20,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879936289] [2025-02-07 20:16:20,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:20,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:20,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 20:16:20,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 20:16:20,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:20,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:20,366 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:20,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:20,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879936289] [2025-02-07 20:16:20,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879936289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:20,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:20,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:16:20,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062242774] [2025-02-07 20:16:20,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:20,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:16:20,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:20,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:16:20,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:20,368 INFO L87 Difference]: Start difference. First operand 184 states and 297 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 20:16:20,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:20,490 INFO L93 Difference]: Finished difference Result 269 states and 440 transitions. [2025-02-07 20:16:20,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:16:20,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-02-07 20:16:20,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:20,494 INFO L225 Difference]: With dead ends: 269 [2025-02-07 20:16:20,494 INFO L226 Difference]: Without dead ends: 267 [2025-02-07 20:16:20,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:16:20,496 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 41 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:20,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 233 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:20,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-02-07 20:16:20,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 237. [2025-02-07 20:16:20,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 107 states have (on average 1.355140186915888) internal successors, (145), 121 states have internal predecessors, (145), 120 states have call successors, (120), 9 states have call predecessors, (120), 9 states have return successors, (120), 106 states have call predecessors, (120), 120 states have call successors, (120) [2025-02-07 20:16:20,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 385 transitions. [2025-02-07 20:16:20,537 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 385 transitions. Word has length 22 [2025-02-07 20:16:20,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:20,537 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 385 transitions. [2025-02-07 20:16:20,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 20:16:20,537 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 385 transitions. [2025-02-07 20:16:20,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 20:16:20,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:20,539 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:20,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 20:16:20,539 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:20,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:20,540 INFO L85 PathProgramCache]: Analyzing trace with hash 267357411, now seen corresponding path program 1 times [2025-02-07 20:16:20,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:20,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216970358] [2025-02-07 20:16:20,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:20,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:20,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 20:16:20,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 20:16:20,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:20,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 20:16:20,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:20,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216970358] [2025-02-07 20:16:20,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216970358] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:20,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:20,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:16:20,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637848427] [2025-02-07 20:16:20,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:20,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:16:20,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:20,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:16:20,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:16:20,590 INFO L87 Difference]: Start difference. First operand 237 states and 385 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 20:16:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:20,846 INFO L93 Difference]: Finished difference Result 555 states and 903 transitions. [2025-02-07 20:16:20,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:16:20,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-02-07 20:16:20,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:20,849 INFO L225 Difference]: With dead ends: 555 [2025-02-07 20:16:20,849 INFO L226 Difference]: Without dead ends: 378 [2025-02-07 20:16:20,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:16:20,850 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 86 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:20,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 91 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:16:20,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-02-07 20:16:20,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 238. [2025-02-07 20:16:20,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 108 states have (on average 1.3425925925925926) internal successors, (145), 122 states have internal predecessors, (145), 120 states have call successors, (120), 9 states have call predecessors, (120), 9 states have return successors, (120), 106 states have call predecessors, (120), 120 states have call successors, (120) [2025-02-07 20:16:20,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 385 transitions. [2025-02-07 20:16:20,903 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 385 transitions. Word has length 24 [2025-02-07 20:16:20,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:20,904 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 385 transitions. [2025-02-07 20:16:20,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 20:16:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 385 transitions. [2025-02-07 20:16:20,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-07 20:16:20,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:20,905 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:20,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 20:16:20,905 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:20,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:20,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1519563075, now seen corresponding path program 1 times [2025-02-07 20:16:20,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:20,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848300259] [2025-02-07 20:16:20,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:20,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:20,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-07 20:16:20,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-07 20:16:20,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:20,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:21,012 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 20:16:21,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:21,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848300259] [2025-02-07 20:16:21,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848300259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:21,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:21,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 20:16:21,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116674893] [2025-02-07 20:16:21,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:21,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:16:21,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:21,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:16:21,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:16:21,013 INFO L87 Difference]: Start difference. First operand 238 states and 385 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 20:16:21,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:21,188 INFO L93 Difference]: Finished difference Result 344 states and 570 transitions. [2025-02-07 20:16:21,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:16:21,188 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-02-07 20:16:21,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:21,194 INFO L225 Difference]: With dead ends: 344 [2025-02-07 20:16:21,195 INFO L226 Difference]: Without dead ends: 342 [2025-02-07 20:16:21,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-07 20:16:21,195 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 38 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:21,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 173 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:21,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-02-07 20:16:21,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 298. [2025-02-07 20:16:21,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 129 states have (on average 1.3643410852713178) internal successors, (176), 149 states have internal predecessors, (176), 158 states have call successors, (158), 10 states have call predecessors, (158), 10 states have return successors, (158), 138 states have call predecessors, (158), 158 states have call successors, (158) [2025-02-07 20:16:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 492 transitions. [2025-02-07 20:16:21,254 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 492 transitions. Word has length 27 [2025-02-07 20:16:21,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:21,254 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 492 transitions. [2025-02-07 20:16:21,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 20:16:21,254 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 492 transitions. [2025-02-07 20:16:21,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-07 20:16:21,255 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:21,255 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:21,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 20:16:21,255 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:21,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:21,256 INFO L85 PathProgramCache]: Analyzing trace with hash -992836019, now seen corresponding path program 1 times [2025-02-07 20:16:21,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:21,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925690441] [2025-02-07 20:16:21,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:21,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:21,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-07 20:16:21,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-07 20:16:21,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:21,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:21,331 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-07 20:16:21,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:21,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925690441] [2025-02-07 20:16:21,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925690441] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:21,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:21,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 20:16:21,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000624810] [2025-02-07 20:16:21,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:21,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:16:21,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:21,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:16:21,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:16:21,332 INFO L87 Difference]: Start difference. First operand 298 states and 492 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 20:16:21,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:21,487 INFO L93 Difference]: Finished difference Result 340 states and 549 transitions. [2025-02-07 20:16:21,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:16:21,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2025-02-07 20:16:21,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:21,489 INFO L225 Difference]: With dead ends: 340 [2025-02-07 20:16:21,489 INFO L226 Difference]: Without dead ends: 338 [2025-02-07 20:16:21,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-07 20:16:21,490 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 36 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:21,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 230 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:21,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-02-07 20:16:21,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 242. [2025-02-07 20:16:21,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 113 states have (on average 1.345132743362832) internal successors, (152), 125 states have internal predecessors, (152), 118 states have call successors, (118), 10 states have call predecessors, (118), 10 states have return successors, (118), 106 states have call predecessors, (118), 118 states have call successors, (118) [2025-02-07 20:16:21,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 388 transitions. [2025-02-07 20:16:21,524 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 388 transitions. Word has length 37 [2025-02-07 20:16:21,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:21,524 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 388 transitions. [2025-02-07 20:16:21,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 20:16:21,524 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 388 transitions. [2025-02-07 20:16:21,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-07 20:16:21,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:21,525 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:21,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 20:16:21,526 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:21,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:21,526 INFO L85 PathProgramCache]: Analyzing trace with hash -2067353783, now seen corresponding path program 1 times [2025-02-07 20:16:21,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:21,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312840728] [2025-02-07 20:16:21,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:21,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:21,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-07 20:16:21,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-07 20:16:21,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:21,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:21,597 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:16:21,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:21,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312840728] [2025-02-07 20:16:21,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312840728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:21,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:21,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 20:16:21,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562983993] [2025-02-07 20:16:21,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:21,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:16:21,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:21,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:16:21,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:16:21,600 INFO L87 Difference]: Start difference. First operand 242 states and 388 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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:21,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:21,715 INFO L93 Difference]: Finished difference Result 264 states and 417 transitions. [2025-02-07 20:16:21,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:16:21,715 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 37 [2025-02-07 20:16:21,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:21,718 INFO L225 Difference]: With dead ends: 264 [2025-02-07 20:16:21,718 INFO L226 Difference]: Without dead ends: 262 [2025-02-07 20:16:21,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-07 20:16:21,718 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 29 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:21,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 133 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:21,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-02-07 20:16:21,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 246. [2025-02-07 20:16:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 116 states have (on average 1.3362068965517242) internal successors, (155), 128 states have internal predecessors, (155), 118 states have call successors, (118), 11 states have call predecessors, (118), 11 states have return successors, (118), 106 states have call predecessors, (118), 118 states have call successors, (118) [2025-02-07 20:16:21,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 391 transitions. [2025-02-07 20:16:21,753 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 391 transitions. Word has length 37 [2025-02-07 20:16:21,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:21,753 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 391 transitions. [2025-02-07 20:16:21,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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:21,754 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 391 transitions. [2025-02-07 20:16:21,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-07 20:16:21,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:21,755 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:21,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 20:16:21,755 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:21,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:21,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1269861937, now seen corresponding path program 1 times [2025-02-07 20:16:21,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:21,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675065174] [2025-02-07 20:16:21,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:21,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:21,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-07 20:16:21,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-07 20:16:21,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:21,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:21,823 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 20:16:21,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:21,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675065174] [2025-02-07 20:16:21,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675065174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:21,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:21,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 20:16:21,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111189365] [2025-02-07 20:16:21,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:21,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:16:21,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:21,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:16:21,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:16:21,825 INFO L87 Difference]: Start difference. First operand 246 states and 391 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-07 20:16:21,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:21,932 INFO L93 Difference]: Finished difference Result 288 states and 456 transitions. [2025-02-07 20:16:21,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:16:21,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 49 [2025-02-07 20:16:21,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:21,935 INFO L225 Difference]: With dead ends: 288 [2025-02-07 20:16:21,935 INFO L226 Difference]: Without dead ends: 286 [2025-02-07 20:16:21,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-07 20:16:21,936 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 38 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:21,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 196 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:21,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-02-07 20:16:21,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 145. [2025-02-07 20:16:21,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 80 states have internal predecessors, (94), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-07 20:16:21,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 214 transitions. [2025-02-07 20:16:21,961 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 214 transitions. Word has length 49 [2025-02-07 20:16:21,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:21,961 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 214 transitions. [2025-02-07 20:16:21,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-07 20:16:21,961 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 214 transitions. [2025-02-07 20:16:21,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-07 20:16:21,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:21,962 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:21,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 20:16:21,962 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:21,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:21,963 INFO L85 PathProgramCache]: Analyzing trace with hash 91170945, now seen corresponding path program 1 times [2025-02-07 20:16:21,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:21,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799240621] [2025-02-07 20:16:21,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:21,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:21,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-07 20:16:21,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-07 20:16:21,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:21,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:22,036 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-07 20:16:22,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:22,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799240621] [2025-02-07 20:16:22,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799240621] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:16:22,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321806329] [2025-02-07 20:16:22,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:22,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:16:22,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:16:22,040 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:22,042 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:22,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-07 20:16:22,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-07 20:16:22,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:22,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:22,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 20:16:22,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:16:22,183 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-07 20:16:22,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:16:22,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321806329] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:22,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 20:16:22,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2025-02-07 20:16:22,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834939492] [2025-02-07 20:16:22,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:22,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:16:22,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:22,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:16:22,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-07 20:16:22,185 INFO L87 Difference]: Start difference. First operand 145 states and 214 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-07 20:16:22,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:22,354 INFO L93 Difference]: Finished difference Result 436 states and 687 transitions. [2025-02-07 20:16:22,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:16:22,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2025-02-07 20:16:22,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:22,358 INFO L225 Difference]: With dead ends: 436 [2025-02-07 20:16:22,358 INFO L226 Difference]: Without dead ends: 294 [2025-02-07 20:16:22,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-07 20:16:22,359 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 42 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:22,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 135 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:22,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-02-07 20:16:22,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 274. [2025-02-07 20:16:22,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 125 states have (on average 1.344) internal successors, (168), 139 states have internal predecessors, (168), 138 states have call successors, (138), 10 states have call predecessors, (138), 10 states have return successors, (138), 124 states have call predecessors, (138), 138 states have call successors, (138) [2025-02-07 20:16:22,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 444 transitions. [2025-02-07 20:16:22,410 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 444 transitions. Word has length 57 [2025-02-07 20:16:22,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:22,411 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 444 transitions. [2025-02-07 20:16:22,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-07 20:16:22,411 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 444 transitions. [2025-02-07 20:16:22,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-07 20:16:22,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:22,412 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:22,418 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:22,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-07 20:16:22,613 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:22,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:22,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1402178612, now seen corresponding path program 1 times [2025-02-07 20:16:22,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:22,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701917402] [2025-02-07 20:16:22,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:22,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:22,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-07 20:16:22,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-07 20:16:22,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:22,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-07 20:16:22,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:22,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701917402] [2025-02-07 20:16:22,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701917402] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:16:22,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117914329] [2025-02-07 20:16:22,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:22,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:16:22,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:16:22,711 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:22,713 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:22,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-07 20:16:22,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-07 20:16:22,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:22,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:22,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-07 20:16:22,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:16:22,928 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-02-07 20:16:22,929 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:16:22,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117914329] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:22,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 20:16:22,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-02-07 20:16:22,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662024857] [2025-02-07 20:16:22,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:22,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:16:22,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:22,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:16:22,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-07 20:16:22,929 INFO L87 Difference]: Start difference. First operand 274 states and 444 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-07 20:16:23,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:23,142 INFO L93 Difference]: Finished difference Result 517 states and 824 transitions. [2025-02-07 20:16:23,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 20:16:23,143 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 79 [2025-02-07 20:16:23,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:23,146 INFO L225 Difference]: With dead ends: 517 [2025-02-07 20:16:23,146 INFO L226 Difference]: Without dead ends: 273 [2025-02-07 20:16:23,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-02-07 20:16:23,148 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 30 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:23,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 176 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:23,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-02-07 20:16:23,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 222. [2025-02-07 20:16:23,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 109 states have (on average 1.3027522935779816) internal successors, (142), 117 states have internal predecessors, (142), 102 states have call successors, (102), 10 states have call predecessors, (102), 10 states have return successors, (102), 94 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-07 20:16:23,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 346 transitions. [2025-02-07 20:16:23,197 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 346 transitions. Word has length 79 [2025-02-07 20:16:23,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:23,197 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 346 transitions. [2025-02-07 20:16:23,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-07 20:16:23,198 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 346 transitions. [2025-02-07 20:16:23,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-07 20:16:23,199 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:23,199 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:23,205 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:23,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-07 20:16:23,400 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:23,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:23,400 INFO L85 PathProgramCache]: Analyzing trace with hash -633008597, now seen corresponding path program 1 times [2025-02-07 20:16:23,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:23,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966391503] [2025-02-07 20:16:23,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:23,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:23,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-07 20:16:23,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-07 20:16:23,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:23,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:23,504 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-07 20:16:23,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:23,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966391503] [2025-02-07 20:16:23,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966391503] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:16:23,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323866503] [2025-02-07 20:16:23,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:23,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:16:23,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:16:23,506 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:23,508 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:23,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-07 20:16:23,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-07 20:16:23,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:23,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:23,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 20:16:23,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:16:23,690 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-02-07 20:16:23,690 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:16:23,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323866503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:23,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 20:16:23,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2025-02-07 20:16:23,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105452735] [2025-02-07 20:16:23,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:23,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:16:23,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:23,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:16:23,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:16:23,692 INFO L87 Difference]: Start difference. First operand 222 states and 346 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-07 20:16:23,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:23,826 INFO L93 Difference]: Finished difference Result 415 states and 641 transitions. [2025-02-07 20:16:23,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:16:23,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2025-02-07 20:16:23,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:23,828 INFO L225 Difference]: With dead ends: 415 [2025-02-07 20:16:23,828 INFO L226 Difference]: Without dead ends: 183 [2025-02-07 20:16:23,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-07 20:16:23,829 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 21 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:23,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 128 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:23,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-07 20:16:23,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 173. [2025-02-07 20:16:23,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 93 states have internal predecessors, (110), 76 states have call successors, (76), 10 states have call predecessors, (76), 10 states have return successors, (76), 69 states have call predecessors, (76), 76 states have call successors, (76) [2025-02-07 20:16:23,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 262 transitions. [2025-02-07 20:16:23,853 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 262 transitions. Word has length 79 [2025-02-07 20:16:23,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:23,853 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 262 transitions. [2025-02-07 20:16:23,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-07 20:16:23,854 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 262 transitions. [2025-02-07 20:16:23,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-07 20:16:23,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:23,855 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:23,860 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:24,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:16:24,059 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:24,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:24,059 INFO L85 PathProgramCache]: Analyzing trace with hash 74317016, now seen corresponding path program 1 times [2025-02-07 20:16:24,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:24,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740823376] [2025-02-07 20:16:24,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:24,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:24,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-07 20:16:24,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-07 20:16:24,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:24,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:24,156 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 37 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-07 20:16:24,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:24,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740823376] [2025-02-07 20:16:24,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740823376] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:16:24,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523990701] [2025-02-07 20:16:24,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:24,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:16:24,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:16:24,158 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:16:24,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 20:16:24,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-07 20:16:24,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-07 20:16:24,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:24,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:24,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 20:16:24,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:16:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-02-07 20:16:24,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:16:24,390 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-02-07 20:16:24,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523990701] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:16:24,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:16:24,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2025-02-07 20:16:24,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772163155] [2025-02-07 20:16:24,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:16:24,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-07 20:16:24,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:24,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-07 20:16:24,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-02-07 20:16:24,391 INFO L87 Difference]: Start difference. First operand 173 states and 262 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 7 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2025-02-07 20:16:25,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:25,340 INFO L93 Difference]: Finished difference Result 459 states and 695 transitions. [2025-02-07 20:16:25,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-07 20:16:25,340 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 7 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) Word has length 84 [2025-02-07 20:16:25,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:25,342 INFO L225 Difference]: With dead ends: 459 [2025-02-07 20:16:25,342 INFO L226 Difference]: Without dead ends: 317 [2025-02-07 20:16:25,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=488, Invalid=1492, Unknown=0, NotChecked=0, Total=1980 [2025-02-07 20:16:25,343 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 187 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:25,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1017 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 20:16:25,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-07 20:16:25,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 183. [2025-02-07 20:16:25,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 93 states have (on average 1.2473118279569892) internal successors, (116), 100 states have internal predecessors, (116), 78 states have call successors, (78), 11 states have call predecessors, (78), 11 states have return successors, (78), 71 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-07 20:16:25,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 272 transitions. [2025-02-07 20:16:25,372 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 272 transitions. Word has length 84 [2025-02-07 20:16:25,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:25,372 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 272 transitions. [2025-02-07 20:16:25,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 7 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2025-02-07 20:16:25,372 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 272 transitions. [2025-02-07 20:16:25,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-07 20:16:25,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:25,373 INFO L218 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:25,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 20:16:25,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:16:25,573 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:16:25,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:25,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1827243928, now seen corresponding path program 1 times [2025-02-07 20:16:25,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:25,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364347715] [2025-02-07 20:16:25,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:25,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:25,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-07 20:16:25,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-07 20:16:25,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:25,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 15 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-02-07 20:16:25,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:25,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364347715] [2025-02-07 20:16:25,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364347715] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:16:25,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88150857] [2025-02-07 20:16:25,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:25,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:16:25,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:16:25,694 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:16:25,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 20:16:25,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-07 20:16:25,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-07 20:16:25,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:25,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:25,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 20:16:25,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:16:25,907 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 210 proven. 7 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-02-07 20:16:25,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:16:26,083 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 47 proven. 8 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-07 20:16:26,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88150857] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:16:26,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:16:26,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2025-02-07 20:16:26,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764423281] [2025-02-07 20:16:26,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:16:26,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-07 20:16:26,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:26,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-07 20:16:26,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-02-07 20:16:26,086 INFO L87 Difference]: Start difference. First operand 183 states and 272 transitions. Second operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 11 states have call successors, (51), 3 states have call predecessors, (51), 2 states have return successors, (49), 11 states have call predecessors, (49), 11 states have call successors, (49) [2025-02-07 20:16:28,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:28,248 INFO L93 Difference]: Finished difference Result 733 states and 1151 transitions. [2025-02-07 20:16:28,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-02-07 20:16:28,249 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 11 states have call successors, (51), 3 states have call predecessors, (51), 2 states have return successors, (49), 11 states have call predecessors, (49), 11 states have call successors, (49) Word has length 111 [2025-02-07 20:16:28,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:28,249 INFO L225 Difference]: With dead ends: 733 [2025-02-07 20:16:28,249 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 20:16:28,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1726 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1249, Invalid=4757, Unknown=0, NotChecked=0, Total=6006 [2025-02-07 20:16:28,252 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 496 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 699 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 699 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:28,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 1139 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [699 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 20:16:28,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 20:16:28,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 20:16:28,253 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:28,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 20:16:28,253 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 111 [2025-02-07 20:16:28,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:28,253 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 20:16:28,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 11 states have call successors, (51), 3 states have call predecessors, (51), 2 states have return successors, (49), 11 states have call predecessors, (49), 11 states have call successors, (49) [2025-02-07 20:16:28,253 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 20:16:28,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 20:16:28,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 20:16:28,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-07 20:16:28,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:16:28,458 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:28,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.