./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Huffman_dec.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/hardware-verification-bv/btor2c-lazyMod.Huffman_dec.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 3b0071c78088f9c96f862cb661d2ce94895d7fb3336b3cc889e5292b345efcdd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 18:05:13,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 18:05:13,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 18:05:13,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 18:05:13,851 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 18:05:13,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 18:05:13,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 18:05:13,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 18:05:13,872 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 18:05:13,872 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 18:05:13,872 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 18:05:13,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 18:05:13,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 18:05:13,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 18:05:13,873 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 18:05:13,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 18:05:13,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 18:05:13,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 18:05:13,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 18:05:13,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 18:05:13,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 18:05:13,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 18:05:13,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 18:05:13,874 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 18:05:13,874 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 18:05:13,874 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 18:05:13,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 18:05:13,875 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 18:05:13,875 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 18:05:13,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:05:13,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 18:05:13,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 18:05:13,875 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 18:05:13,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 18:05:13,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 18:05:13,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 18:05:13,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 18:05:13,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 18:05:13,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 18:05:13,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 18:05:13,875 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3b0071c78088f9c96f862cb661d2ce94895d7fb3336b3cc889e5292b345efcdd [2025-02-05 18:05:14,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 18:05:14,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 18:05:14,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 18:05:14,178 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 18:05:14,179 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 18:05:14,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Huffman_dec.c [2025-02-05 18:05:15,501 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e18849b3d/a5e5a82175c548778184da280663d0ef/FLAGb9346056c [2025-02-05 18:05:15,860 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 18:05:15,860 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Huffman_dec.c [2025-02-05 18:05:15,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e18849b3d/a5e5a82175c548778184da280663d0ef/FLAGb9346056c [2025-02-05 18:05:16,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e18849b3d/a5e5a82175c548778184da280663d0ef [2025-02-05 18:05:16,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 18:05:16,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 18:05:16,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 18:05:16,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 18:05:16,113 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 18:05:16,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:05:16" (1/1) ... [2025-02-05 18:05:16,118 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1af708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:16, skipping insertion in model container [2025-02-05 18:05:16,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:05:16" (1/1) ... [2025-02-05 18:05:16,181 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 18:05:16,397 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/hardware-verification-bv/btor2c-lazyMod.Huffman_dec.c[1251,1264] [2025-02-05 18:05:16,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:05:16,716 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 18:05:16,723 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/hardware-verification-bv/btor2c-lazyMod.Huffman_dec.c[1251,1264] [2025-02-05 18:05:16,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:05:16,810 INFO L204 MainTranslator]: Completed translation [2025-02-05 18:05:16,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:16 WrapperNode [2025-02-05 18:05:16,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 18:05:16,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 18:05:16,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 18:05:16,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 18:05:16,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:16" (1/1) ... [2025-02-05 18:05:16,840 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:16" (1/1) ... [2025-02-05 18:05:16,929 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1334 [2025-02-05 18:05:16,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 18:05:16,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 18:05:16,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 18:05:16,931 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 18:05:16,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:16" (1/1) ... [2025-02-05 18:05:16,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:16" (1/1) ... [2025-02-05 18:05:16,961 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:16" (1/1) ... [2025-02-05 18:05:17,013 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-05 18:05:17,014 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:16" (1/1) ... [2025-02-05 18:05:17,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:16" (1/1) ... [2025-02-05 18:05:17,055 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:16" (1/1) ... [2025-02-05 18:05:17,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:16" (1/1) ... [2025-02-05 18:05:17,074 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:16" (1/1) ... [2025-02-05 18:05:17,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:16" (1/1) ... [2025-02-05 18:05:17,168 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 18:05:17,170 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 18:05:17,170 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 18:05:17,170 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 18:05:17,170 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:16" (1/1) ... [2025-02-05 18:05:17,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:05:17,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:05:17,194 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-05 18:05:17,196 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-05 18:05:17,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 18:05:17,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 18:05:17,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 18:05:17,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 18:05:17,360 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 18:05:17,361 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 18:05:18,701 INFO L? ?]: Removed 791 outVars from TransFormulas that were not future-live. [2025-02-05 18:05:18,701 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 18:05:18,740 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 18:05:18,741 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 18:05:18,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:05:18 BoogieIcfgContainer [2025-02-05 18:05:18,741 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 18:05:18,743 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 18:05:18,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 18:05:18,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 18:05:18,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 06:05:16" (1/3) ... [2025-02-05 18:05:18,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bcd002a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:05:18, skipping insertion in model container [2025-02-05 18:05:18,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:16" (2/3) ... [2025-02-05 18:05:18,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bcd002a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:05:18, skipping insertion in model container [2025-02-05 18:05:18,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:05:18" (3/3) ... [2025-02-05 18:05:18,748 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.Huffman_dec.c [2025-02-05 18:05:18,759 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 18:05:18,761 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.Huffman_dec.c that has 1 procedures, 290 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 18:05:18,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 18:05:18,808 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;@6d8bb74e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 18:05:18,808 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 18:05:18,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 290 states, 288 states have (on average 1.4965277777777777) internal successors, (431), 289 states have internal predecessors, (431), 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-05 18:05:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 18:05:18,818 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:18,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:05:18,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:18,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:18,823 INFO L85 PathProgramCache]: Analyzing trace with hash -910901466, now seen corresponding path program 1 times [2025-02-05 18:05:18,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:18,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7619776] [2025-02-05 18:05:18,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:18,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:18,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 18:05:19,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 18:05:19,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:19,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:20,190 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-05 18:05:20,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:20,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7619776] [2025-02-05 18:05:20,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7619776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:20,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:20,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:20,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564998340] [2025-02-05 18:05:20,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:20,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:20,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:20,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:20,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:20,215 INFO L87 Difference]: Start difference. First operand has 290 states, 288 states have (on average 1.4965277777777777) internal successors, (431), 289 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-05 18:05:20,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:20,455 INFO L93 Difference]: Finished difference Result 569 states and 849 transitions. [2025-02-05 18:05:20,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:20,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-05 18:05:20,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:20,464 INFO L225 Difference]: With dead ends: 569 [2025-02-05 18:05:20,464 INFO L226 Difference]: Without dead ends: 289 [2025-02-05 18:05:20,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:20,469 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 0 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:20,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1060 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:05:20,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-02-05 18:05:20,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2025-02-05 18:05:20,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.4895833333333333) internal successors, (429), 288 states have internal predecessors, (429), 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-05 18:05:20,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 429 transitions. [2025-02-05 18:05:20,500 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 429 transitions. Word has length 71 [2025-02-05 18:05:20,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:20,500 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 429 transitions. [2025-02-05 18:05:20,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-05 18:05:20,501 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 429 transitions. [2025-02-05 18:05:20,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 18:05:20,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:20,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:05:20,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 18:05:20,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:20,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:20,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1831505030, now seen corresponding path program 1 times [2025-02-05 18:05:20,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:20,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791820648] [2025-02-05 18:05:20,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:20,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:20,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 18:05:20,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 18:05:20,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:20,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:20,946 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-05 18:05:20,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:20,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791820648] [2025-02-05 18:05:20,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791820648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:20,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:20,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:20,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030276343] [2025-02-05 18:05:20,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:20,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:20,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:20,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:20,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:20,948 INFO L87 Difference]: Start difference. First operand 289 states and 429 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-05 18:05:21,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:21,115 INFO L93 Difference]: Finished difference Result 570 states and 847 transitions. [2025-02-05 18:05:21,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:21,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-05 18:05:21,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:21,118 INFO L225 Difference]: With dead ends: 570 [2025-02-05 18:05:21,118 INFO L226 Difference]: Without dead ends: 291 [2025-02-05 18:05:21,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:21,119 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 0 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:21,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1057 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 18:05:21,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-02-05 18:05:21,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2025-02-05 18:05:21,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.486206896551724) internal successors, (431), 290 states have internal predecessors, (431), 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-05 18:05:21,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 431 transitions. [2025-02-05 18:05:21,129 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 431 transitions. Word has length 72 [2025-02-05 18:05:21,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:21,129 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 431 transitions. [2025-02-05 18:05:21,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-05 18:05:21,129 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 431 transitions. [2025-02-05 18:05:21,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 18:05:21,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:21,131 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:05:21,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 18:05:21,131 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:21,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:21,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1421376735, now seen corresponding path program 1 times [2025-02-05 18:05:21,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:21,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645799797] [2025-02-05 18:05:21,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:21,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:21,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 18:05:21,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 18:05:21,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:21,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:22,141 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-05 18:05:22,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:22,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645799797] [2025-02-05 18:05:22,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645799797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:22,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:22,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 18:05:22,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447122067] [2025-02-05 18:05:22,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:22,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:05:22,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:22,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:05:22,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:05:22,143 INFO L87 Difference]: Start difference. First operand 291 states and 431 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-05 18:05:22,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:22,376 INFO L93 Difference]: Finished difference Result 574 states and 851 transitions. [2025-02-05 18:05:22,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:05:22,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-02-05 18:05:22,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:22,378 INFO L225 Difference]: With dead ends: 574 [2025-02-05 18:05:22,378 INFO L226 Difference]: Without dead ends: 293 [2025-02-05 18:05:22,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:05:22,379 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 365 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:22,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1407 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:05:22,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-02-05 18:05:22,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-02-05 18:05:22,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.4828767123287672) internal successors, (433), 292 states have internal predecessors, (433), 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-05 18:05:22,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 433 transitions. [2025-02-05 18:05:22,393 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 433 transitions. Word has length 73 [2025-02-05 18:05:22,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:22,394 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 433 transitions. [2025-02-05 18:05:22,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-05 18:05:22,394 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 433 transitions. [2025-02-05 18:05:22,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 18:05:22,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:22,395 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:05:22,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 18:05:22,396 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:22,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:22,396 INFO L85 PathProgramCache]: Analyzing trace with hash 775356939, now seen corresponding path program 1 times [2025-02-05 18:05:22,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:22,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51342984] [2025-02-05 18:05:22,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:22,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:22,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 18:05:22,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 18:05:22,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:22,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:29,951 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-05 18:05:29,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:29,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51342984] [2025-02-05 18:05:29,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51342984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:29,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:29,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:05:29,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323801792] [2025-02-05 18:05:29,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:29,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:05:29,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:29,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:05:29,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:05:29,955 INFO L87 Difference]: Start difference. First operand 293 states and 433 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-05 18:05:31,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:31,056 INFO L93 Difference]: Finished difference Result 576 states and 852 transitions. [2025-02-05 18:05:31,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:31,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-02-05 18:05:31,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:31,058 INFO L225 Difference]: With dead ends: 576 [2025-02-05 18:05:31,058 INFO L226 Difference]: Without dead ends: 293 [2025-02-05 18:05:31,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:05:31,060 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 365 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:31,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 615 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:05:31,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-02-05 18:05:31,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-02-05 18:05:31,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.4794520547945205) internal successors, (432), 292 states have internal predecessors, (432), 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-05 18:05:31,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 432 transitions. [2025-02-05 18:05:31,070 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 432 transitions. Word has length 74 [2025-02-05 18:05:31,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:31,070 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 432 transitions. [2025-02-05 18:05:31,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-05 18:05:31,070 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 432 transitions. [2025-02-05 18:05:31,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 18:05:31,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:31,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:05:31,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 18:05:31,072 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:31,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:31,073 INFO L85 PathProgramCache]: Analyzing trace with hash 264352967, now seen corresponding path program 1 times [2025-02-05 18:05:31,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:31,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525066552] [2025-02-05 18:05:31,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:31,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:31,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 18:05:31,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 18:05:31,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:31,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:50,068 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-05 18:05:50,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:50,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525066552] [2025-02-05 18:05:50,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525066552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:50,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:50,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2025-02-05 18:05:50,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334446665] [2025-02-05 18:05:50,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:50,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-02-05 18:05:50,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:50,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-02-05 18:05:50,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=3054, Unknown=0, NotChecked=0, Total=3192 [2025-02-05 18:05:50,076 INFO L87 Difference]: Start difference. First operand 293 states and 432 transitions. Second operand has 57 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 57 states have internal predecessors, (75), 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-05 18:06:04,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:04,112 INFO L93 Difference]: Finished difference Result 2008 states and 2985 transitions. [2025-02-05 18:06:04,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-02-05 18:06:04,112 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 57 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-05 18:06:04,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:04,121 INFO L225 Difference]: With dead ends: 2008 [2025-02-05 18:06:04,121 INFO L226 Difference]: Without dead ends: 1725 [2025-02-05 18:06:04,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2107 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=1702, Invalid=10288, Unknown=0, NotChecked=0, Total=11990 [2025-02-05 18:06:04,127 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 7552 mSDsluCounter, 17033 mSDsCounter, 0 mSdLazyCounter, 6620 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7552 SdHoareTripleChecker+Valid, 17353 SdHoareTripleChecker+Invalid, 6620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:04,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7552 Valid, 17353 Invalid, 6620 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 6620 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-02-05 18:06:04,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725 states. [2025-02-05 18:06:04,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725 to 347. [2025-02-05 18:06:04,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.4797687861271676) internal successors, (512), 346 states have internal predecessors, (512), 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-05 18:06:04,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 512 transitions. [2025-02-05 18:06:04,156 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 512 transitions. Word has length 75 [2025-02-05 18:06:04,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:04,156 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 512 transitions. [2025-02-05 18:06:04,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 57 states have internal predecessors, (75), 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-05 18:06:04,156 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 512 transitions. [2025-02-05 18:06:04,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:04,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:04,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:04,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 18:06:04,158 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:04,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:04,163 INFO L85 PathProgramCache]: Analyzing trace with hash -931528508, now seen corresponding path program 1 times [2025-02-05 18:06:04,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:04,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827854868] [2025-02-05 18:06:04,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:04,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:04,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:04,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:04,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:04,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:04,382 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-05 18:06:04,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:04,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827854868] [2025-02-05 18:06:04,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827854868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:04,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:04,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:04,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5936354] [2025-02-05 18:06:04,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:04,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:04,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:04,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:04,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:04,387 INFO L87 Difference]: Start difference. First operand 347 states and 512 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:04,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:04,605 INFO L93 Difference]: Finished difference Result 875 states and 1289 transitions. [2025-02-05 18:06:04,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:04,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:04,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:04,608 INFO L225 Difference]: With dead ends: 875 [2025-02-05 18:06:04,608 INFO L226 Difference]: Without dead ends: 538 [2025-02-05 18:06:04,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:04,609 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 794 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:04,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:06:04,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-02-05 18:06:04,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 377. [2025-02-05 18:06:04,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 1.476063829787234) internal successors, (555), 376 states have internal predecessors, (555), 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-05 18:06:04,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 555 transitions. [2025-02-05 18:06:04,623 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 555 transitions. Word has length 76 [2025-02-05 18:06:04,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:04,623 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 555 transitions. [2025-02-05 18:06:04,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:04,624 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 555 transitions. [2025-02-05 18:06:04,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:04,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:04,627 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:04,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 18:06:04,628 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:04,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:04,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1764455226, now seen corresponding path program 1 times [2025-02-05 18:06:04,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:04,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787532009] [2025-02-05 18:06:04,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:04,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:04,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:04,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:04,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:04,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:04,819 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-05 18:06:04,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:04,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787532009] [2025-02-05 18:06:04,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787532009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:04,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:04,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:04,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241900152] [2025-02-05 18:06:04,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:04,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:04,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:04,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:04,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:04,820 INFO L87 Difference]: Start difference. First operand 377 states and 555 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:05,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:05,282 INFO L93 Difference]: Finished difference Result 873 states and 1284 transitions. [2025-02-05 18:06:05,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:05,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:05,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:05,298 INFO L225 Difference]: With dead ends: 873 [2025-02-05 18:06:05,298 INFO L226 Difference]: Without dead ends: 536 [2025-02-05 18:06:05,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:05,303 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 782 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:05,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:06:05,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-02-05 18:06:05,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 387. [2025-02-05 18:06:05,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 386 states have (on average 1.471502590673575) internal successors, (568), 386 states have internal predecessors, (568), 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-05 18:06:05,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 568 transitions. [2025-02-05 18:06:05,325 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 568 transitions. Word has length 76 [2025-02-05 18:06:05,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:05,326 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 568 transitions. [2025-02-05 18:06:05,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:05,326 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 568 transitions. [2025-02-05 18:06:05,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:05,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:05,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:05,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 18:06:05,327 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:05,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:05,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1758162768, now seen corresponding path program 1 times [2025-02-05 18:06:05,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:05,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137809752] [2025-02-05 18:06:05,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:05,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:05,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:05,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:05,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:05,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:05,690 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-05 18:06:05,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:05,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137809752] [2025-02-05 18:06:05,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137809752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:05,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:05,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:05,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704972604] [2025-02-05 18:06:05,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:05,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:05,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:05,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:05,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:05,692 INFO L87 Difference]: Start difference. First operand 387 states and 568 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:06,190 INFO L93 Difference]: Finished difference Result 871 states and 1279 transitions. [2025-02-05 18:06:06,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:06,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:06,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:06,193 INFO L225 Difference]: With dead ends: 871 [2025-02-05 18:06:06,194 INFO L226 Difference]: Without dead ends: 534 [2025-02-05 18:06:06,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:06,195 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 770 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:06,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:06:06,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-02-05 18:06:06,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 397. [2025-02-05 18:06:06,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.4671717171717171) internal successors, (581), 396 states have internal predecessors, (581), 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-05 18:06:06,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 581 transitions. [2025-02-05 18:06:06,209 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 581 transitions. Word has length 76 [2025-02-05 18:06:06,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:06,209 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 581 transitions. [2025-02-05 18:06:06,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:06,210 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 581 transitions. [2025-02-05 18:06:06,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:06,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:06,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:06,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 18:06:06,211 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:06,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:06,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1313866121, now seen corresponding path program 1 times [2025-02-05 18:06:06,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:06,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957774076] [2025-02-05 18:06:06,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:06,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:06,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:06,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:06,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:06,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:06,455 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-05 18:06:06,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:06,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957774076] [2025-02-05 18:06:06,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957774076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:06,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:06,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:06,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869285932] [2025-02-05 18:06:06,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:06,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:06,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:06,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:06,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:06,457 INFO L87 Difference]: Start difference. First operand 397 states and 581 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:06,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:06,797 INFO L93 Difference]: Finished difference Result 869 states and 1274 transitions. [2025-02-05 18:06:06,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:06,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:06,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:06,799 INFO L225 Difference]: With dead ends: 869 [2025-02-05 18:06:06,799 INFO L226 Difference]: Without dead ends: 532 [2025-02-05 18:06:06,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:06,801 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 752 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:06,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:06:06,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-02-05 18:06:06,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 425. [2025-02-05 18:06:06,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.4646226415094339) internal successors, (621), 424 states have internal predecessors, (621), 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-05 18:06:06,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 621 transitions. [2025-02-05 18:06:06,813 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 621 transitions. Word has length 76 [2025-02-05 18:06:06,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:06,813 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 621 transitions. [2025-02-05 18:06:06,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:06,813 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 621 transitions. [2025-02-05 18:06:06,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:06,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:06,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:06,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 18:06:06,814 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:06,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:06,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1919794579, now seen corresponding path program 1 times [2025-02-05 18:06:06,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:06,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027749523] [2025-02-05 18:06:06,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:06,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:06,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:06,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:06,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:06,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:07,169 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-05 18:06:07,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:07,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027749523] [2025-02-05 18:06:07,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027749523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:07,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:07,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:07,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578603523] [2025-02-05 18:06:07,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:07,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:07,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:07,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:07,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:07,172 INFO L87 Difference]: Start difference. First operand 425 states and 621 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:07,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:07,462 INFO L93 Difference]: Finished difference Result 867 states and 1269 transitions. [2025-02-05 18:06:07,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:07,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:07,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:07,464 INFO L225 Difference]: With dead ends: 867 [2025-02-05 18:06:07,464 INFO L226 Difference]: Without dead ends: 530 [2025-02-05 18:06:07,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:07,466 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 740 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:07,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:06:07,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-02-05 18:06:07,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 435. [2025-02-05 18:06:07,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 1.4608294930875576) internal successors, (634), 434 states have internal predecessors, (634), 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-05 18:06:07,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 634 transitions. [2025-02-05 18:06:07,482 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 634 transitions. Word has length 76 [2025-02-05 18:06:07,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:07,482 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 634 transitions. [2025-02-05 18:06:07,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:07,483 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 634 transitions. [2025-02-05 18:06:07,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:07,484 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:07,484 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:07,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 18:06:07,485 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:07,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:07,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2096084876, now seen corresponding path program 1 times [2025-02-05 18:06:07,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:07,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683136621] [2025-02-05 18:06:07,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:07,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:07,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:07,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:07,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:07,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:07,792 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-05 18:06:07,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:07,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683136621] [2025-02-05 18:06:07,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683136621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:07,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:07,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:07,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565625123] [2025-02-05 18:06:07,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:07,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:07,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:07,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:07,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:07,795 INFO L87 Difference]: Start difference. First operand 435 states and 634 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:08,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:08,089 INFO L93 Difference]: Finished difference Result 865 states and 1264 transitions. [2025-02-05 18:06:08,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:08,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:08,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:08,093 INFO L225 Difference]: With dead ends: 865 [2025-02-05 18:06:08,093 INFO L226 Difference]: Without dead ends: 528 [2025-02-05 18:06:08,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:08,095 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 722 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:08,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:06:08,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-02-05 18:06:08,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 463. [2025-02-05 18:06:08,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 1.4588744588744589) internal successors, (674), 462 states have internal predecessors, (674), 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-05 18:06:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 674 transitions. [2025-02-05 18:06:08,109 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 674 transitions. Word has length 76 [2025-02-05 18:06:08,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:08,110 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 674 transitions. [2025-02-05 18:06:08,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:08,110 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 674 transitions. [2025-02-05 18:06:08,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:08,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:08,111 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:08,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 18:06:08,111 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:08,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:08,111 INFO L85 PathProgramCache]: Analyzing trace with hash -2013719830, now seen corresponding path program 1 times [2025-02-05 18:06:08,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:08,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135483251] [2025-02-05 18:06:08,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:08,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:08,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:08,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:08,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:08,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:08,424 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-05 18:06:08,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:08,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135483251] [2025-02-05 18:06:08,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135483251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:08,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:08,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:08,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987518105] [2025-02-05 18:06:08,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:08,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:08,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:08,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:08,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:08,425 INFO L87 Difference]: Start difference. First operand 463 states and 674 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:08,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:08,697 INFO L93 Difference]: Finished difference Result 863 states and 1259 transitions. [2025-02-05 18:06:08,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:08,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:08,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:08,700 INFO L225 Difference]: With dead ends: 863 [2025-02-05 18:06:08,700 INFO L226 Difference]: Without dead ends: 526 [2025-02-05 18:06:08,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:08,702 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 710 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:08,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:06:08,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-02-05 18:06:08,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 473. [2025-02-05 18:06:08,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 1.4555084745762712) internal successors, (687), 472 states have internal predecessors, (687), 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-05 18:06:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 687 transitions. [2025-02-05 18:06:08,715 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 687 transitions. Word has length 76 [2025-02-05 18:06:08,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:08,715 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 687 transitions. [2025-02-05 18:06:08,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:08,716 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 687 transitions. [2025-02-05 18:06:08,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:08,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:08,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:08,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 18:06:08,717 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:08,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:08,718 INFO L85 PathProgramCache]: Analyzing trace with hash -878344096, now seen corresponding path program 1 times [2025-02-05 18:06:08,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:08,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356319507] [2025-02-05 18:06:08,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:08,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:08,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:08,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:08,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:08,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:09,000 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-05 18:06:09,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:09,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356319507] [2025-02-05 18:06:09,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356319507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:09,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:09,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:09,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591851256] [2025-02-05 18:06:09,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:09,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:09,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:09,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:09,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:09,002 INFO L87 Difference]: Start difference. First operand 473 states and 687 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:09,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:09,215 INFO L93 Difference]: Finished difference Result 861 states and 1254 transitions. [2025-02-05 18:06:09,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:09,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:09,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:09,219 INFO L225 Difference]: With dead ends: 861 [2025-02-05 18:06:09,219 INFO L226 Difference]: Without dead ends: 524 [2025-02-05 18:06:09,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:09,220 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 698 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:09,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:06:09,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-02-05 18:06:09,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 483. [2025-02-05 18:06:09,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 1.4522821576763485) internal successors, (700), 482 states have internal predecessors, (700), 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-05 18:06:09,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 700 transitions. [2025-02-05 18:06:09,229 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 700 transitions. Word has length 76 [2025-02-05 18:06:09,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:09,229 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 700 transitions. [2025-02-05 18:06:09,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:09,229 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 700 transitions. [2025-02-05 18:06:09,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:09,232 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:09,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:09,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 18:06:09,232 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:09,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:09,233 INFO L85 PathProgramCache]: Analyzing trace with hash 10692822, now seen corresponding path program 1 times [2025-02-05 18:06:09,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:09,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561596044] [2025-02-05 18:06:09,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:09,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:09,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:09,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:09,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:09,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:09,433 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-05 18:06:09,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:09,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561596044] [2025-02-05 18:06:09,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561596044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:09,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:09,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:09,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72835712] [2025-02-05 18:06:09,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:09,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:09,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:09,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:09,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:09,435 INFO L87 Difference]: Start difference. First operand 483 states and 700 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:09,614 INFO L93 Difference]: Finished difference Result 859 states and 1249 transitions. [2025-02-05 18:06:09,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:09,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:09,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:09,616 INFO L225 Difference]: With dead ends: 859 [2025-02-05 18:06:09,616 INFO L226 Difference]: Without dead ends: 522 [2025-02-05 18:06:09,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:09,617 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 686 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:09,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:06:09,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-02-05 18:06:09,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 493. [2025-02-05 18:06:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 1.4491869918699187) internal successors, (713), 492 states have internal predecessors, (713), 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-05 18:06:09,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 713 transitions. [2025-02-05 18:06:09,627 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 713 transitions. Word has length 76 [2025-02-05 18:06:09,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:09,627 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 713 transitions. [2025-02-05 18:06:09,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:09,628 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 713 transitions. [2025-02-05 18:06:09,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:09,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:09,628 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:09,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 18:06:09,628 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:09,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:09,629 INFO L85 PathProgramCache]: Analyzing trace with hash -820651205, now seen corresponding path program 1 times [2025-02-05 18:06:09,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:09,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923595273] [2025-02-05 18:06:09,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:09,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:09,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:09,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:09,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:09,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:09,839 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-05 18:06:09,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:09,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923595273] [2025-02-05 18:06:09,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923595273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:09,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:09,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:09,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655012532] [2025-02-05 18:06:09,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:09,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:09,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:09,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:09,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:09,840 INFO L87 Difference]: Start difference. First operand 493 states and 713 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:10,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:10,036 INFO L93 Difference]: Finished difference Result 861 states and 1249 transitions. [2025-02-05 18:06:10,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:10,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:10,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:10,038 INFO L225 Difference]: With dead ends: 861 [2025-02-05 18:06:10,039 INFO L226 Difference]: Without dead ends: 520 [2025-02-05 18:06:10,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:10,040 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 680 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:10,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:06:10,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-02-05 18:06:10,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 491. [2025-02-05 18:06:10,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.4448979591836735) internal successors, (708), 490 states have internal predecessors, (708), 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-05 18:06:10,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 708 transitions. [2025-02-05 18:06:10,055 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 708 transitions. Word has length 76 [2025-02-05 18:06:10,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:10,056 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 708 transitions. [2025-02-05 18:06:10,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:10,056 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 708 transitions. [2025-02-05 18:06:10,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:10,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:10,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:10,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 18:06:10,057 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:10,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:10,058 INFO L85 PathProgramCache]: Analyzing trace with hash -486637499, now seen corresponding path program 1 times [2025-02-05 18:06:10,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:10,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921001200] [2025-02-05 18:06:10,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:10,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:10,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:10,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:10,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:10,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:10,355 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-05 18:06:10,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:10,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921001200] [2025-02-05 18:06:10,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921001200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:10,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:10,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:10,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461967993] [2025-02-05 18:06:10,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:10,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:10,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:10,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:10,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:10,356 INFO L87 Difference]: Start difference. First operand 491 states and 708 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:10,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:10,611 INFO L93 Difference]: Finished difference Result 863 states and 1248 transitions. [2025-02-05 18:06:10,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:10,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:10,613 INFO L225 Difference]: With dead ends: 863 [2025-02-05 18:06:10,613 INFO L226 Difference]: Without dead ends: 518 [2025-02-05 18:06:10,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:10,614 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 676 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:10,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:06:10,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-02-05 18:06:10,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 489. [2025-02-05 18:06:10,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 1.4405737704918034) internal successors, (703), 488 states have internal predecessors, (703), 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-05 18:06:10,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 703 transitions. [2025-02-05 18:06:10,641 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 703 transitions. Word has length 76 [2025-02-05 18:06:10,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:10,644 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 703 transitions. [2025-02-05 18:06:10,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:10,645 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 703 transitions. [2025-02-05 18:06:10,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:10,645 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:10,645 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:10,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 18:06:10,645 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:10,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:10,646 INFO L85 PathProgramCache]: Analyzing trace with hash -661024689, now seen corresponding path program 1 times [2025-02-05 18:06:10,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:10,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661154488] [2025-02-05 18:06:10,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:10,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:10,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:10,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:10,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:10,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:10,847 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-05 18:06:10,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:10,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661154488] [2025-02-05 18:06:10,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661154488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:10,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:10,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:10,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112281931] [2025-02-05 18:06:10,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:10,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:10,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:10,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:10,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:10,849 INFO L87 Difference]: Start difference. First operand 489 states and 703 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:11,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:11,046 INFO L93 Difference]: Finished difference Result 865 states and 1247 transitions. [2025-02-05 18:06:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:11,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:11,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:11,049 INFO L225 Difference]: With dead ends: 865 [2025-02-05 18:06:11,049 INFO L226 Difference]: Without dead ends: 516 [2025-02-05 18:06:11,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:11,050 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 672 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:11,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:06:11,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-02-05 18:06:11,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 487. [2025-02-05 18:06:11,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 486 states have (on average 1.4362139917695473) internal successors, (698), 486 states have internal predecessors, (698), 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-05 18:06:11,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 698 transitions. [2025-02-05 18:06:11,056 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 698 transitions. Word has length 76 [2025-02-05 18:06:11,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:11,057 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 698 transitions. [2025-02-05 18:06:11,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:11,057 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 698 transitions. [2025-02-05 18:06:11,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:11,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:11,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:11,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 18:06:11,058 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:11,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:11,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1790544729, now seen corresponding path program 1 times [2025-02-05 18:06:11,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:11,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158079078] [2025-02-05 18:06:11,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:11,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:11,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:11,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:11,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:11,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:11,212 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-05 18:06:11,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:11,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158079078] [2025-02-05 18:06:11,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158079078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:11,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:11,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:11,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530483355] [2025-02-05 18:06:11,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:11,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:11,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:11,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:11,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:11,214 INFO L87 Difference]: Start difference. First operand 487 states and 698 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:11,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:11,407 INFO L93 Difference]: Finished difference Result 867 states and 1246 transitions. [2025-02-05 18:06:11,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:11,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:11,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:11,408 INFO L225 Difference]: With dead ends: 867 [2025-02-05 18:06:11,408 INFO L226 Difference]: Without dead ends: 514 [2025-02-05 18:06:11,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:11,409 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 668 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:11,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:06:11,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-02-05 18:06:11,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 485. [2025-02-05 18:06:11,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 1.4318181818181819) internal successors, (693), 484 states have internal predecessors, (693), 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-05 18:06:11,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 693 transitions. [2025-02-05 18:06:11,416 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 693 transitions. Word has length 76 [2025-02-05 18:06:11,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:11,416 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 693 transitions. [2025-02-05 18:06:11,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:11,416 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 693 transitions. [2025-02-05 18:06:11,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:11,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:11,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:11,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 18:06:11,417 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:11,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:11,417 INFO L85 PathProgramCache]: Analyzing trace with hash 220047614, now seen corresponding path program 1 times [2025-02-05 18:06:11,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:11,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55517138] [2025-02-05 18:06:11,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:11,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:11,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:11,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:11,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:11,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:11,599 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-05 18:06:11,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:11,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55517138] [2025-02-05 18:06:11,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55517138] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:11,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:11,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:11,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668036550] [2025-02-05 18:06:11,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:11,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:11,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:11,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:11,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:11,602 INFO L87 Difference]: Start difference. First operand 485 states and 693 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:11,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:11,796 INFO L93 Difference]: Finished difference Result 867 states and 1243 transitions. [2025-02-05 18:06:11,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:11,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:11,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:11,798 INFO L225 Difference]: With dead ends: 867 [2025-02-05 18:06:11,798 INFO L226 Difference]: Without dead ends: 512 [2025-02-05 18:06:11,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:11,798 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 662 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:11,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:06:11,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-02-05 18:06:11,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 483. [2025-02-05 18:06:11,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 1.4273858921161826) internal successors, (688), 482 states have internal predecessors, (688), 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-05 18:06:11,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 688 transitions. [2025-02-05 18:06:11,805 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 688 transitions. Word has length 76 [2025-02-05 18:06:11,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:11,805 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 688 transitions. [2025-02-05 18:06:11,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:11,806 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 688 transitions. [2025-02-05 18:06:11,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:11,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:11,806 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:11,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 18:06:11,806 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:11,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:11,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1494159005, now seen corresponding path program 1 times [2025-02-05 18:06:11,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:11,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527336834] [2025-02-05 18:06:11,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:11,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:11,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:11,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:11,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:11,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:11,974 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-05 18:06:11,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:11,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527336834] [2025-02-05 18:06:11,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527336834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:11,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:11,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:11,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913264939] [2025-02-05 18:06:11,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:11,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:11,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:11,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:11,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:11,976 INFO L87 Difference]: Start difference. First operand 483 states and 688 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:12,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:12,168 INFO L93 Difference]: Finished difference Result 867 states and 1240 transitions. [2025-02-05 18:06:12,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:12,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:12,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:12,170 INFO L225 Difference]: With dead ends: 867 [2025-02-05 18:06:12,170 INFO L226 Difference]: Without dead ends: 510 [2025-02-05 18:06:12,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:12,172 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 656 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:12,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:06:12,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-02-05 18:06:12,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 481. [2025-02-05 18:06:12,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.4229166666666666) internal successors, (683), 480 states have internal predecessors, (683), 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-05 18:06:12,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 683 transitions. [2025-02-05 18:06:12,183 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 683 transitions. Word has length 76 [2025-02-05 18:06:12,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:12,183 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 683 transitions. [2025-02-05 18:06:12,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:12,183 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 683 transitions. [2025-02-05 18:06:12,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:12,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:12,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:12,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 18:06:12,184 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:12,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:12,184 INFO L85 PathProgramCache]: Analyzing trace with hash 420721800, now seen corresponding path program 1 times [2025-02-05 18:06:12,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:12,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820986936] [2025-02-05 18:06:12,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:12,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:12,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:12,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:12,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:12,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:12,333 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-05 18:06:12,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:12,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820986936] [2025-02-05 18:06:12,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820986936] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:12,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:12,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:12,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022144864] [2025-02-05 18:06:12,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:12,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:12,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:12,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:12,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:12,334 INFO L87 Difference]: Start difference. First operand 481 states and 683 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:12,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:12,526 INFO L93 Difference]: Finished difference Result 867 states and 1237 transitions. [2025-02-05 18:06:12,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:12,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:12,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:12,528 INFO L225 Difference]: With dead ends: 867 [2025-02-05 18:06:12,528 INFO L226 Difference]: Without dead ends: 508 [2025-02-05 18:06:12,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:12,529 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 650 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:12,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:06:12,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-02-05 18:06:12,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 479. [2025-02-05 18:06:12,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 478 states have (on average 1.4184100418410042) internal successors, (678), 478 states have internal predecessors, (678), 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-05 18:06:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 678 transitions. [2025-02-05 18:06:12,535 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 678 transitions. Word has length 76 [2025-02-05 18:06:12,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:12,536 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 678 transitions. [2025-02-05 18:06:12,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 678 transitions. [2025-02-05 18:06:12,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:12,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:12,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:12,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 18:06:12,540 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:12,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:12,540 INFO L85 PathProgramCache]: Analyzing trace with hash -593171694, now seen corresponding path program 1 times [2025-02-05 18:06:12,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:12,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829247890] [2025-02-05 18:06:12,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:12,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:12,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:12,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:12,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:12,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:12,786 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-05 18:06:12,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:12,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829247890] [2025-02-05 18:06:12,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829247890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:12,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:12,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:12,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050026080] [2025-02-05 18:06:12,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:12,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:12,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:12,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:12,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:12,787 INFO L87 Difference]: Start difference. First operand 479 states and 678 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:12,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:12,984 INFO L93 Difference]: Finished difference Result 869 states and 1236 transitions. [2025-02-05 18:06:12,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:12,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:12,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:12,993 INFO L225 Difference]: With dead ends: 869 [2025-02-05 18:06:12,993 INFO L226 Difference]: Without dead ends: 506 [2025-02-05 18:06:12,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:12,995 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 646 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:12,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:06:12,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-02-05 18:06:13,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 477. [2025-02-05 18:06:13,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 1.4138655462184875) internal successors, (673), 476 states have internal predecessors, (673), 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-05 18:06:13,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 673 transitions. [2025-02-05 18:06:13,006 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 673 transitions. Word has length 76 [2025-02-05 18:06:13,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:13,006 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 673 transitions. [2025-02-05 18:06:13,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:13,006 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 673 transitions. [2025-02-05 18:06:13,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:13,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:13,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:13,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 18:06:13,007 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:13,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:13,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1883491484, now seen corresponding path program 1 times [2025-02-05 18:06:13,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:13,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469720120] [2025-02-05 18:06:13,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:13,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:13,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:13,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:13,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:13,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:13,202 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-05 18:06:13,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:13,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469720120] [2025-02-05 18:06:13,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469720120] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:13,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:13,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:13,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372205251] [2025-02-05 18:06:13,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:13,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:13,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:13,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:13,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:13,203 INFO L87 Difference]: Start difference. First operand 477 states and 673 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:13,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:13,377 INFO L93 Difference]: Finished difference Result 871 states and 1235 transitions. [2025-02-05 18:06:13,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:13,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:13,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:13,378 INFO L225 Difference]: With dead ends: 871 [2025-02-05 18:06:13,378 INFO L226 Difference]: Without dead ends: 504 [2025-02-05 18:06:13,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:13,379 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 642 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:13,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:06:13,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-02-05 18:06:13,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 475. [2025-02-05 18:06:13,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 474 states have (on average 1.409282700421941) internal successors, (668), 474 states have internal predecessors, (668), 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-05 18:06:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 668 transitions. [2025-02-05 18:06:13,393 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 668 transitions. Word has length 76 [2025-02-05 18:06:13,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:13,393 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 668 transitions. [2025-02-05 18:06:13,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:13,393 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 668 transitions. [2025-02-05 18:06:13,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:13,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:13,394 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:13,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 18:06:13,394 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:13,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:13,394 INFO L85 PathProgramCache]: Analyzing trace with hash -652434047, now seen corresponding path program 1 times [2025-02-05 18:06:13,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:13,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039568867] [2025-02-05 18:06:13,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:13,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:13,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:13,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:13,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:13,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:13,684 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-05 18:06:13,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:13,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039568867] [2025-02-05 18:06:13,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039568867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:13,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:13,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:13,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652946635] [2025-02-05 18:06:13,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:13,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:13,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:13,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:13,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:13,685 INFO L87 Difference]: Start difference. First operand 475 states and 668 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:13,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:13,876 INFO L93 Difference]: Finished difference Result 871 states and 1232 transitions. [2025-02-05 18:06:13,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:13,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:13,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:13,878 INFO L225 Difference]: With dead ends: 871 [2025-02-05 18:06:13,878 INFO L226 Difference]: Without dead ends: 502 [2025-02-05 18:06:13,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:13,882 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 636 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:13,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:06:13,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-02-05 18:06:13,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 473. [2025-02-05 18:06:13,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 1.4046610169491525) internal successors, (663), 472 states have internal predecessors, (663), 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-05 18:06:13,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 663 transitions. [2025-02-05 18:06:13,898 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 663 transitions. Word has length 76 [2025-02-05 18:06:13,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:13,898 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 663 transitions. [2025-02-05 18:06:13,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:13,898 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 663 transitions. [2025-02-05 18:06:13,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:13,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:13,899 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:13,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 18:06:13,899 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:13,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:13,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1864554790, now seen corresponding path program 1 times [2025-02-05 18:06:13,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:13,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694716434] [2025-02-05 18:06:13,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:13,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:13,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:13,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:13,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:13,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:14,076 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-05 18:06:14,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:14,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694716434] [2025-02-05 18:06:14,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694716434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:14,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:14,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:14,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510652279] [2025-02-05 18:06:14,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:14,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:14,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:14,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:14,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:14,077 INFO L87 Difference]: Start difference. First operand 473 states and 663 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:14,266 INFO L93 Difference]: Finished difference Result 871 states and 1229 transitions. [2025-02-05 18:06:14,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:14,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:14,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:14,271 INFO L225 Difference]: With dead ends: 871 [2025-02-05 18:06:14,271 INFO L226 Difference]: Without dead ends: 500 [2025-02-05 18:06:14,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:14,279 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 630 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:14,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:06:14,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-02-05 18:06:14,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 471. [2025-02-05 18:06:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 1.4) internal successors, (658), 470 states have internal predecessors, (658), 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-05 18:06:14,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 658 transitions. [2025-02-05 18:06:14,289 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 658 transitions. Word has length 76 [2025-02-05 18:06:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:14,289 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 658 transitions. [2025-02-05 18:06:14,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:14,289 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 658 transitions. [2025-02-05 18:06:14,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:14,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:14,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:14,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 18:06:14,290 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:14,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:14,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1670727797, now seen corresponding path program 1 times [2025-02-05 18:06:14,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:14,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890121246] [2025-02-05 18:06:14,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:14,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:14,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:14,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:14,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:14,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:14,515 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-05 18:06:14,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:14,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890121246] [2025-02-05 18:06:14,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890121246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:14,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:14,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:14,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952308516] [2025-02-05 18:06:14,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:14,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:14,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:14,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:14,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:14,519 INFO L87 Difference]: Start difference. First operand 471 states and 658 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:14,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:14,732 INFO L93 Difference]: Finished difference Result 871 states and 1226 transitions. [2025-02-05 18:06:14,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:14,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:14,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:14,733 INFO L225 Difference]: With dead ends: 871 [2025-02-05 18:06:14,733 INFO L226 Difference]: Without dead ends: 498 [2025-02-05 18:06:14,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:14,734 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 624 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:14,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:06:14,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-02-05 18:06:14,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 469. [2025-02-05 18:06:14,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 1.3952991452991452) internal successors, (653), 468 states have internal predecessors, (653), 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-05 18:06:14,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 653 transitions. [2025-02-05 18:06:14,752 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 653 transitions. Word has length 76 [2025-02-05 18:06:14,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:14,752 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 653 transitions. [2025-02-05 18:06:14,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 653 transitions. [2025-02-05 18:06:14,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:14,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:14,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:14,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 18:06:14,753 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:14,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:14,753 INFO L85 PathProgramCache]: Analyzing trace with hash 116176021, now seen corresponding path program 1 times [2025-02-05 18:06:14,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:14,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301152134] [2025-02-05 18:06:14,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:14,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:14,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:14,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:14,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:14,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:14,950 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-05 18:06:14,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:14,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301152134] [2025-02-05 18:06:14,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301152134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:14,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:14,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:14,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842217520] [2025-02-05 18:06:14,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:14,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:14,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:14,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:14,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:14,952 INFO L87 Difference]: Start difference. First operand 469 states and 653 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:15,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:15,137 INFO L93 Difference]: Finished difference Result 873 states and 1225 transitions. [2025-02-05 18:06:15,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:15,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:15,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:15,139 INFO L225 Difference]: With dead ends: 873 [2025-02-05 18:06:15,139 INFO L226 Difference]: Without dead ends: 496 [2025-02-05 18:06:15,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:15,140 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 620 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:15,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:06:15,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-02-05 18:06:15,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 467. [2025-02-05 18:06:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 466 states have (on average 1.390557939914163) internal successors, (648), 466 states have internal predecessors, (648), 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-05 18:06:15,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 648 transitions. [2025-02-05 18:06:15,157 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 648 transitions. Word has length 76 [2025-02-05 18:06:15,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:15,157 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 648 transitions. [2025-02-05 18:06:15,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:15,157 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 648 transitions. [2025-02-05 18:06:15,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:15,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:15,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:15,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 18:06:15,158 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:15,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:15,159 INFO L85 PathProgramCache]: Analyzing trace with hash 917839007, now seen corresponding path program 1 times [2025-02-05 18:06:15,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:15,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375564749] [2025-02-05 18:06:15,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:15,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:15,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:15,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:15,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:15,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:15,387 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-05 18:06:15,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:15,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375564749] [2025-02-05 18:06:15,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375564749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:15,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:15,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:15,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847598955] [2025-02-05 18:06:15,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:15,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:15,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:15,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:15,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:15,390 INFO L87 Difference]: Start difference. First operand 467 states and 648 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:15,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:15,580 INFO L93 Difference]: Finished difference Result 875 states and 1224 transitions. [2025-02-05 18:06:15,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:15,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:15,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:15,582 INFO L225 Difference]: With dead ends: 875 [2025-02-05 18:06:15,582 INFO L226 Difference]: Without dead ends: 494 [2025-02-05 18:06:15,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:15,584 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 616 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:15,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:06:15,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-02-05 18:06:15,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 465. [2025-02-05 18:06:15,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 1.3857758620689655) internal successors, (643), 464 states have internal predecessors, (643), 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-05 18:06:15,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 643 transitions. [2025-02-05 18:06:15,590 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 643 transitions. Word has length 76 [2025-02-05 18:06:15,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:15,593 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 643 transitions. [2025-02-05 18:06:15,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:15,594 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 643 transitions. [2025-02-05 18:06:15,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:15,594 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:15,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:15,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 18:06:15,594 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:15,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:15,594 INFO L85 PathProgramCache]: Analyzing trace with hash -57249879, now seen corresponding path program 1 times [2025-02-05 18:06:15,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:15,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756045057] [2025-02-05 18:06:15,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:15,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:15,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:15,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:15,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:15,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:15,796 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-05 18:06:15,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:15,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756045057] [2025-02-05 18:06:15,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756045057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:15,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:15,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:15,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948779732] [2025-02-05 18:06:15,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:15,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:15,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:15,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:15,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:15,798 INFO L87 Difference]: Start difference. First operand 465 states and 643 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:15,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:15,983 INFO L93 Difference]: Finished difference Result 877 states and 1223 transitions. [2025-02-05 18:06:15,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:15,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:15,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:15,984 INFO L225 Difference]: With dead ends: 877 [2025-02-05 18:06:15,984 INFO L226 Difference]: Without dead ends: 492 [2025-02-05 18:06:15,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:15,986 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 612 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:15,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:06:15,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-02-05 18:06:16,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 463. [2025-02-05 18:06:16,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 1.380952380952381) internal successors, (638), 462 states have internal predecessors, (638), 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-05 18:06:16,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 638 transitions. [2025-02-05 18:06:16,006 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 638 transitions. Word has length 76 [2025-02-05 18:06:16,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:16,006 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 638 transitions. [2025-02-05 18:06:16,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:16,006 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 638 transitions. [2025-02-05 18:06:16,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:16,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:16,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:16,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 18:06:16,008 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:16,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:16,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1689077426, now seen corresponding path program 1 times [2025-02-05 18:06:16,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:16,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962078914] [2025-02-05 18:06:16,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:16,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:16,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:16,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:16,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:16,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:16,342 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-05 18:06:16,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:16,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962078914] [2025-02-05 18:06:16,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962078914] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:16,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:16,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:16,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451479673] [2025-02-05 18:06:16,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:16,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:16,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:16,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:16,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:16,344 INFO L87 Difference]: Start difference. First operand 463 states and 638 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:16,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:16,543 INFO L93 Difference]: Finished difference Result 877 states and 1220 transitions. [2025-02-05 18:06:16,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:16,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:16,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:16,545 INFO L225 Difference]: With dead ends: 877 [2025-02-05 18:06:16,545 INFO L226 Difference]: Without dead ends: 490 [2025-02-05 18:06:16,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:16,546 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 606 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:16,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:06:16,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-02-05 18:06:16,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 461. [2025-02-05 18:06:16,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.376086956521739) internal successors, (633), 460 states have internal predecessors, (633), 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-05 18:06:16,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 633 transitions. [2025-02-05 18:06:16,556 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 633 transitions. Word has length 76 [2025-02-05 18:06:16,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:16,557 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 633 transitions. [2025-02-05 18:06:16,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:16,557 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 633 transitions. [2025-02-05 18:06:16,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:16,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:16,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:16,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 18:06:16,558 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:16,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:16,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2082680243, now seen corresponding path program 1 times [2025-02-05 18:06:16,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:16,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577174388] [2025-02-05 18:06:16,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:16,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:16,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:16,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:16,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:16,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:16,757 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-05 18:06:16,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:16,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577174388] [2025-02-05 18:06:16,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577174388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:16,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:16,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:16,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517533592] [2025-02-05 18:06:16,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:16,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:16,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:16,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:16,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:16,758 INFO L87 Difference]: Start difference. First operand 461 states and 633 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:16,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:16,943 INFO L93 Difference]: Finished difference Result 877 states and 1217 transitions. [2025-02-05 18:06:16,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:16,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:16,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:16,944 INFO L225 Difference]: With dead ends: 877 [2025-02-05 18:06:16,944 INFO L226 Difference]: Without dead ends: 488 [2025-02-05 18:06:16,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:16,948 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 600 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:16,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:06:16,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-02-05 18:06:16,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 459. [2025-02-05 18:06:16,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.3711790393013101) internal successors, (628), 458 states have internal predecessors, (628), 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-05 18:06:16,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 628 transitions. [2025-02-05 18:06:16,956 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 628 transitions. Word has length 76 [2025-02-05 18:06:16,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:16,957 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 628 transitions. [2025-02-05 18:06:16,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:16,957 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 628 transitions. [2025-02-05 18:06:16,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 18:06:16,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:16,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:16,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 18:06:16,957 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:16,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:16,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1789402328, now seen corresponding path program 1 times [2025-02-05 18:06:16,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:16,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219702325] [2025-02-05 18:06:16,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:16,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:16,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 18:06:17,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 18:06:17,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:17,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:17,173 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-05 18:06:17,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:17,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219702325] [2025-02-05 18:06:17,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219702325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:17,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:17,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:17,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88925941] [2025-02-05 18:06:17,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:17,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:17,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:17,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:17,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:17,175 INFO L87 Difference]: Start difference. First operand 459 states and 628 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:17,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:17,366 INFO L93 Difference]: Finished difference Result 809 states and 1141 transitions. [2025-02-05 18:06:17,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:17,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 18:06:17,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:17,368 INFO L225 Difference]: With dead ends: 809 [2025-02-05 18:06:17,368 INFO L226 Difference]: Without dead ends: 418 [2025-02-05 18:06:17,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:06:17,369 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 568 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:17,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 970 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:06:17,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-02-05 18:06:17,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 405. [2025-02-05 18:06:17,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 1.4158415841584158) internal successors, (572), 404 states have internal predecessors, (572), 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-05 18:06:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 572 transitions. [2025-02-05 18:06:17,384 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 572 transitions. Word has length 76 [2025-02-05 18:06:17,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:17,384 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 572 transitions. [2025-02-05 18:06:17,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:17,384 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 572 transitions. [2025-02-05 18:06:17,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 18:06:17,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:17,386 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:17,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 18:06:17,386 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:17,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:17,386 INFO L85 PathProgramCache]: Analyzing trace with hash -502106364, now seen corresponding path program 1 times [2025-02-05 18:06:17,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:17,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067881990] [2025-02-05 18:06:17,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:17,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:17,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 18:06:18,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 18:06:18,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:18,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:19,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:19,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067881990] [2025-02-05 18:06:19,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067881990] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:06:19,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836366965] [2025-02-05 18:06:19,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:19,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:06:19,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:06:19,897 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-05 18:06:19,905 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-05 18:06:20,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 18:06:20,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 18:06:20,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:20,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:20,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 2385 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 18:06:20,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:06:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 18:06:20,988 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 18:06:20,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836366965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:20,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 18:06:20,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-02-05 18:06:20,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223801377] [2025-02-05 18:06:20,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:20,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:20,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:20,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:20,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 18:06:20,990 INFO L87 Difference]: Start difference. First operand 405 states and 572 transitions. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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-05 18:06:21,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:21,530 INFO L93 Difference]: Finished difference Result 857 states and 1236 transitions. [2025-02-05 18:06:21,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 18:06:21,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 215 [2025-02-05 18:06:21,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:21,532 INFO L225 Difference]: With dead ends: 857 [2025-02-05 18:06:21,532 INFO L226 Difference]: Without dead ends: 520 [2025-02-05 18:06:21,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-05 18:06:21,533 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 121 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:21,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1176 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:06:21,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-02-05 18:06:21,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 491. [2025-02-05 18:06:21,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.4285714285714286) internal successors, (700), 490 states have internal predecessors, (700), 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-05 18:06:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 700 transitions. [2025-02-05 18:06:21,540 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 700 transitions. Word has length 215 [2025-02-05 18:06:21,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:21,540 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 700 transitions. [2025-02-05 18:06:21,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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-05 18:06:21,540 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 700 transitions. [2025-02-05 18:06:21,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 18:06:21,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:21,541 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:21,556 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-05 18:06:21,742 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,SelfDestructingSolverStorable32 [2025-02-05 18:06:21,742 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:21,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash -2101089926, now seen corresponding path program 1 times [2025-02-05 18:06:21,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:21,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201030755] [2025-02-05 18:06:21,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:21,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:21,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 18:06:22,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 18:06:22,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:22,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:24,434 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 48 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:24,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:24,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201030755] [2025-02-05 18:06:24,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201030755] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:06:24,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720760252] [2025-02-05 18:06:24,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:24,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:06:24,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:06:24,437 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-05 18:06:24,442 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-05 18:06:25,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 18:06:25,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 18:06:25,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:25,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:25,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 2385 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 18:06:25,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:06:25,897 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:25,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 18:06:26,159 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 18:06:26,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720760252] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 18:06:26,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 18:06:26,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12, 6] total 17 [2025-02-05 18:06:26,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282797167] [2025-02-05 18:06:26,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:26,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:26,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:26,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:26,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-02-05 18:06:26,163 INFO L87 Difference]: Start difference. First operand 491 states and 700 transitions. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 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-05 18:06:26,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:26,782 INFO L93 Difference]: Finished difference Result 1099 states and 1596 transitions. [2025-02-05 18:06:26,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:06:26,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 215 [2025-02-05 18:06:26,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:26,786 INFO L225 Difference]: With dead ends: 1099 [2025-02-05 18:06:26,787 INFO L226 Difference]: Without dead ends: 676 [2025-02-05 18:06:26,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2025-02-05 18:06:26,788 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 221 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:26,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 948 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 18:06:26,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-02-05 18:06:26,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 489. [2025-02-05 18:06:26,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 1.4282786885245902) internal successors, (697), 488 states have internal predecessors, (697), 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-05 18:06:26,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 697 transitions. [2025-02-05 18:06:26,803 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 697 transitions. Word has length 215 [2025-02-05 18:06:26,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:26,804 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 697 transitions. [2025-02-05 18:06:26,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 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-05 18:06:26,804 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 697 transitions. [2025-02-05 18:06:26,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 18:06:26,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:26,806 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:26,825 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-05 18:06:27,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:06:27,007 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:27,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:27,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1328740624, now seen corresponding path program 1 times [2025-02-05 18:06:27,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:27,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670013379] [2025-02-05 18:06:27,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:27,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:27,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 18:06:27,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 18:06:27,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:27,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:30,163 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:30,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:30,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670013379] [2025-02-05 18:06:30,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670013379] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:06:30,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526070999] [2025-02-05 18:06:30,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:30,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:06:30,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:06:30,167 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-05 18:06:30,168 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-05 18:06:30,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 18:06:31,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 18:06:31,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:31,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:31,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 2385 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 18:06:31,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:06:31,568 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 18:06:31,569 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 18:06:31,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526070999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:31,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 18:06:31,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2025-02-05 18:06:31,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355002349] [2025-02-05 18:06:31,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:31,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:31,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:31,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:31,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-02-05 18:06:31,571 INFO L87 Difference]: Start difference. First operand 489 states and 697 transitions. Second operand has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 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-05 18:06:32,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:32,319 INFO L93 Difference]: Finished difference Result 1079 states and 1566 transitions. [2025-02-05 18:06:32,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 18:06:32,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 215 [2025-02-05 18:06:32,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:32,321 INFO L225 Difference]: With dead ends: 1079 [2025-02-05 18:06:32,321 INFO L226 Difference]: Without dead ends: 658 [2025-02-05 18:06:32,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-02-05 18:06:32,323 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 105 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:32,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1176 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:06:32,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-02-05 18:06:32,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 487. [2025-02-05 18:06:32,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 486 states have (on average 1.4279835390946503) internal successors, (694), 486 states have internal predecessors, (694), 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-05 18:06:32,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 694 transitions. [2025-02-05 18:06:32,334 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 694 transitions. Word has length 215 [2025-02-05 18:06:32,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:32,334 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 694 transitions. [2025-02-05 18:06:32,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 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-05 18:06:32,335 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 694 transitions. [2025-02-05 18:06:32,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 18:06:32,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:32,336 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 18:06:32,356 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-05 18:06:32,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:06:32,537 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:32,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:32,538 INFO L85 PathProgramCache]: Analyzing trace with hash -884443977, now seen corresponding path program 1 times [2025-02-05 18:06:32,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:32,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220995500] [2025-02-05 18:06:32,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:32,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:32,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 18:06:33,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 18:06:33,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:33,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat