./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.6.prop1-back-serstep.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.6.prop1-back-serstep.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 61ff0c478cd6e8d41d810ae4d1198eff2eb63a9a5783db9909f1ae30395ad01a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:51:18,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:51:18,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 20:51:18,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:51:18,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:51:18,661 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:51:18,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:51:18,661 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:51:18,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:51:18,661 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:51:18,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:51:18,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:51:18,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:51:18,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:51:18,662 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:51:18,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:51:18,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:51:18,662 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:51:18,662 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:51:18,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:51:18,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:51:18,662 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:51:18,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:51:18,664 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:51:18,664 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:51:18,664 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:51:18,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:51:18,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:51:18,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:51:18,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:51:18,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:51:18,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:51:18,665 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:51:18,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:51:18,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:51:18,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:51:18,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:51:18,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:51:18,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:51:18,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:51:18,666 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/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 -> 61ff0c478cd6e8d41d810ae4d1198eff2eb63a9a5783db9909f1ae30395ad01a [2025-03-16 20:51:18,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:51:18,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:51:18,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:51:18,865 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:51:18,865 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:51:18,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.6.prop1-back-serstep.c [2025-03-16 20:51:19,952 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a2895003/49eafcb294834bcb8cabc9eeea98b967/FLAG6760fa7da [2025-03-16 20:51:20,178 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:51:20,179 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.6.prop1-back-serstep.c [2025-03-16 20:51:20,187 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a2895003/49eafcb294834bcb8cabc9eeea98b967/FLAG6760fa7da [2025-03-16 20:51:20,510 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a2895003/49eafcb294834bcb8cabc9eeea98b967 [2025-03-16 20:51:20,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:51:20,513 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:51:20,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:51:20,514 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:51:20,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:51:20,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:51:20" (1/1) ... [2025-03-16 20:51:20,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f6906a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:20, skipping insertion in model container [2025-03-16 20:51:20,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:51:20" (1/1) ... [2025-03-16 20:51:20,545 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:51:20,659 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.6.prop1-back-serstep.c[1174,1187] [2025-03-16 20:51:20,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:51:20,818 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:51:20,825 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.6.prop1-back-serstep.c[1174,1187] [2025-03-16 20:51:20,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:51:20,915 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:51:20,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:20 WrapperNode [2025-03-16 20:51:20,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:51:20,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:51:20,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:51:20,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:51:20,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:20" (1/1) ... [2025-03-16 20:51:20,941 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:20" (1/1) ... [2025-03-16 20:51:21,102 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1948 [2025-03-16 20:51:21,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:51:21,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:51:21,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:51:21,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:51:21,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:20" (1/1) ... [2025-03-16 20:51:21,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:20" (1/1) ... [2025-03-16 20:51:21,135 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:20" (1/1) ... [2025-03-16 20:51:21,179 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-03-16 20:51:21,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:20" (1/1) ... [2025-03-16 20:51:21,180 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:20" (1/1) ... [2025-03-16 20:51:21,220 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:20" (1/1) ... [2025-03-16 20:51:21,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:20" (1/1) ... [2025-03-16 20:51:21,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:20" (1/1) ... [2025-03-16 20:51:21,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:20" (1/1) ... [2025-03-16 20:51:21,269 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:51:21,271 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:51:21,271 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:51:21,271 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:51:21,272 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:20" (1/1) ... [2025-03-16 20:51:21,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:51:21,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:21,298 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:51:21,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:51:21,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:51:21,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:51:21,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:51:21,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:51:21,461 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:51:21,462 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:51:23,072 INFO L? ?]: Removed 991 outVars from TransFormulas that were not future-live. [2025-03-16 20:51:23,073 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:51:23,163 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:51:23,163 INFO L336 CfgBuilder]: Removed 4 assume(true) statements. [2025-03-16 20:51:23,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:51:23 BoogieIcfgContainer [2025-03-16 20:51:23,164 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:51:23,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:51:23,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:51:23,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:51:23,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:51:20" (1/3) ... [2025-03-16 20:51:23,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3b8d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:51:23, skipping insertion in model container [2025-03-16 20:51:23,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:20" (2/3) ... [2025-03-16 20:51:23,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3b8d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:51:23, skipping insertion in model container [2025-03-16 20:51:23,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:51:23" (3/3) ... [2025-03-16 20:51:23,174 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.6.prop1-back-serstep.c [2025-03-16 20:51:23,185 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:51:23,187 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.adding.6.prop1-back-serstep.c that has 1 procedures, 684 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 20:51:23,240 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:51:23,247 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;@6833f361, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:51:23,247 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 20:51:23,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 684 states, 682 states have (on average 1.502932551319648) internal successors, (1025), 683 states have internal predecessors, (1025), 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-03-16 20:51:23,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 20:51:23,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:23,256 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:51:23,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:23,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:23,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1139318208, now seen corresponding path program 1 times [2025-03-16 20:51:23,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:23,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013150670] [2025-03-16 20:51:23,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:23,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:23,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 20:51:23,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 20:51:23,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:23,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:23,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:23,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:23,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013150670] [2025-03-16 20:51:23,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013150670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:23,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:23,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:51:23,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469692959] [2025-03-16 20:51:23,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:23,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:51:23,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:23,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:51:23,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:51:23,909 INFO L87 Difference]: Start difference. First operand has 684 states, 682 states have (on average 1.502932551319648) internal successors, (1025), 683 states have internal predecessors, (1025), 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 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-03-16 20:51:24,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:24,279 INFO L93 Difference]: Finished difference Result 1323 states and 1985 transitions. [2025-03-16 20:51:24,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:51:24,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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 84 [2025-03-16 20:51:24,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:24,292 INFO L225 Difference]: With dead ends: 1323 [2025-03-16 20:51:24,292 INFO L226 Difference]: Without dead ends: 684 [2025-03-16 20:51:24,296 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-03-16 20:51:24,299 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 0 mSDsluCounter, 1695 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:24,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2545 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:51:24,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-03-16 20:51:24,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2025-03-16 20:51:24,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 1.499267935578331) internal successors, (1024), 683 states have internal predecessors, (1024), 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-03-16 20:51:24,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1024 transitions. [2025-03-16 20:51:24,365 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1024 transitions. Word has length 84 [2025-03-16 20:51:24,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:24,366 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1024 transitions. [2025-03-16 20:51:24,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-03-16 20:51:24,367 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1024 transitions. [2025-03-16 20:51:24,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 20:51:24,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:24,370 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:51:24,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:51:24,371 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:24,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:24,371 INFO L85 PathProgramCache]: Analyzing trace with hash 963806129, now seen corresponding path program 1 times [2025-03-16 20:51:24,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:24,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054252024] [2025-03-16 20:51:24,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:24,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:24,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 20:51:24,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 20:51:24,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:24,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:24,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:24,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:24,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054252024] [2025-03-16 20:51:24,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054252024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:24,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:24,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:51:24,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902038845] [2025-03-16 20:51:24,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:24,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:51:24,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:24,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:51:24,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:51:24,577 INFO L87 Difference]: Start difference. First operand 684 states and 1024 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-03-16 20:51:24,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:24,895 INFO L93 Difference]: Finished difference Result 1325 states and 1984 transitions. [2025-03-16 20:51:24,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:51:24,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 85 [2025-03-16 20:51:24,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:24,898 INFO L225 Difference]: With dead ends: 1325 [2025-03-16 20:51:24,898 INFO L226 Difference]: Without dead ends: 686 [2025-03-16 20:51:24,900 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-03-16 20:51:24,900 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 0 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:24,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2542 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:51:24,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-03-16 20:51:24,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2025-03-16 20:51:24,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 685 states have (on average 1.4978102189781022) internal successors, (1026), 685 states have internal predecessors, (1026), 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-03-16 20:51:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1026 transitions. [2025-03-16 20:51:24,922 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1026 transitions. Word has length 85 [2025-03-16 20:51:24,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:24,923 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 1026 transitions. [2025-03-16 20:51:24,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-03-16 20:51:24,923 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1026 transitions. [2025-03-16 20:51:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:51:24,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:24,925 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:51:24,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:51:24,926 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:24,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:24,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1744729051, now seen corresponding path program 1 times [2025-03-16 20:51:24,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:24,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326086911] [2025-03-16 20:51:24,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:24,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:24,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:51:24,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:51:24,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:24,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:25,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:25,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:25,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326086911] [2025-03-16 20:51:25,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326086911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:25,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:25,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:51:25,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85701336] [2025-03-16 20:51:25,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:25,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:51:25,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:25,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:51:25,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:51:25,134 INFO L87 Difference]: Start difference. First operand 686 states and 1026 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-03-16 20:51:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:25,406 INFO L93 Difference]: Finished difference Result 1329 states and 1988 transitions. [2025-03-16 20:51:25,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:51:25,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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 86 [2025-03-16 20:51:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:25,409 INFO L225 Difference]: With dead ends: 1329 [2025-03-16 20:51:25,409 INFO L226 Difference]: Without dead ends: 688 [2025-03-16 20:51:25,411 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-03-16 20:51:25,412 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 0 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:25,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2542 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:51:25,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-16 20:51:25,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2025-03-16 20:51:25,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 1.4963609898107715) internal successors, (1028), 687 states have internal predecessors, (1028), 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-03-16 20:51:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1028 transitions. [2025-03-16 20:51:25,424 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1028 transitions. Word has length 86 [2025-03-16 20:51:25,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:25,425 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 1028 transitions. [2025-03-16 20:51:25,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-03-16 20:51:25,425 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1028 transitions. [2025-03-16 20:51:25,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 20:51:25,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:25,428 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:51:25,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:51:25,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:25,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:25,429 INFO L85 PathProgramCache]: Analyzing trace with hash 140389142, now seen corresponding path program 1 times [2025-03-16 20:51:25,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:25,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130208466] [2025-03-16 20:51:25,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:25,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:25,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 20:51:25,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 20:51:25,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:25,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:25,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:25,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130208466] [2025-03-16 20:51:25,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130208466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:25,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:25,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:51:25,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403956297] [2025-03-16 20:51:25,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:25,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:51:25,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:25,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:51:25,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:51:25,623 INFO L87 Difference]: Start difference. First operand 688 states and 1028 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 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-03-16 20:51:26,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:26,565 INFO L93 Difference]: Finished difference Result 3002 states and 4489 transitions. [2025-03-16 20:51:26,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:51:26,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 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 87 [2025-03-16 20:51:26,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:26,570 INFO L225 Difference]: With dead ends: 3002 [2025-03-16 20:51:26,570 INFO L226 Difference]: Without dead ends: 1307 [2025-03-16 20:51:26,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:51:26,572 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 3086 mSDsluCounter, 3085 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3086 SdHoareTripleChecker+Valid, 3930 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:26,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3086 Valid, 3930 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 20:51:26,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2025-03-16 20:51:26,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 750. [2025-03-16 20:51:26,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 749 states have (on average 1.4953271028037383) internal successors, (1120), 749 states have internal predecessors, (1120), 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-03-16 20:51:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1120 transitions. [2025-03-16 20:51:26,586 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1120 transitions. Word has length 87 [2025-03-16 20:51:26,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:26,586 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 1120 transitions. [2025-03-16 20:51:26,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 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-03-16 20:51:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1120 transitions. [2025-03-16 20:51:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 20:51:26,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:26,591 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:51:26,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:51:26,591 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:26,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:26,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1601405188, now seen corresponding path program 1 times [2025-03-16 20:51:26,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:26,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36936399] [2025-03-16 20:51:26,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:26,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:26,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 20:51:26,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 20:51:26,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:26,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:26,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:26,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36936399] [2025-03-16 20:51:26,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36936399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:26,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:26,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:51:26,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764152736] [2025-03-16 20:51:26,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:26,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:51:26,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:26,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:51:26,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:51:26,739 INFO L87 Difference]: Start difference. First operand 750 states and 1120 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-03-16 20:51:26,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:26,997 INFO L93 Difference]: Finished difference Result 1395 states and 2084 transitions. [2025-03-16 20:51:26,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:51:26,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 88 [2025-03-16 20:51:26,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:27,000 INFO L225 Difference]: With dead ends: 1395 [2025-03-16 20:51:27,000 INFO L226 Difference]: Without dead ends: 752 [2025-03-16 20:51:27,001 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-03-16 20:51:27,001 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 0 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:27,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2542 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:51:27,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2025-03-16 20:51:27,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2025-03-16 20:51:27,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 751 states have (on average 1.4940079893475366) internal successors, (1122), 751 states have internal predecessors, (1122), 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-03-16 20:51:27,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1122 transitions. [2025-03-16 20:51:27,016 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1122 transitions. Word has length 88 [2025-03-16 20:51:27,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:27,017 INFO L471 AbstractCegarLoop]: Abstraction has 752 states and 1122 transitions. [2025-03-16 20:51:27,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-03-16 20:51:27,017 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1122 transitions. [2025-03-16 20:51:27,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 20:51:27,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:27,017 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:51:27,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:51:27,018 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:27,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:27,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1196248376, now seen corresponding path program 1 times [2025-03-16 20:51:27,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:27,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748341735] [2025-03-16 20:51:27,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:27,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:27,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 20:51:27,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 20:51:27,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:27,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:27,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:27,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:27,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748341735] [2025-03-16 20:51:27,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748341735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:27,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:27,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:51:27,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496217333] [2025-03-16 20:51:27,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:27,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:51:27,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:27,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:51:27,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:51:27,190 INFO L87 Difference]: Start difference. First operand 752 states and 1122 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-03-16 20:51:27,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:27,558 INFO L93 Difference]: Finished difference Result 1399 states and 2088 transitions. [2025-03-16 20:51:27,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:51:27,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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 89 [2025-03-16 20:51:27,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:27,561 INFO L225 Difference]: With dead ends: 1399 [2025-03-16 20:51:27,561 INFO L226 Difference]: Without dead ends: 754 [2025-03-16 20:51:27,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:51:27,564 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 0 mSDsluCounter, 2537 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3387 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:27,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3387 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:51:27,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-16 20:51:27,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2025-03-16 20:51:27,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.4926958831341302) internal successors, (1124), 753 states have internal predecessors, (1124), 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-03-16 20:51:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1124 transitions. [2025-03-16 20:51:27,575 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1124 transitions. Word has length 89 [2025-03-16 20:51:27,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:27,576 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1124 transitions. [2025-03-16 20:51:27,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-03-16 20:51:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1124 transitions. [2025-03-16 20:51:27,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 20:51:27,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:27,577 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:51:27,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:51:27,578 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:27,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:27,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1439460329, now seen corresponding path program 1 times [2025-03-16 20:51:27,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:27,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138846011] [2025-03-16 20:51:27,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:27,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:27,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 20:51:27,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 20:51:27,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:27,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:27,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:27,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:27,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138846011] [2025-03-16 20:51:27,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138846011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:27,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:27,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:51:27,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852105060] [2025-03-16 20:51:27,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:27,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:51:27,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:27,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:51:27,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:51:27,733 INFO L87 Difference]: Start difference. First operand 754 states and 1124 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-03-16 20:51:28,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:28,016 INFO L93 Difference]: Finished difference Result 1403 states and 2092 transitions. [2025-03-16 20:51:28,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:51:28,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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 90 [2025-03-16 20:51:28,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:28,019 INFO L225 Difference]: With dead ends: 1403 [2025-03-16 20:51:28,019 INFO L226 Difference]: Without dead ends: 756 [2025-03-16 20:51:28,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:51:28,021 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 0 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:28,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2542 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:51:28,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2025-03-16 20:51:28,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2025-03-16 20:51:28,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 755 states have (on average 1.491390728476821) internal successors, (1126), 755 states have internal predecessors, (1126), 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-03-16 20:51:28,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1126 transitions. [2025-03-16 20:51:28,035 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1126 transitions. Word has length 90 [2025-03-16 20:51:28,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:28,036 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 1126 transitions. [2025-03-16 20:51:28,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-03-16 20:51:28,036 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1126 transitions. [2025-03-16 20:51:28,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:51:28,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:28,037 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:51:28,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:51:28,037 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:28,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:28,037 INFO L85 PathProgramCache]: Analyzing trace with hash -246428061, now seen corresponding path program 1 times [2025-03-16 20:51:28,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:28,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19729901] [2025-03-16 20:51:28,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:28,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:28,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:51:28,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:51:28,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:28,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:28,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:28,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19729901] [2025-03-16 20:51:28,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19729901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:28,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:28,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:51:28,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093095204] [2025-03-16 20:51:28,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:28,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:51:28,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:28,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:51:28,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:51:28,163 INFO L87 Difference]: Start difference. First operand 756 states and 1126 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-03-16 20:51:28,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:28,426 INFO L93 Difference]: Finished difference Result 1407 states and 2096 transitions. [2025-03-16 20:51:28,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:51:28,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 91 [2025-03-16 20:51:28,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:28,429 INFO L225 Difference]: With dead ends: 1407 [2025-03-16 20:51:28,429 INFO L226 Difference]: Without dead ends: 758 [2025-03-16 20:51:28,430 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-03-16 20:51:28,430 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 0 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2537 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:28,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2537 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:51:28,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-03-16 20:51:28,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 758. [2025-03-16 20:51:28,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 757 states have (on average 1.4900924702774108) internal successors, (1128), 757 states have internal predecessors, (1128), 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-03-16 20:51:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1128 transitions. [2025-03-16 20:51:28,441 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1128 transitions. Word has length 91 [2025-03-16 20:51:28,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:28,441 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1128 transitions. [2025-03-16 20:51:28,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-03-16 20:51:28,441 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1128 transitions. [2025-03-16 20:51:28,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 20:51:28,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:28,441 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:51:28,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:51:28,442 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:28,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:28,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1798524366, now seen corresponding path program 1 times [2025-03-16 20:51:28,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:28,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604324706] [2025-03-16 20:51:28,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:28,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:28,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 20:51:28,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 20:51:28,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:28,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:28,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:28,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:28,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604324706] [2025-03-16 20:51:28,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604324706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:28,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:28,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:51:28,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454558418] [2025-03-16 20:51:28,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:28,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:51:28,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:28,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:51:28,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:51:28,563 INFO L87 Difference]: Start difference. First operand 758 states and 1128 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-03-16 20:51:28,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:28,811 INFO L93 Difference]: Finished difference Result 1417 states and 2108 transitions. [2025-03-16 20:51:28,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:51:28,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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 92 [2025-03-16 20:51:28,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:28,815 INFO L225 Difference]: With dead ends: 1417 [2025-03-16 20:51:28,815 INFO L226 Difference]: Without dead ends: 766 [2025-03-16 20:51:28,816 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-03-16 20:51:28,816 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 3 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:28,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2542 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:51:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-03-16 20:51:28,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 762. [2025-03-16 20:51:28,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 761 states have (on average 1.4901445466491459) internal successors, (1134), 761 states have internal predecessors, (1134), 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-03-16 20:51:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1134 transitions. [2025-03-16 20:51:28,831 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1134 transitions. Word has length 92 [2025-03-16 20:51:28,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:28,831 INFO L471 AbstractCegarLoop]: Abstraction has 762 states and 1134 transitions. [2025-03-16 20:51:28,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-03-16 20:51:28,831 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1134 transitions. [2025-03-16 20:51:28,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 20:51:28,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:28,832 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:51:28,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:51:28,833 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:28,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:28,833 INFO L85 PathProgramCache]: Analyzing trace with hash -248583426, now seen corresponding path program 1 times [2025-03-16 20:51:28,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:28,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889086532] [2025-03-16 20:51:28,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:28,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:28,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 20:51:28,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 20:51:28,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:28,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:28,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:28,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889086532] [2025-03-16 20:51:28,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889086532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:28,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:28,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:51:28,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440296337] [2025-03-16 20:51:28,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:28,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:51:28,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:28,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:51:28,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:51:28,973 INFO L87 Difference]: Start difference. First operand 762 states and 1134 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-03-16 20:51:29,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:29,222 INFO L93 Difference]: Finished difference Result 1423 states and 2118 transitions. [2025-03-16 20:51:29,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:51:29,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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 93 [2025-03-16 20:51:29,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:29,224 INFO L225 Difference]: With dead ends: 1423 [2025-03-16 20:51:29,225 INFO L226 Difference]: Without dead ends: 768 [2025-03-16 20:51:29,225 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-03-16 20:51:29,226 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 4 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:29,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2542 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:51:29,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-03-16 20:51:29,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2025-03-16 20:51:29,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 767 states have (on average 1.4889178617992178) internal successors, (1142), 767 states have internal predecessors, (1142), 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-03-16 20:51:29,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1142 transitions. [2025-03-16 20:51:29,236 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1142 transitions. Word has length 93 [2025-03-16 20:51:29,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:29,236 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 1142 transitions. [2025-03-16 20:51:29,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-03-16 20:51:29,237 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1142 transitions. [2025-03-16 20:51:29,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 20:51:29,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:29,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:51:29,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:51:29,238 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:29,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:29,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1263250344, now seen corresponding path program 1 times [2025-03-16 20:51:29,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:29,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699682751] [2025-03-16 20:51:29,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:29,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:29,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 20:51:29,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 20:51:29,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:29,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:29,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:29,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:29,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699682751] [2025-03-16 20:51:29,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699682751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:29,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:29,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:51:29,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033717115] [2025-03-16 20:51:29,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:29,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:51:29,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:29,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:51:29,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:51:29,354 INFO L87 Difference]: Start difference. First operand 768 states and 1142 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-03-16 20:51:29,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:29,603 INFO L93 Difference]: Finished difference Result 1431 states and 2128 transitions. [2025-03-16 20:51:29,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:51:29,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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 94 [2025-03-16 20:51:29,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:29,606 INFO L225 Difference]: With dead ends: 1431 [2025-03-16 20:51:29,606 INFO L226 Difference]: Without dead ends: 770 [2025-03-16 20:51:29,607 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-03-16 20:51:29,607 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 0 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:29,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2542 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:51:29,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-03-16 20:51:29,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2025-03-16 20:51:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 769 states have (on average 1.4876462938881665) internal successors, (1144), 769 states have internal predecessors, (1144), 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-03-16 20:51:29,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1144 transitions. [2025-03-16 20:51:29,619 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1144 transitions. Word has length 94 [2025-03-16 20:51:29,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:29,619 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 1144 transitions. [2025-03-16 20:51:29,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-03-16 20:51:29,620 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1144 transitions. [2025-03-16 20:51:29,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 20:51:29,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:29,621 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:51:29,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:51:29,621 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:29,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:29,621 INFO L85 PathProgramCache]: Analyzing trace with hash 41015929, now seen corresponding path program 1 times [2025-03-16 20:51:29,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:29,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098671150] [2025-03-16 20:51:29,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:29,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:29,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 20:51:29,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 20:51:29,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:29,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:29,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:29,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:29,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098671150] [2025-03-16 20:51:29,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098671150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:29,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:29,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:51:29,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357119933] [2025-03-16 20:51:29,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:29,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:51:29,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:29,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:51:29,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:51:29,737 INFO L87 Difference]: Start difference. First operand 770 states and 1144 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-03-16 20:51:29,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:29,995 INFO L93 Difference]: Finished difference Result 1435 states and 2132 transitions. [2025-03-16 20:51:29,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:51:29,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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 95 [2025-03-16 20:51:29,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:29,998 INFO L225 Difference]: With dead ends: 1435 [2025-03-16 20:51:29,998 INFO L226 Difference]: Without dead ends: 772 [2025-03-16 20:51:29,999 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-03-16 20:51:30,000 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 0 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2537 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:30,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2537 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:51:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2025-03-16 20:51:30,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2025-03-16 20:51:30,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 771 states have (on average 1.4863813229571985) internal successors, (1146), 771 states have internal predecessors, (1146), 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-03-16 20:51:30,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1146 transitions. [2025-03-16 20:51:30,011 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1146 transitions. Word has length 95 [2025-03-16 20:51:30,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:30,012 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1146 transitions. [2025-03-16 20:51:30,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-03-16 20:51:30,012 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1146 transitions. [2025-03-16 20:51:30,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 20:51:30,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:30,013 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:51:30,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:51:30,013 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:30,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:30,013 INFO L85 PathProgramCache]: Analyzing trace with hash -521951651, now seen corresponding path program 1 times [2025-03-16 20:51:30,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:30,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361080413] [2025-03-16 20:51:30,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:30,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:30,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 20:51:30,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 20:51:30,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:30,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:30,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:30,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361080413] [2025-03-16 20:51:30,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361080413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:30,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:30,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:51:30,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730487945] [2025-03-16 20:51:30,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:30,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:51:30,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:30,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:51:30,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:51:30,140 INFO L87 Difference]: Start difference. First operand 772 states and 1146 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-03-16 20:51:30,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:30,395 INFO L93 Difference]: Finished difference Result 1445 states and 2144 transitions. [2025-03-16 20:51:30,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:51:30,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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 96 [2025-03-16 20:51:30,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:30,398 INFO L225 Difference]: With dead ends: 1445 [2025-03-16 20:51:30,398 INFO L226 Difference]: Without dead ends: 780 [2025-03-16 20:51:30,399 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-03-16 20:51:30,399 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 3 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:30,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2542 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:51:30,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-03-16 20:51:30,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 776. [2025-03-16 20:51:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 775 states have (on average 1.486451612903226) internal successors, (1152), 775 states have internal predecessors, (1152), 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-03-16 20:51:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1152 transitions. [2025-03-16 20:51:30,410 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1152 transitions. Word has length 96 [2025-03-16 20:51:30,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:30,410 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1152 transitions. [2025-03-16 20:51:30,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-03-16 20:51:30,411 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1152 transitions. [2025-03-16 20:51:30,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 20:51:30,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:30,411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:51:30,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:51:30,412 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:30,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:30,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1676526324, now seen corresponding path program 1 times [2025-03-16 20:51:30,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:30,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183695469] [2025-03-16 20:51:30,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:30,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:30,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 20:51:30,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 20:51:30,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:30,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:30,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:30,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:30,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183695469] [2025-03-16 20:51:30,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183695469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:30,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:30,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:51:30,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932152940] [2025-03-16 20:51:30,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:30,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:51:30,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:30,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:51:30,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:51:30,527 INFO L87 Difference]: Start difference. First operand 776 states and 1152 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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-03-16 20:51:30,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:30,875 INFO L93 Difference]: Finished difference Result 1449 states and 2150 transitions. [2025-03-16 20:51:30,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:51:30,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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 97 [2025-03-16 20:51:30,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:30,879 INFO L225 Difference]: With dead ends: 1449 [2025-03-16 20:51:30,879 INFO L226 Difference]: Without dead ends: 780 [2025-03-16 20:51:30,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:51:30,880 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 0 mSDsluCounter, 2527 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3377 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:30,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3377 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:51:30,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-03-16 20:51:30,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 776. [2025-03-16 20:51:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 775 states have (on average 1.486451612903226) internal successors, (1152), 775 states have internal predecessors, (1152), 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-03-16 20:51:30,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1152 transitions. [2025-03-16 20:51:30,899 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1152 transitions. Word has length 97 [2025-03-16 20:51:30,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:30,899 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1152 transitions. [2025-03-16 20:51:30,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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-03-16 20:51:30,900 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1152 transitions. [2025-03-16 20:51:30,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 20:51:30,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:30,901 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:51:30,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:51:30,901 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:30,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:30,902 INFO L85 PathProgramCache]: Analyzing trace with hash -143893123, now seen corresponding path program 1 times [2025-03-16 20:51:30,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:30,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785733924] [2025-03-16 20:51:30,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:30,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:30,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 20:51:30,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 20:51:30,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:30,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:31,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:31,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:31,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785733924] [2025-03-16 20:51:31,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785733924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:31,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:31,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:51:31,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200445602] [2025-03-16 20:51:31,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:31,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:51:31,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:31,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:51:31,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:51:31,201 INFO L87 Difference]: Start difference. First operand 776 states and 1152 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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-03-16 20:51:31,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:31,720 INFO L93 Difference]: Finished difference Result 1994 states and 2960 transitions. [2025-03-16 20:51:31,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:51:31,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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 98 [2025-03-16 20:51:31,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:31,724 INFO L225 Difference]: With dead ends: 1994 [2025-03-16 20:51:31,724 INFO L226 Difference]: Without dead ends: 1325 [2025-03-16 20:51:31,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:51:31,726 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 897 mSDsluCounter, 3326 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 4174 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:31,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 4174 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:51:31,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2025-03-16 20:51:31,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 790. [2025-03-16 20:51:31,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 1.4866920152091254) internal successors, (1173), 789 states have internal predecessors, (1173), 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-03-16 20:51:31,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1173 transitions. [2025-03-16 20:51:31,739 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1173 transitions. Word has length 98 [2025-03-16 20:51:31,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:31,739 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1173 transitions. [2025-03-16 20:51:31,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 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-03-16 20:51:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1173 transitions. [2025-03-16 20:51:31,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-16 20:51:31,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:31,743 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:51:31,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:51:31,744 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:31,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:31,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1569502519, now seen corresponding path program 1 times [2025-03-16 20:51:31,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:31,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31219038] [2025-03-16 20:51:31,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:31,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:31,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-16 20:51:31,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-16 20:51:31,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:31,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:32,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:32,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31219038] [2025-03-16 20:51:32,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31219038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:32,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:32,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:51:32,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38263421] [2025-03-16 20:51:32,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:32,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:51:32,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:32,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:51:32,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:51:32,362 INFO L87 Difference]: Start difference. First operand 790 states and 1173 transitions. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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-03-16 20:51:32,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:32,559 INFO L93 Difference]: Finished difference Result 1460 states and 2168 transitions. [2025-03-16 20:51:32,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:51:32,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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 403 [2025-03-16 20:51:32,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:32,562 INFO L225 Difference]: With dead ends: 1460 [2025-03-16 20:51:32,562 INFO L226 Difference]: Without dead ends: 791 [2025-03-16 20:51:32,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:51:32,564 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:32,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1697 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:51:32,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2025-03-16 20:51:32,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 791. [2025-03-16 20:51:32,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 790 states have (on average 1.4860759493670885) internal successors, (1174), 790 states have internal predecessors, (1174), 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-03-16 20:51:32,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1174 transitions. [2025-03-16 20:51:32,575 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1174 transitions. Word has length 403 [2025-03-16 20:51:32,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:32,576 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1174 transitions. [2025-03-16 20:51:32,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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-03-16 20:51:32,576 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1174 transitions. [2025-03-16 20:51:32,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-16 20:51:32,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:32,580 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:51:32,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:51:32,580 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:32,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:32,581 INFO L85 PathProgramCache]: Analyzing trace with hash -145472808, now seen corresponding path program 1 times [2025-03-16 20:51:32,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:32,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734685712] [2025-03-16 20:51:32,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:32,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:32,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-16 20:51:32,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-16 20:51:32,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:32,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:33,154 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:33,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:33,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734685712] [2025-03-16 20:51:33,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734685712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:33,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:33,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:51:33,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292250050] [2025-03-16 20:51:33,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:33,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:51:33,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:33,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:51:33,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:51:33,156 INFO L87 Difference]: Start difference. First operand 791 states and 1174 transitions. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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-03-16 20:51:33,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:33,366 INFO L93 Difference]: Finished difference Result 1462 states and 2170 transitions. [2025-03-16 20:51:33,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:51:33,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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 403 [2025-03-16 20:51:33,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:33,369 INFO L225 Difference]: With dead ends: 1462 [2025-03-16 20:51:33,369 INFO L226 Difference]: Without dead ends: 792 [2025-03-16 20:51:33,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:51:33,370 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:33,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1697 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:51:33,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-03-16 20:51:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 792. [2025-03-16 20:51:33,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 791 states have (on average 1.4854614412136535) internal successors, (1175), 791 states have internal predecessors, (1175), 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-03-16 20:51:33,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1175 transitions. [2025-03-16 20:51:33,384 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1175 transitions. Word has length 403 [2025-03-16 20:51:33,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:33,384 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1175 transitions. [2025-03-16 20:51:33,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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-03-16 20:51:33,385 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1175 transitions. [2025-03-16 20:51:33,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-16 20:51:33,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:33,389 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:51:33,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:51:33,390 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:33,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:33,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1156882745, now seen corresponding path program 1 times [2025-03-16 20:51:33,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:33,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092058532] [2025-03-16 20:51:33,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:33,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:33,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-16 20:51:33,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-16 20:51:33,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:33,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:33,927 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:33,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:33,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092058532] [2025-03-16 20:51:33,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092058532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:33,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:33,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:51:33,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139515163] [2025-03-16 20:51:33,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:33,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:51:33,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:33,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:51:33,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:51:33,931 INFO L87 Difference]: Start difference. First operand 792 states and 1175 transitions. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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-03-16 20:51:34,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:34,127 INFO L93 Difference]: Finished difference Result 1464 states and 2172 transitions. [2025-03-16 20:51:34,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:51:34,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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 403 [2025-03-16 20:51:34,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:34,130 INFO L225 Difference]: With dead ends: 1464 [2025-03-16 20:51:34,130 INFO L226 Difference]: Without dead ends: 793 [2025-03-16 20:51:34,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:51:34,131 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:34,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1697 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:51:34,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2025-03-16 20:51:34,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 793. [2025-03-16 20:51:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 792 states have (on average 1.4848484848484849) internal successors, (1176), 792 states have internal predecessors, (1176), 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-03-16 20:51:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1176 transitions. [2025-03-16 20:51:34,142 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1176 transitions. Word has length 403 [2025-03-16 20:51:34,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:34,142 INFO L471 AbstractCegarLoop]: Abstraction has 793 states and 1176 transitions. [2025-03-16 20:51:34,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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-03-16 20:51:34,143 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1176 transitions. [2025-03-16 20:51:34,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-16 20:51:34,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:34,146 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:51:34,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:51:34,146 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:34,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:34,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1930867366, now seen corresponding path program 1 times [2025-03-16 20:51:34,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:34,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241352154] [2025-03-16 20:51:34,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:34,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:34,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-16 20:51:34,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-16 20:51:34,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:34,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:34,595 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:34,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:34,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241352154] [2025-03-16 20:51:34,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241352154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:34,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:34,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:51:34,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177225858] [2025-03-16 20:51:34,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:34,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:51:34,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:34,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:51:34,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:51:34,598 INFO L87 Difference]: Start difference. First operand 793 states and 1176 transitions. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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-03-16 20:51:34,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:34,790 INFO L93 Difference]: Finished difference Result 1466 states and 2174 transitions. [2025-03-16 20:51:34,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:51:34,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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 403 [2025-03-16 20:51:34,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:34,793 INFO L225 Difference]: With dead ends: 1466 [2025-03-16 20:51:34,793 INFO L226 Difference]: Without dead ends: 794 [2025-03-16 20:51:34,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:51:34,795 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:34,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1697 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:51:34,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2025-03-16 20:51:34,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2025-03-16 20:51:34,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 1.484237074401009) internal successors, (1177), 793 states have internal predecessors, (1177), 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-03-16 20:51:34,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1177 transitions. [2025-03-16 20:51:34,806 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1177 transitions. Word has length 403 [2025-03-16 20:51:34,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:34,806 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1177 transitions. [2025-03-16 20:51:34,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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-03-16 20:51:34,807 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1177 transitions. [2025-03-16 20:51:34,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-16 20:51:34,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:34,810 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:51:34,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:51:34,810 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:34,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:34,811 INFO L85 PathProgramCache]: Analyzing trace with hash -473770757, now seen corresponding path program 1 times [2025-03-16 20:51:34,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:34,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673337609] [2025-03-16 20:51:34,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:34,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:34,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-16 20:51:34,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-16 20:51:34,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:34,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-16 20:51:35,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:35,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673337609] [2025-03-16 20:51:35,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673337609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:35,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:35,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:51:35,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914697305] [2025-03-16 20:51:35,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:35,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:51:35,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:35,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:51:35,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:51:35,367 INFO L87 Difference]: Start difference. First operand 794 states and 1177 transitions. Second operand has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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-03-16 20:51:35,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:35,643 INFO L93 Difference]: Finished difference Result 1469 states and 2177 transitions. [2025-03-16 20:51:35,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:51:35,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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 403 [2025-03-16 20:51:35,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:35,647 INFO L225 Difference]: With dead ends: 1469 [2025-03-16 20:51:35,647 INFO L226 Difference]: Without dead ends: 796 [2025-03-16 20:51:35,648 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-03-16 20:51:35,650 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 0 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2540 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:35,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2540 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:51:35,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-03-16 20:51:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 796. [2025-03-16 20:51:35,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 795 states have (on average 1.4830188679245282) internal successors, (1179), 795 states have internal predecessors, (1179), 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-03-16 20:51:35,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1179 transitions. [2025-03-16 20:51:35,667 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1179 transitions. Word has length 403 [2025-03-16 20:51:35,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:35,668 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1179 transitions. [2025-03-16 20:51:35,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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-03-16 20:51:35,669 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1179 transitions. [2025-03-16 20:51:35,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-03-16 20:51:35,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:35,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:51:35,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 20:51:35,673 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:35,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:35,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1832902895, now seen corresponding path program 1 times [2025-03-16 20:51:35,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:35,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144548584] [2025-03-16 20:51:35,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:35,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:35,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-16 20:51:35,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-16 20:51:35,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:35,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 34 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:36,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:36,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144548584] [2025-03-16 20:51:36,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144548584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:51:36,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294510494] [2025-03-16 20:51:36,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:36,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:36,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:36,306 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:51:36,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 20:51:36,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-16 20:51:36,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-16 20:51:36,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:36,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:36,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 1709 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 20:51:36,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:51:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 20:51:36,989 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:51:36,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294510494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:36,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:51:36,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-03-16 20:51:36,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905353810] [2025-03-16 20:51:36,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:36,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:51:36,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:36,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:51:36,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:51:36,994 INFO L87 Difference]: Start difference. First operand 796 states and 1179 transitions. Second operand has 6 states, 6 states have (on average 65.33333333333333) internal successors, (392), 5 states have internal predecessors, (392), 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-03-16 20:51:37,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:37,944 INFO L93 Difference]: Finished difference Result 2028 states and 3002 transitions. [2025-03-16 20:51:37,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:51:37,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 65.33333333333333) internal successors, (392), 5 states have internal predecessors, (392), 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 404 [2025-03-16 20:51:37,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:37,949 INFO L225 Difference]: With dead ends: 2028 [2025-03-16 20:51:37,950 INFO L226 Difference]: Without dead ends: 1353 [2025-03-16 20:51:37,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:51:37,952 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 910 mSDsluCounter, 2828 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 3555 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:37,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 3555 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 20:51:37,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2025-03-16 20:51:37,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 798. [2025-03-16 20:51:37,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 797 states have (on average 1.480552070263488) internal successors, (1180), 797 states have internal predecessors, (1180), 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-03-16 20:51:37,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1180 transitions. [2025-03-16 20:51:37,967 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1180 transitions. Word has length 404 [2025-03-16 20:51:37,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:37,967 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1180 transitions. [2025-03-16 20:51:37,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.33333333333333) internal successors, (392), 5 states have internal predecessors, (392), 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-03-16 20:51:37,967 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1180 transitions. [2025-03-16 20:51:37,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-03-16 20:51:37,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:37,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:51:37,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 20:51:38,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-16 20:51:38,172 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:38,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:38,172 INFO L85 PathProgramCache]: Analyzing trace with hash -465012307, now seen corresponding path program 1 times [2025-03-16 20:51:38,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:38,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660820360] [2025-03-16 20:51:38,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:38,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:38,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-16 20:51:38,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-16 20:51:38,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:38,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:38,854 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 35 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:38,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:38,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660820360] [2025-03-16 20:51:38,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660820360] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:51:38,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912298334] [2025-03-16 20:51:38,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:38,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:38,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:38,857 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:51:38,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 20:51:39,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-16 20:51:39,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-16 20:51:39,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:39,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:39,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 1712 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 20:51:39,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:51:39,549 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 20:51:39,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:51:39,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912298334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:39,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:51:39,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-03-16 20:51:39,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077981886] [2025-03-16 20:51:39,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:39,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:51:39,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:39,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:51:39,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:51:39,551 INFO L87 Difference]: Start difference. First operand 798 states and 1180 transitions. Second operand has 6 states, 6 states have (on average 66.0) internal successors, (396), 5 states have internal predecessors, (396), 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-03-16 20:51:40,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:40,221 INFO L93 Difference]: Finished difference Result 2036 states and 3012 transitions. [2025-03-16 20:51:40,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:51:40,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 66.0) internal successors, (396), 5 states have internal predecessors, (396), 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 405 [2025-03-16 20:51:40,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:40,227 INFO L225 Difference]: With dead ends: 2036 [2025-03-16 20:51:40,227 INFO L226 Difference]: Without dead ends: 1361 [2025-03-16 20:51:40,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:51:40,229 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 1759 mSDsluCounter, 2206 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 2934 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:40,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1759 Valid, 2934 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:51:40,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2025-03-16 20:51:40,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 806. [2025-03-16 20:51:40,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 805 states have (on average 1.4770186335403728) internal successors, (1189), 805 states have internal predecessors, (1189), 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-03-16 20:51:40,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1189 transitions. [2025-03-16 20:51:40,242 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1189 transitions. Word has length 405 [2025-03-16 20:51:40,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:40,242 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1189 transitions. [2025-03-16 20:51:40,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.0) internal successors, (396), 5 states have internal predecessors, (396), 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-03-16 20:51:40,243 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1189 transitions. [2025-03-16 20:51:40,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-03-16 20:51:40,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:40,246 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:51:40,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 20:51:40,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-16 20:51:40,447 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:40,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:40,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1011262624, now seen corresponding path program 1 times [2025-03-16 20:51:40,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:40,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886641446] [2025-03-16 20:51:40,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:40,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:40,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-16 20:51:40,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-16 20:51:40,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:40,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:41,035 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:41,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:41,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886641446] [2025-03-16 20:51:41,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886641446] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:51:41,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678415907] [2025-03-16 20:51:41,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:41,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:41,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:41,041 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:51:41,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 20:51:41,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-16 20:51:41,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-16 20:51:41,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:41,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:41,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 1715 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-16 20:51:41,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:51:41,790 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:41,790 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:51:41,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678415907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:41,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:51:41,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 15 [2025-03-16 20:51:41,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660383506] [2025-03-16 20:51:41,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:41,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:51:41,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:41,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:51:41,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:51:41,792 INFO L87 Difference]: Start difference. First operand 806 states and 1189 transitions. Second operand has 10 states, 10 states have (on average 40.6) internal successors, (406), 9 states have internal predecessors, (406), 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-03-16 20:51:42,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:42,625 INFO L93 Difference]: Finished difference Result 1501 states and 2218 transitions. [2025-03-16 20:51:42,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:51:42,625 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 40.6) internal successors, (406), 9 states have internal predecessors, (406), 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 406 [2025-03-16 20:51:42,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:42,628 INFO L225 Difference]: With dead ends: 1501 [2025-03-16 20:51:42,628 INFO L226 Difference]: Without dead ends: 826 [2025-03-16 20:51:42,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:51:42,629 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 863 mSDsluCounter, 4521 mSDsCounter, 0 mSdLazyCounter, 3005 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 5170 SdHoareTripleChecker+Invalid, 3007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:42,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 5170 Invalid, 3007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3005 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 20:51:42,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2025-03-16 20:51:42,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 822. [2025-03-16 20:51:42,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 821 states have (on average 1.4750304506699148) internal successors, (1211), 821 states have internal predecessors, (1211), 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-03-16 20:51:42,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1211 transitions. [2025-03-16 20:51:42,638 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1211 transitions. Word has length 406 [2025-03-16 20:51:42,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:42,638 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1211 transitions. [2025-03-16 20:51:42,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 40.6) internal successors, (406), 9 states have internal predecessors, (406), 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-03-16 20:51:42,638 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1211 transitions. [2025-03-16 20:51:42,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-03-16 20:51:42,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:42,640 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:51:42,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 20:51:42,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:42,841 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:42,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:42,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1732295007, now seen corresponding path program 1 times [2025-03-16 20:51:42,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:42,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114428455] [2025-03-16 20:51:42,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:42,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:42,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-16 20:51:42,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-16 20:51:42,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:42,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:43,247 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:43,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:43,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114428455] [2025-03-16 20:51:43,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114428455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:43,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:43,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:51:43,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046838253] [2025-03-16 20:51:43,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:43,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:51:43,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:43,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:51:43,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:51:43,250 INFO L87 Difference]: Start difference. First operand 822 states and 1211 transitions. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 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-03-16 20:51:43,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:43,483 INFO L93 Difference]: Finished difference Result 1516 states and 2237 transitions. [2025-03-16 20:51:43,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:51:43,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 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 407 [2025-03-16 20:51:43,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:43,485 INFO L225 Difference]: With dead ends: 1516 [2025-03-16 20:51:43,485 INFO L226 Difference]: Without dead ends: 825 [2025-03-16 20:51:43,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:51:43,486 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 8 mSDsluCounter, 2538 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3387 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:43,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3387 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:51:43,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2025-03-16 20:51:43,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 825. [2025-03-16 20:51:43,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 824 states have (on average 1.4733009708737863) internal successors, (1214), 824 states have internal predecessors, (1214), 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-03-16 20:51:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1214 transitions. [2025-03-16 20:51:43,499 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1214 transitions. Word has length 407 [2025-03-16 20:51:43,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:43,499 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1214 transitions. [2025-03-16 20:51:43,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 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-03-16 20:51:43,499 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1214 transitions. [2025-03-16 20:51:43,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-03-16 20:51:43,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:43,501 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:51:43,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 20:51:43,502 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:43,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:43,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1338332966, now seen corresponding path program 1 times [2025-03-16 20:51:43,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:43,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666075762] [2025-03-16 20:51:43,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:43,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:43,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-16 20:51:43,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-16 20:51:43,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:43,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:43,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:43,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666075762] [2025-03-16 20:51:43,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666075762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:43,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:43,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:51:43,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999689599] [2025-03-16 20:51:43,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:43,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:51:43,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:43,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:51:43,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:51:43,923 INFO L87 Difference]: Start difference. First operand 825 states and 1214 transitions. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 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-03-16 20:51:44,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:44,225 INFO L93 Difference]: Finished difference Result 1967 states and 2889 transitions. [2025-03-16 20:51:44,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:51:44,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 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 407 [2025-03-16 20:51:44,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:44,228 INFO L225 Difference]: With dead ends: 1967 [2025-03-16 20:51:44,229 INFO L226 Difference]: Without dead ends: 1273 [2025-03-16 20:51:44,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:51:44,230 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 348 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 3371 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:44,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 3371 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:51:44,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2025-03-16 20:51:44,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1263. [2025-03-16 20:51:44,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 1262 states have (on average 1.4675118858954042) internal successors, (1852), 1262 states have internal predecessors, (1852), 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-03-16 20:51:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1852 transitions. [2025-03-16 20:51:44,245 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1852 transitions. Word has length 407 [2025-03-16 20:51:44,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:44,245 INFO L471 AbstractCegarLoop]: Abstraction has 1263 states and 1852 transitions. [2025-03-16 20:51:44,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 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-03-16 20:51:44,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1852 transitions. [2025-03-16 20:51:44,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-03-16 20:51:44,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:44,248 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:51:44,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 20:51:44,248 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:44,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:44,249 INFO L85 PathProgramCache]: Analyzing trace with hash -173645936, now seen corresponding path program 1 times [2025-03-16 20:51:44,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:44,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293589836] [2025-03-16 20:51:44,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:44,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:44,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-16 20:51:44,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-16 20:51:44,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:44,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:44,743 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:44,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:44,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293589836] [2025-03-16 20:51:44,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293589836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:44,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:44,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:51:44,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103271124] [2025-03-16 20:51:44,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:44,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:51:44,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:44,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:51:44,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:51:44,746 INFO L87 Difference]: Start difference. First operand 1263 states and 1852 transitions. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 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-03-16 20:51:45,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:45,012 INFO L93 Difference]: Finished difference Result 3193 states and 4680 transitions. [2025-03-16 20:51:45,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:51:45,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 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 407 [2025-03-16 20:51:45,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:45,017 INFO L225 Difference]: With dead ends: 3193 [2025-03-16 20:51:45,017 INFO L226 Difference]: Without dead ends: 2123 [2025-03-16 20:51:45,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:51:45,018 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 338 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 3371 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:45,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 3371 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:51:45,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2025-03-16 20:51:45,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2119. [2025-03-16 20:51:45,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2119 states, 2118 states have (on average 1.4636449480642115) internal successors, (3100), 2118 states have internal predecessors, (3100), 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-03-16 20:51:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 2119 states and 3100 transitions. [2025-03-16 20:51:45,038 INFO L78 Accepts]: Start accepts. Automaton has 2119 states and 3100 transitions. Word has length 407 [2025-03-16 20:51:45,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:45,038 INFO L471 AbstractCegarLoop]: Abstraction has 2119 states and 3100 transitions. [2025-03-16 20:51:45,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 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-03-16 20:51:45,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 3100 transitions. [2025-03-16 20:51:45,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-16 20:51:45,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:45,042 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:51:45,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 20:51:45,043 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:45,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:45,043 INFO L85 PathProgramCache]: Analyzing trace with hash -515276241, now seen corresponding path program 1 times [2025-03-16 20:51:45,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:45,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012668179] [2025-03-16 20:51:45,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:45,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:45,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-16 20:51:45,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-16 20:51:45,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:45,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:45,506 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:45,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:45,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012668179] [2025-03-16 20:51:45,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012668179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:51:45,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299074413] [2025-03-16 20:51:45,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:45,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:45,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:45,509 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:51:45,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 20:51:45,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-16 20:51:46,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-16 20:51:46,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:46,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:46,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 1719 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-16 20:51:46,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:51:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:46,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:51:46,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299074413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:46,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:51:46,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-03-16 20:51:46,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781671254] [2025-03-16 20:51:46,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:46,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:51:46,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:46,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:51:46,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:51:46,217 INFO L87 Difference]: Start difference. First operand 2119 states and 3100 transitions. Second operand has 5 states, 5 states have (on average 81.6) internal successors, (408), 4 states have internal predecessors, (408), 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-03-16 20:51:46,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:46,813 INFO L93 Difference]: Finished difference Result 3917 states and 5743 transitions. [2025-03-16 20:51:46,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:51:46,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 81.6) internal successors, (408), 4 states have internal predecessors, (408), 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 408 [2025-03-16 20:51:46,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:46,820 INFO L225 Difference]: With dead ends: 3917 [2025-03-16 20:51:46,821 INFO L226 Difference]: Without dead ends: 2119 [2025-03-16 20:51:46,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:51:46,822 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 918 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:46,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1948 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:51:46,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2025-03-16 20:51:46,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 2119. [2025-03-16 20:51:46,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2119 states, 2118 states have (on average 1.4598677998111427) internal successors, (3092), 2118 states have internal predecessors, (3092), 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-03-16 20:51:46,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 2119 states and 3092 transitions. [2025-03-16 20:51:46,841 INFO L78 Accepts]: Start accepts. Automaton has 2119 states and 3092 transitions. Word has length 408 [2025-03-16 20:51:46,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:46,842 INFO L471 AbstractCegarLoop]: Abstraction has 2119 states and 3092 transitions. [2025-03-16 20:51:46,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.6) internal successors, (408), 4 states have internal predecessors, (408), 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-03-16 20:51:46,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 3092 transitions. [2025-03-16 20:51:46,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-03-16 20:51:46,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:46,846 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:51:46,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 20:51:47,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-16 20:51:47,047 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:47,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:47,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1641438832, now seen corresponding path program 1 times [2025-03-16 20:51:47,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:47,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779330805] [2025-03-16 20:51:47,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:47,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:47,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-03-16 20:51:47,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-03-16 20:51:47,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:47,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:47,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:47,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779330805] [2025-03-16 20:51:47,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779330805] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:51:47,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143141305] [2025-03-16 20:51:47,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:47,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:47,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:47,536 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:51:47,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 20:51:47,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-03-16 20:51:47,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-03-16 20:51:47,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:47,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:47,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 1723 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 20:51:47,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:51:48,223 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:48,224 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:51:48,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143141305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:48,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:51:48,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2025-03-16 20:51:48,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726853485] [2025-03-16 20:51:48,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:48,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:51:48,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:48,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:51:48,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:51:48,225 INFO L87 Difference]: Start difference. First operand 2119 states and 3092 transitions. Second operand has 6 states, 6 states have (on average 68.33333333333333) internal successors, (410), 6 states have internal predecessors, (410), 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-03-16 20:51:48,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:48,748 INFO L93 Difference]: Finished difference Result 5879 states and 8532 transitions. [2025-03-16 20:51:48,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:51:48,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 68.33333333333333) internal successors, (410), 6 states have internal predecessors, (410), 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 410 [2025-03-16 20:51:48,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:48,755 INFO L225 Difference]: With dead ends: 5879 [2025-03-16 20:51:48,755 INFO L226 Difference]: Without dead ends: 4081 [2025-03-16 20:51:48,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:51:48,758 INFO L435 NwaCegarLoop]: 1081 mSDtfsCounter, 1055 mSDsluCounter, 2897 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 3978 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:48,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 3978 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:51:48,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4081 states. [2025-03-16 20:51:48,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4081 to 2951. [2025-03-16 20:51:48,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2951 states, 2950 states have (on average 1.4440677966101696) internal successors, (4260), 2950 states have internal predecessors, (4260), 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-03-16 20:51:48,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 4260 transitions. [2025-03-16 20:51:48,787 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 4260 transitions. Word has length 410 [2025-03-16 20:51:48,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:48,787 INFO L471 AbstractCegarLoop]: Abstraction has 2951 states and 4260 transitions. [2025-03-16 20:51:48,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.33333333333333) internal successors, (410), 6 states have internal predecessors, (410), 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-03-16 20:51:48,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 4260 transitions. [2025-03-16 20:51:48,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-03-16 20:51:48,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:48,793 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:51:48,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 20:51:48,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-16 20:51:48,994 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:48,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:48,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1452819557, now seen corresponding path program 1 times [2025-03-16 20:51:48,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:48,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282539826] [2025-03-16 20:51:48,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:48,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:49,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-03-16 20:51:49,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-03-16 20:51:49,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:49,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:49,498 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:49,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:49,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282539826] [2025-03-16 20:51:49,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282539826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:51:49,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010072844] [2025-03-16 20:51:49,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:49,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:49,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:49,500 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:51:49,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 20:51:49,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-03-16 20:51:50,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-03-16 20:51:50,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:50,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:50,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 1726 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 20:51:50,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:51:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 20:51:50,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:51:50,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010072844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:50,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:51:50,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2025-03-16 20:51:50,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146586580] [2025-03-16 20:51:50,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:50,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:51:50,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:50,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:51:50,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:51:50,251 INFO L87 Difference]: Start difference. First operand 2951 states and 4260 transitions. Second operand has 6 states, 6 states have (on average 67.33333333333333) internal successors, (404), 5 states have internal predecessors, (404), 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-03-16 20:51:50,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:50,830 INFO L93 Difference]: Finished difference Result 7093 states and 10262 transitions. [2025-03-16 20:51:50,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:51:50,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 67.33333333333333) internal successors, (404), 5 states have internal predecessors, (404), 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 411 [2025-03-16 20:51:50,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:50,838 INFO L225 Difference]: With dead ends: 7093 [2025-03-16 20:51:50,839 INFO L226 Difference]: Without dead ends: 4631 [2025-03-16 20:51:50,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:51:50,842 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 1754 mSDsluCounter, 2205 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1754 SdHoareTripleChecker+Valid, 2934 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:50,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1754 Valid, 2934 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:51:50,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2025-03-16 20:51:50,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 2999. [2025-03-16 20:51:50,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2999 states, 2998 states have (on average 1.4396264176117413) internal successors, (4316), 2998 states have internal predecessors, (4316), 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-03-16 20:51:50,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 4316 transitions. [2025-03-16 20:51:50,884 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 4316 transitions. Word has length 411 [2025-03-16 20:51:50,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:50,884 INFO L471 AbstractCegarLoop]: Abstraction has 2999 states and 4316 transitions. [2025-03-16 20:51:50,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.33333333333333) internal successors, (404), 5 states have internal predecessors, (404), 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-03-16 20:51:50,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 4316 transitions. [2025-03-16 20:51:50,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-03-16 20:51:50,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:50,888 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:51:50,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 20:51:51,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-16 20:51:51,089 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:51,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:51,090 INFO L85 PathProgramCache]: Analyzing trace with hash -36034788, now seen corresponding path program 1 times [2025-03-16 20:51:51,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:51,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712624335] [2025-03-16 20:51:51,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:51,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:51,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-16 20:51:51,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-16 20:51:51,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:51,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:51,560 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 37 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:51,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:51,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712624335] [2025-03-16 20:51:51,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712624335] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:51:51,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824336015] [2025-03-16 20:51:51,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:51,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:51,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:51,562 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:51:51,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 20:51:51,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-16 20:51:52,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-16 20:51:52,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:52,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:52,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 1729 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-16 20:51:52,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:51:52,597 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:52,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:51:52,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824336015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:52,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:51:52,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2025-03-16 20:51:52,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935247357] [2025-03-16 20:51:52,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:52,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:51:52,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:52,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:51:52,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:51:52,599 INFO L87 Difference]: Start difference. First operand 2999 states and 4316 transitions. Second operand has 10 states, 10 states have (on average 41.2) internal successors, (412), 10 states have internal predecessors, (412), 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-03-16 20:51:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:53,540 INFO L93 Difference]: Finished difference Result 7163 states and 10352 transitions. [2025-03-16 20:51:53,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:51:53,540 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 41.2) internal successors, (412), 10 states have internal predecessors, (412), 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 412 [2025-03-16 20:51:53,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:53,546 INFO L225 Difference]: With dead ends: 7163 [2025-03-16 20:51:53,546 INFO L226 Difference]: Without dead ends: 4701 [2025-03-16 20:51:53,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:51:53,548 INFO L435 NwaCegarLoop]: 1009 mSDtfsCounter, 1506 mSDsluCounter, 4030 mSDsCounter, 0 mSdLazyCounter, 2729 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 5039 SdHoareTripleChecker+Invalid, 2732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:53,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 5039 Invalid, 2732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2729 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 20:51:53,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4701 states. [2025-03-16 20:51:53,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4701 to 3927. [2025-03-16 20:51:53,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3927 states, 3926 states have (on average 1.4304635761589404) internal successors, (5616), 3926 states have internal predecessors, (5616), 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-03-16 20:51:53,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3927 states to 3927 states and 5616 transitions. [2025-03-16 20:51:53,576 INFO L78 Accepts]: Start accepts. Automaton has 3927 states and 5616 transitions. Word has length 412 [2025-03-16 20:51:53,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:53,577 INFO L471 AbstractCegarLoop]: Abstraction has 3927 states and 5616 transitions. [2025-03-16 20:51:53,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 41.2) internal successors, (412), 10 states have internal predecessors, (412), 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-03-16 20:51:53,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3927 states and 5616 transitions. [2025-03-16 20:51:53,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-03-16 20:51:53,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:53,582 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:51:53,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 20:51:53,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:53,782 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:53,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:53,783 INFO L85 PathProgramCache]: Analyzing trace with hash -583043407, now seen corresponding path program 1 times [2025-03-16 20:51:53,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:53,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786221088] [2025-03-16 20:51:53,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:53,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:53,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-16 20:51:53,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-16 20:51:53,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:53,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:54,286 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 37 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:54,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:54,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786221088] [2025-03-16 20:51:54,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786221088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:51:54,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042283688] [2025-03-16 20:51:54,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:54,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:54,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:54,290 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:51:54,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 20:51:54,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-16 20:51:54,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-16 20:51:54,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:54,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:54,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 1729 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 20:51:54,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:51:55,167 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:55,168 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:51:55,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042283688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:55,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:51:55,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2025-03-16 20:51:55,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592670163] [2025-03-16 20:51:55,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:55,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:51:55,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:55,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:51:55,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:51:55,169 INFO L87 Difference]: Start difference. First operand 3927 states and 5616 transitions. Second operand has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 6 states have internal predecessors, (412), 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-03-16 20:51:55,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:55,802 INFO L93 Difference]: Finished difference Result 7984 states and 11508 transitions. [2025-03-16 20:51:55,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:51:55,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 6 states have internal predecessors, (412), 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 412 [2025-03-16 20:51:55,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:55,809 INFO L225 Difference]: With dead ends: 7984 [2025-03-16 20:51:55,809 INFO L226 Difference]: Without dead ends: 4786 [2025-03-16 20:51:55,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:51:55,813 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 1203 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 1516 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 2635 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:55,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 2635 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1516 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:51:55,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4786 states. [2025-03-16 20:51:55,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4786 to 4784. [2025-03-16 20:51:55,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4784 states, 4783 states have (on average 1.4394731340163078) internal successors, (6885), 4783 states have internal predecessors, (6885), 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-03-16 20:51:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4784 states to 4784 states and 6885 transitions. [2025-03-16 20:51:55,865 INFO L78 Accepts]: Start accepts. Automaton has 4784 states and 6885 transitions. Word has length 412 [2025-03-16 20:51:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:55,866 INFO L471 AbstractCegarLoop]: Abstraction has 4784 states and 6885 transitions. [2025-03-16 20:51:55,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 6 states have internal predecessors, (412), 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-03-16 20:51:55,867 INFO L276 IsEmpty]: Start isEmpty. Operand 4784 states and 6885 transitions. [2025-03-16 20:51:55,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-03-16 20:51:55,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:55,872 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:51:55,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 20:51:56,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-16 20:51:56,073 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:56,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:56,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1230389163, now seen corresponding path program 1 times [2025-03-16 20:51:56,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:56,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623825031] [2025-03-16 20:51:56,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:56,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:56,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-16 20:51:56,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-16 20:51:56,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:56,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:56,655 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 37 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:56,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:56,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623825031] [2025-03-16 20:51:56,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623825031] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:51:56,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812820820] [2025-03-16 20:51:56,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:56,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:56,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:56,658 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:51:56,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 20:51:56,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-16 20:51:57,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-16 20:51:57,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:57,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:57,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 1732 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 20:51:57,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:51:57,341 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:57,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:51:57,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812820820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:57,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:51:57,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2025-03-16 20:51:57,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399370471] [2025-03-16 20:51:57,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:57,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:51:57,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:57,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:51:57,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:51:57,343 INFO L87 Difference]: Start difference. First operand 4784 states and 6885 transitions. Second operand has 6 states, 6 states have (on average 68.83333333333333) internal successors, (413), 6 states have internal predecessors, (413), 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-03-16 20:51:57,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:57,829 INFO L93 Difference]: Finished difference Result 13510 states and 19437 transitions. [2025-03-16 20:51:57,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:51:57,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 68.83333333333333) internal successors, (413), 6 states have internal predecessors, (413), 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 413 [2025-03-16 20:51:57,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:57,840 INFO L225 Difference]: With dead ends: 13510 [2025-03-16 20:51:57,840 INFO L226 Difference]: Without dead ends: 9455 [2025-03-16 20:51:57,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:51:57,845 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 1108 mSDsluCounter, 2337 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 3116 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:57,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1108 Valid, 3116 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:51:57,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9455 states. [2025-03-16 20:51:57,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9455 to 7240. [2025-03-16 20:51:57,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7240 states, 7239 states have (on average 1.4235391628677994) internal successors, (10305), 7239 states have internal predecessors, (10305), 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-03-16 20:51:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7240 states to 7240 states and 10305 transitions. [2025-03-16 20:51:57,917 INFO L78 Accepts]: Start accepts. Automaton has 7240 states and 10305 transitions. Word has length 413 [2025-03-16 20:51:57,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:57,918 INFO L471 AbstractCegarLoop]: Abstraction has 7240 states and 10305 transitions. [2025-03-16 20:51:57,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.83333333333333) internal successors, (413), 6 states have internal predecessors, (413), 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-03-16 20:51:57,918 INFO L276 IsEmpty]: Start isEmpty. Operand 7240 states and 10305 transitions. [2025-03-16 20:51:57,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-03-16 20:51:57,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:57,927 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:51:57,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-16 20:51:58,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:58,129 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:58,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:58,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1674439580, now seen corresponding path program 1 times [2025-03-16 20:51:58,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:58,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245783126] [2025-03-16 20:51:58,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:58,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:58,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-16 20:51:58,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-16 20:51:58,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:58,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:58,646 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 37 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:58,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:58,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245783126] [2025-03-16 20:51:58,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245783126] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:51:58,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564390095] [2025-03-16 20:51:58,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:58,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:58,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:58,649 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:51:58,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-16 20:51:58,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-16 20:51:59,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-16 20:51:59,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:59,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:59,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 1735 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 20:51:59,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:51:59,545 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:51:59,545 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:51:59,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564390095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:59,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:51:59,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2025-03-16 20:51:59,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196090134] [2025-03-16 20:51:59,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:59,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:51:59,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:59,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:51:59,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:51:59,547 INFO L87 Difference]: Start difference. First operand 7240 states and 10305 transitions. Second operand has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 states have internal predecessors, (414), 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-03-16 20:52:00,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:52:00,183 INFO L93 Difference]: Finished difference Result 15023 states and 21581 transitions. [2025-03-16 20:52:00,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:52:00,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 states have internal predecessors, (414), 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 414 [2025-03-16 20:52:00,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:52:00,193 INFO L225 Difference]: With dead ends: 15023 [2025-03-16 20:52:00,194 INFO L226 Difference]: Without dead ends: 9104 [2025-03-16 20:52:00,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:52:00,199 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 1485 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 2588 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:52:00,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 2588 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:52:00,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9104 states. [2025-03-16 20:52:00,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9104 to 9102. [2025-03-16 20:52:00,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9102 states, 9101 states have (on average 1.4351170201076804) internal successors, (13061), 9101 states have internal predecessors, (13061), 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-03-16 20:52:00,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9102 states to 9102 states and 13061 transitions. [2025-03-16 20:52:00,320 INFO L78 Accepts]: Start accepts. Automaton has 9102 states and 13061 transitions. Word has length 414 [2025-03-16 20:52:00,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:52:00,320 INFO L471 AbstractCegarLoop]: Abstraction has 9102 states and 13061 transitions. [2025-03-16 20:52:00,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 states have internal predecessors, (414), 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-03-16 20:52:00,320 INFO L276 IsEmpty]: Start isEmpty. Operand 9102 states and 13061 transitions. [2025-03-16 20:52:00,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-03-16 20:52:00,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:52:00,351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:52:00,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-16 20:52:00,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-16 20:52:00,552 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:52:00,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:52:00,553 INFO L85 PathProgramCache]: Analyzing trace with hash 540342757, now seen corresponding path program 1 times [2025-03-16 20:52:00,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:52:00,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123666112] [2025-03-16 20:52:00,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:52:00,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:52:00,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-16 20:52:00,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-16 20:52:00,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:52:00,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:52:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 37 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:52:01,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:52:01,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123666112] [2025-03-16 20:52:01,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123666112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:52:01,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294074732] [2025-03-16 20:52:01,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:52:01,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:52:01,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:52:01,014 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:52:01,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-16 20:52:01,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-16 20:52:01,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-16 20:52:01,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:52:01,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:52:01,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 1735 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 20:52:01,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:52:01,768 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:52:01,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:52:01,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294074732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:52:01,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:52:01,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2025-03-16 20:52:01,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628054338] [2025-03-16 20:52:01,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:52:01,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:52:01,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:52:01,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:52:01,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:52:01,769 INFO L87 Difference]: Start difference. First operand 9102 states and 13061 transitions. Second operand has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 states have internal predecessors, (414), 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-03-16 20:52:02,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:52:02,389 INFO L93 Difference]: Finished difference Result 25260 states and 36331 transitions. [2025-03-16 20:52:02,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:52:02,390 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 states have internal predecessors, (414), 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 414 [2025-03-16 20:52:02,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:52:02,406 INFO L225 Difference]: With dead ends: 25260 [2025-03-16 20:52:02,406 INFO L226 Difference]: Without dead ends: 17479 [2025-03-16 20:52:02,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:52:02,417 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 2050 mSDsluCounter, 1940 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2050 SdHoareTripleChecker+Valid, 2590 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:52:02,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2050 Valid, 2590 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:52:02,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17479 states. [2025-03-16 20:52:02,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17479 to 14454. [2025-03-16 20:52:02,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14454 states, 14453 states have (on average 1.4212274268317997) internal successors, (20541), 14453 states have internal predecessors, (20541), 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-03-16 20:52:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14454 states to 14454 states and 20541 transitions. [2025-03-16 20:52:02,593 INFO L78 Accepts]: Start accepts. Automaton has 14454 states and 20541 transitions. Word has length 414 [2025-03-16 20:52:02,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:52:02,593 INFO L471 AbstractCegarLoop]: Abstraction has 14454 states and 20541 transitions. [2025-03-16 20:52:02,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 states have internal predecessors, (414), 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-03-16 20:52:02,593 INFO L276 IsEmpty]: Start isEmpty. Operand 14454 states and 20541 transitions. [2025-03-16 20:52:02,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-03-16 20:52:02,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:52:02,611 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:52:02,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-16 20:52:02,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-16 20:52:02,812 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:52:02,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:52:02,814 INFO L85 PathProgramCache]: Analyzing trace with hash 357391904, now seen corresponding path program 1 times [2025-03-16 20:52:02,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:52:02,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133291693] [2025-03-16 20:52:02,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:52:02,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:52:02,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-16 20:52:02,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-16 20:52:02,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:52:02,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:52:03,318 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 37 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:52:03,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:52:03,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133291693] [2025-03-16 20:52:03,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133291693] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:52:03,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212090791] [2025-03-16 20:52:03,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:52:03,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:52:03,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:52:03,320 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:52:03,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-16 20:52:03,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-16 20:52:03,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-16 20:52:03,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:52:03,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:52:03,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 1735 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 20:52:03,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:52:04,207 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:52:04,207 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:52:04,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212090791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:52:04,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:52:04,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2025-03-16 20:52:04,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850182329] [2025-03-16 20:52:04,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:52:04,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:52:04,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:52:04,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:52:04,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:52:04,208 INFO L87 Difference]: Start difference. First operand 14454 states and 20541 transitions. Second operand has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 states have internal predecessors, (414), 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-03-16 20:52:04,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:52:04,979 INFO L93 Difference]: Finished difference Result 29493 states and 42311 transitions. [2025-03-16 20:52:04,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:52:04,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 states have internal predecessors, (414), 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 414 [2025-03-16 20:52:04,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:52:04,999 INFO L225 Difference]: With dead ends: 29493 [2025-03-16 20:52:04,999 INFO L226 Difference]: Without dead ends: 17416 [2025-03-16 20:52:05,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:52:05,012 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 1457 mSDsluCounter, 1935 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1457 SdHoareTripleChecker+Valid, 2587 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:52:05,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1457 Valid, 2587 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 20:52:05,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17416 states. [2025-03-16 20:52:05,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17416 to 17414. [2025-03-16 20:52:05,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17414 states, 17413 states have (on average 1.4326652501004997) internal successors, (24947), 17413 states have internal predecessors, (24947), 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-03-16 20:52:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17414 states to 17414 states and 24947 transitions. [2025-03-16 20:52:05,157 INFO L78 Accepts]: Start accepts. Automaton has 17414 states and 24947 transitions. Word has length 414 [2025-03-16 20:52:05,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:52:05,157 INFO L471 AbstractCegarLoop]: Abstraction has 17414 states and 24947 transitions. [2025-03-16 20:52:05,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 states have internal predecessors, (414), 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-03-16 20:52:05,157 INFO L276 IsEmpty]: Start isEmpty. Operand 17414 states and 24947 transitions. [2025-03-16 20:52:05,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-03-16 20:52:05,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:52:05,173 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:52:05,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-16 20:52:05,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-16 20:52:05,374 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:52:05,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:52:05,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1483346040, now seen corresponding path program 1 times [2025-03-16 20:52:05,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:52:05,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304401124] [2025-03-16 20:52:05,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:52:05,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:52:05,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-16 20:52:05,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-16 20:52:05,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:52:05,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:52:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 37 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:52:05,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:52:05,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304401124] [2025-03-16 20:52:05,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304401124] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:52:05,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251326549] [2025-03-16 20:52:05,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:52:05,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:52:05,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:52:05,864 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:52:05,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-16 20:52:06,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-16 20:52:06,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-16 20:52:06,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:52:06,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:52:06,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 1738 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-03-16 20:52:06,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:52:07,272 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 49 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:52:07,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:52:08,335 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 55 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:52:08,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251326549] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:52:08,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:52:08,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 19, 19] total 40 [2025-03-16 20:52:08,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466136744] [2025-03-16 20:52:08,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:52:08,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-16 20:52:08,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:52:08,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-16 20:52:08,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1418, Unknown=0, NotChecked=0, Total=1560 [2025-03-16 20:52:08,337 INFO L87 Difference]: Start difference. First operand 17414 states and 24947 transitions. Second operand has 40 states, 40 states have (on average 24.525) internal successors, (981), 40 states have internal predecessors, (981), 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-03-16 20:52:26,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:52:26,370 INFO L93 Difference]: Finished difference Result 220798 states and 322485 transitions. [2025-03-16 20:52:26,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2025-03-16 20:52:26,370 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 24.525) internal successors, (981), 40 states have internal predecessors, (981), 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 415 [2025-03-16 20:52:26,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:52:26,557 INFO L225 Difference]: With dead ends: 220798 [2025-03-16 20:52:26,557 INFO L226 Difference]: Without dead ends: 198917 [2025-03-16 20:52:26,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1060 GetRequests, 810 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23375 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4138, Invalid=59114, Unknown=0, NotChecked=0, Total=63252 [2025-03-16 20:52:26,598 INFO L435 NwaCegarLoop]: 2522 mSDtfsCounter, 11755 mSDsluCounter, 68078 mSDsCounter, 0 mSdLazyCounter, 38651 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11755 SdHoareTripleChecker+Valid, 70600 SdHoareTripleChecker+Invalid, 38753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 38651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:52:26,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11755 Valid, 70600 Invalid, 38753 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [102 Valid, 38651 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2025-03-16 20:52:26,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198917 states. [2025-03-16 20:52:27,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198917 to 65147. [2025-03-16 20:52:27,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65147 states, 65146 states have (on average 1.4521843244404875) internal successors, (94604), 65146 states have internal predecessors, (94604), 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-03-16 20:52:27,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65147 states to 65147 states and 94604 transitions. [2025-03-16 20:52:27,996 INFO L78 Accepts]: Start accepts. Automaton has 65147 states and 94604 transitions. Word has length 415 [2025-03-16 20:52:27,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:52:27,997 INFO L471 AbstractCegarLoop]: Abstraction has 65147 states and 94604 transitions. [2025-03-16 20:52:27,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 24.525) internal successors, (981), 40 states have internal predecessors, (981), 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-03-16 20:52:27,997 INFO L276 IsEmpty]: Start isEmpty. Operand 65147 states and 94604 transitions. [2025-03-16 20:52:28,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2025-03-16 20:52:28,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:52:28,057 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:52:28,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-16 20:52:28,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-16 20:52:28,258 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:52:28,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:52:28,258 INFO L85 PathProgramCache]: Analyzing trace with hash 839923879, now seen corresponding path program 1 times [2025-03-16 20:52:28,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:52:28,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494866927] [2025-03-16 20:52:28,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:52:28,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:52:28,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-03-16 20:52:28,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-03-16 20:52:28,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:52:28,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:52:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:52:28,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:52:28,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494866927] [2025-03-16 20:52:28,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494866927] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:52:28,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530184553] [2025-03-16 20:52:28,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:52:28,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:52:28,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:52:28,926 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:52:28,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-16 20:52:29,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-03-16 20:52:29,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-03-16 20:52:29,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:52:29,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:52:29,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 1741 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-16 20:52:29,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:52:30,991 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:52:30,991 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:52:30,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530184553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:52:30,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:52:30,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 21 [2025-03-16 20:52:30,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917306633] [2025-03-16 20:52:30,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:52:30,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 20:52:30,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:52:30,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 20:52:30,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:52:30,994 INFO L87 Difference]: Start difference. First operand 65147 states and 94604 transitions. Second operand has 15 states, 15 states have (on average 27.733333333333334) internal successors, (416), 15 states have internal predecessors, (416), 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-03-16 20:52:34,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:52:34,375 INFO L93 Difference]: Finished difference Result 182427 states and 265830 transitions. [2025-03-16 20:52:34,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 20:52:34,376 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 27.733333333333334) internal successors, (416), 15 states have internal predecessors, (416), 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 416 [2025-03-16 20:52:34,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:52:34,485 INFO L225 Difference]: With dead ends: 182427 [2025-03-16 20:52:34,485 INFO L226 Difference]: Without dead ends: 122733 [2025-03-16 20:52:34,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2025-03-16 20:52:34,529 INFO L435 NwaCegarLoop]: 1823 mSDtfsCounter, 3626 mSDsluCounter, 14814 mSDsCounter, 0 mSdLazyCounter, 9192 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3626 SdHoareTripleChecker+Valid, 16637 SdHoareTripleChecker+Invalid, 9195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-16 20:52:34,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3626 Valid, 16637 Invalid, 9195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9192 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-16 20:52:34,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122733 states. [2025-03-16 20:52:35,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122733 to 80623. [2025-03-16 20:52:35,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80623 states, 80622 states have (on average 1.4559053360125027) internal successors, (117378), 80622 states have internal predecessors, (117378), 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-03-16 20:52:35,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80623 states to 80623 states and 117378 transitions. [2025-03-16 20:52:35,331 INFO L78 Accepts]: Start accepts. Automaton has 80623 states and 117378 transitions. Word has length 416 [2025-03-16 20:52:35,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:52:35,331 INFO L471 AbstractCegarLoop]: Abstraction has 80623 states and 117378 transitions. [2025-03-16 20:52:35,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 27.733333333333334) internal successors, (416), 15 states have internal predecessors, (416), 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-03-16 20:52:35,331 INFO L276 IsEmpty]: Start isEmpty. Operand 80623 states and 117378 transitions. [2025-03-16 20:52:35,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-03-16 20:52:35,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:52:35,401 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 20:52:35,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-16 20:52:35,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:52:35,602 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:52:35,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:52:35,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1864184279, now seen corresponding path program 1 times [2025-03-16 20:52:35,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:52:35,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223981564] [2025-03-16 20:52:35,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:52:35,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:52:35,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-03-16 20:52:35,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-03-16 20:52:35,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:52:35,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:52:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:52:36,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:52:36,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223981564] [2025-03-16 20:52:36,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223981564] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:52:36,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070548261] [2025-03-16 20:52:36,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:52:36,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:52:36,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:52:36,594 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:52:36,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-16 20:52:37,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-03-16 20:52:37,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-03-16 20:52:37,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:52:37,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:52:37,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 1744 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-16 20:52:37,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:52:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 37 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:52:37,924 INFO L312 TraceCheckSpWp]: Computing backward predicates...