./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Ibuf.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Ibuf.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f5e5c42bbeffae4fb860efffdbf66b7537cb720af3f49bb62a0f81dcf7dbce99 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:13:38,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:13:38,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 23:13:38,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:13:38,732 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:13:38,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:13:38,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:13:38,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:13:38,752 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:13:38,753 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:13:38,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:13:38,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:13:38,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:13:38,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:13:38,754 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:13:38,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:13:38,754 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:13:38,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 23:13:38,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:13:38,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:13:38,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:13:38,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:13:38,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:13:38,755 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:13:38,755 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:13:38,755 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:13:38,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:13:38,756 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:13:38,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:13:38,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:13:38,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:13:38,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:13:38,756 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:13:38,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:13:38,757 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 23:13:38,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 23:13:38,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:13:38,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:13:38,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:13:38,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:13:38,757 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f5e5c42bbeffae4fb860efffdbf66b7537cb720af3f49bb62a0f81dcf7dbce99 [2025-02-07 23:13:38,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:13:38,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:13:38,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:13:38,977 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:13:38,978 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:13:38,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Ibuf.c [2025-02-07 23:13:40,142 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32e3fbaf0/3f39fba100ae45bc88924be1c237693e/FLAG557822ffc [2025-02-07 23:13:40,498 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:13:40,499 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Ibuf.c [2025-02-07 23:13:40,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32e3fbaf0/3f39fba100ae45bc88924be1c237693e/FLAG557822ffc [2025-02-07 23:13:40,720 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32e3fbaf0/3f39fba100ae45bc88924be1c237693e [2025-02-07 23:13:40,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:13:40,723 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:13:40,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:13:40,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:13:40,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:13:40,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:13:40" (1/1) ... [2025-02-07 23:13:40,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@213a613e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:40, skipping insertion in model container [2025-02-07 23:13:40,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:13:40" (1/1) ... [2025-02-07 23:13:40,762 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:13:40,885 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Ibuf.c[1246,1259] [2025-02-07 23:13:40,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:13:41,007 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:13:41,014 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Ibuf.c[1246,1259] [2025-02-07 23:13:41,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:13:41,104 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:13:41,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:41 WrapperNode [2025-02-07 23:13:41,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:13:41,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:13:41,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:13:41,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:13:41,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:41" (1/1) ... [2025-02-07 23:13:41,125 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:41" (1/1) ... [2025-02-07 23:13:41,229 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1465 [2025-02-07 23:13:41,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:13:41,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:13:41,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:13:41,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:13:41,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:41" (1/1) ... [2025-02-07 23:13:41,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:41" (1/1) ... [2025-02-07 23:13:41,259 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:41" (1/1) ... [2025-02-07 23:13:41,312 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 23:13:41,314 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:41" (1/1) ... [2025-02-07 23:13:41,314 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:41" (1/1) ... [2025-02-07 23:13:41,347 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:41" (1/1) ... [2025-02-07 23:13:41,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:41" (1/1) ... [2025-02-07 23:13:41,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:41" (1/1) ... [2025-02-07 23:13:41,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:41" (1/1) ... [2025-02-07 23:13:41,387 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:13:41,387 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:13:41,388 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:13:41,388 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:13:41,388 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:41" (1/1) ... [2025-02-07 23:13:41,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:13:41,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:13:41,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 23:13:41,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 23:13:41,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:13:41,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 23:13:41,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:13:41,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:13:41,652 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:13:41,653 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:13:42,924 INFO L? ?]: Removed 910 outVars from TransFormulas that were not future-live. [2025-02-07 23:13:42,924 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:13:43,003 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:13:43,003 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:13:43,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:13:43 BoogieIcfgContainer [2025-02-07 23:13:43,004 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:13:43,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:13:43,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:13:43,009 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:13:43,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:13:40" (1/3) ... [2025-02-07 23:13:43,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f88381d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:13:43, skipping insertion in model container [2025-02-07 23:13:43,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:41" (2/3) ... [2025-02-07 23:13:43,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f88381d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:13:43, skipping insertion in model container [2025-02-07 23:13:43,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:13:43" (3/3) ... [2025-02-07 23:13:43,010 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Ibuf.c [2025-02-07 23:13:43,020 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:13:43,021 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_Ibuf.c that has 1 procedures, 480 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:13:43,061 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:13:43,068 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;@29868d2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:13:43,069 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:13:43,072 INFO L276 IsEmpty]: Start isEmpty. Operand has 480 states, 478 states have (on average 1.5) internal successors, (717), 479 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:43,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-07 23:13:43,075 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:43,076 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] [2025-02-07 23:13:43,076 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:43,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:43,079 INFO L85 PathProgramCache]: Analyzing trace with hash 322228301, now seen corresponding path program 1 times [2025-02-07 23:13:43,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:43,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125198119] [2025-02-07 23:13:43,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:43,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:43,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-07 23:13:43,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 23:13:43,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:43,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:43,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:13:43,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:43,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125198119] [2025-02-07 23:13:43,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125198119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:43,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:43,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:13:43,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212385975] [2025-02-07 23:13:43,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:43,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:13:43,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:43,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:13:43,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:13:43,455 INFO L87 Difference]: Start difference. First operand has 480 states, 478 states have (on average 1.5) internal successors, (717), 479 states have internal predecessors, (717), 0 states have call successors, (0), 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 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:43,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:43,801 INFO L93 Difference]: Finished difference Result 951 states and 1423 transitions. [2025-02-07 23:13:43,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:13:43,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-02-07 23:13:43,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:43,817 INFO L225 Difference]: With dead ends: 951 [2025-02-07 23:13:43,817 INFO L226 Difference]: Without dead ends: 480 [2025-02-07 23:13:43,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:13:43,826 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 0 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:43,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1777 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:13:43,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-02-07 23:13:43,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-02-07 23:13:43,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 1.4947807933194155) internal successors, (716), 479 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:43,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 716 transitions. [2025-02-07 23:13:43,890 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 716 transitions. Word has length 20 [2025-02-07 23:13:43,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:43,890 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 716 transitions. [2025-02-07 23:13:43,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:43,890 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 716 transitions. [2025-02-07 23:13:43,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-07 23:13:43,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:43,891 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] [2025-02-07 23:13:43,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 23:13:43,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:43,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:43,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1403822652, now seen corresponding path program 1 times [2025-02-07 23:13:43,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:43,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18557037] [2025-02-07 23:13:43,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:43,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:43,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-07 23:13:43,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-07 23:13:43,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:43,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:13:44,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:44,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18557037] [2025-02-07 23:13:44,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18557037] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:44,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:44,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:13:44,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232362652] [2025-02-07 23:13:44,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:44,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:13:44,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:44,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:13:44,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:13:44,004 INFO L87 Difference]: Start difference. First operand 480 states and 716 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:44,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:44,245 INFO L93 Difference]: Finished difference Result 953 states and 1422 transitions. [2025-02-07 23:13:44,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:13:44,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-02-07 23:13:44,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:44,247 INFO L225 Difference]: With dead ends: 953 [2025-02-07 23:13:44,247 INFO L226 Difference]: Without dead ends: 482 [2025-02-07 23:13:44,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:13:44,248 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 0 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:44,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1774 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:13:44,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-02-07 23:13:44,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2025-02-07 23:13:44,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 481 states have (on average 1.4927234927234927) internal successors, (718), 481 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:44,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 718 transitions. [2025-02-07 23:13:44,268 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 718 transitions. Word has length 21 [2025-02-07 23:13:44,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:44,268 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 718 transitions. [2025-02-07 23:13:44,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:44,270 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 718 transitions. [2025-02-07 23:13:44,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 23:13:44,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:44,271 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] [2025-02-07 23:13:44,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 23:13:44,272 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:44,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:44,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1794628056, now seen corresponding path program 1 times [2025-02-07 23:13:44,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:44,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917784103] [2025-02-07 23:13:44,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:44,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:44,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 23:13:44,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 23:13:44,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:44,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:44,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:13:44,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:44,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917784103] [2025-02-07 23:13:44,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917784103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:44,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:44,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:13:44,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079567110] [2025-02-07 23:13:44,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:44,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:13:44,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:44,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:13:44,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:13:44,551 INFO L87 Difference]: Start difference. First operand 482 states and 718 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:45,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:45,144 INFO L93 Difference]: Finished difference Result 1403 states and 2091 transitions. [2025-02-07 23:13:45,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:13:45,145 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-02-07 23:13:45,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:45,149 INFO L225 Difference]: With dead ends: 1403 [2025-02-07 23:13:45,149 INFO L226 Difference]: Without dead ends: 930 [2025-02-07 23:13:45,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:13:45,150 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 751 mSDsluCounter, 2905 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 3489 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:45,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 3489 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:13:45,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-02-07 23:13:45,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 491. [2025-02-07 23:13:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.489795918367347) internal successors, (730), 490 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:45,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 730 transitions. [2025-02-07 23:13:45,202 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 730 transitions. Word has length 22 [2025-02-07 23:13:45,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:45,202 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 730 transitions. [2025-02-07 23:13:45,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:45,203 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 730 transitions. [2025-02-07 23:13:45,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 23:13:45,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:45,203 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] [2025-02-07 23:13:45,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 23:13:45,203 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:45,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:45,204 INFO L85 PathProgramCache]: Analyzing trace with hash -719819066, now seen corresponding path program 1 times [2025-02-07 23:13:45,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:45,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509491126] [2025-02-07 23:13:45,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:45,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:45,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 23:13:45,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 23:13:45,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:45,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:45,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:13:45,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:45,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509491126] [2025-02-07 23:13:45,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509491126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:45,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:45,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:13:45,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168350666] [2025-02-07 23:13:45,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:45,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:13:45,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:45,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:13:45,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:13:45,335 INFO L87 Difference]: Start difference. First operand 491 states and 730 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:45,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:45,606 INFO L93 Difference]: Finished difference Result 968 states and 1441 transitions. [2025-02-07 23:13:45,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:13:45,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-02-07 23:13:45,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:45,608 INFO L225 Difference]: With dead ends: 968 [2025-02-07 23:13:45,608 INFO L226 Difference]: Without dead ends: 495 [2025-02-07 23:13:45,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:13:45,609 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 706 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1770 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:45,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1770 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:13:45,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-02-07 23:13:45,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 494. [2025-02-07 23:13:45,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 1.488843813387424) internal successors, (734), 493 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:45,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 734 transitions. [2025-02-07 23:13:45,619 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 734 transitions. Word has length 23 [2025-02-07 23:13:45,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:45,620 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 734 transitions. [2025-02-07 23:13:45,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:45,620 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 734 transitions. [2025-02-07 23:13:45,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 23:13:45,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:45,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] [2025-02-07 23:13:45,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 23:13:45,621 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:45,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:45,622 INFO L85 PathProgramCache]: Analyzing trace with hash 2057616158, now seen corresponding path program 1 times [2025-02-07 23:13:45,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:45,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602047911] [2025-02-07 23:13:45,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:45,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:45,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 23:13:45,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 23:13:45,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:45,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:13:45,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:45,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602047911] [2025-02-07 23:13:45,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602047911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:45,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:45,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-07 23:13:45,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104243044] [2025-02-07 23:13:45,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:45,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:13:45,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:45,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:13:45,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:13:45,897 INFO L87 Difference]: Start difference. First operand 494 states and 734 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:46,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:46,350 INFO L93 Difference]: Finished difference Result 1049 states and 1553 transitions. [2025-02-07 23:13:46,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:13:46,350 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-02-07 23:13:46,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:46,352 INFO L225 Difference]: With dead ends: 1049 [2025-02-07 23:13:46,352 INFO L226 Difference]: Without dead ends: 568 [2025-02-07 23:13:46,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-02-07 23:13:46,353 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 119 mSDsluCounter, 3497 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 4080 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:46,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 4080 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:13:46,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-02-07 23:13:46,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 506. [2025-02-07 23:13:46,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 1.4831683168316832) internal successors, (749), 505 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:46,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 749 transitions. [2025-02-07 23:13:46,361 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 749 transitions. Word has length 24 [2025-02-07 23:13:46,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:46,362 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 749 transitions. [2025-02-07 23:13:46,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:46,362 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 749 transitions. [2025-02-07 23:13:46,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 23:13:46,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:46,362 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] [2025-02-07 23:13:46,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 23:13:46,362 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:46,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:46,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1048808707, now seen corresponding path program 1 times [2025-02-07 23:13:46,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:46,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616252225] [2025-02-07 23:13:46,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:46,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:46,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 23:13:46,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 23:13:46,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:46,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:46,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:13:46,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:46,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616252225] [2025-02-07 23:13:46,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616252225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:46,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:46,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-07 23:13:46,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781154551] [2025-02-07 23:13:46,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:46,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:13:46,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:46,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:13:46,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:13:46,589 INFO L87 Difference]: Start difference. First operand 506 states and 749 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:47,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:47,130 INFO L93 Difference]: Finished difference Result 1047 states and 1550 transitions. [2025-02-07 23:13:47,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:13:47,130 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-02-07 23:13:47,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:47,132 INFO L225 Difference]: With dead ends: 1047 [2025-02-07 23:13:47,132 INFO L226 Difference]: Without dead ends: 571 [2025-02-07 23:13:47,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-02-07 23:13:47,134 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 117 mSDsluCounter, 4643 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 5226 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:47,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 5226 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:13:47,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-02-07 23:13:47,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 512. [2025-02-07 23:13:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 511 states have (on average 1.4814090019569472) internal successors, (757), 511 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 757 transitions. [2025-02-07 23:13:47,142 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 757 transitions. Word has length 24 [2025-02-07 23:13:47,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:47,142 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 757 transitions. [2025-02-07 23:13:47,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:47,142 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 757 transitions. [2025-02-07 23:13:47,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 23:13:47,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:47,142 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] [2025-02-07 23:13:47,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 23:13:47,143 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:47,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:47,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1987074023, now seen corresponding path program 1 times [2025-02-07 23:13:47,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:47,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212246585] [2025-02-07 23:13:47,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:47,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:47,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 23:13:47,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 23:13:47,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:47,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:47,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:13:47,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:47,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212246585] [2025-02-07 23:13:47,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212246585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:47,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:47,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:13:47,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681578725] [2025-02-07 23:13:47,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:47,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 23:13:47,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:47,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 23:13:47,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:13:47,293 INFO L87 Difference]: Start difference. First operand 512 states and 757 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:47,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:47,762 INFO L93 Difference]: Finished difference Result 1363 states and 2022 transitions. [2025-02-07 23:13:47,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:13:47,762 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-02-07 23:13:47,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:47,765 INFO L225 Difference]: With dead ends: 1363 [2025-02-07 23:13:47,765 INFO L226 Difference]: Without dead ends: 867 [2025-02-07 23:13:47,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:13:47,767 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 602 mSDsluCounter, 3350 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 3933 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:47,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 3933 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:13:47,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2025-02-07 23:13:47,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 497. [2025-02-07 23:13:47,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 1.4818548387096775) internal successors, (735), 496 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:47,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 735 transitions. [2025-02-07 23:13:47,777 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 735 transitions. Word has length 24 [2025-02-07 23:13:47,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:47,778 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 735 transitions. [2025-02-07 23:13:47,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:47,778 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 735 transitions. [2025-02-07 23:13:47,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 23:13:47,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:47,780 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] [2025-02-07 23:13:47,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 23:13:47,780 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:47,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:47,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1950170244, now seen corresponding path program 1 times [2025-02-07 23:13:47,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:47,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001312619] [2025-02-07 23:13:47,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:47,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:47,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 23:13:47,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 23:13:47,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:47,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:48,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:13:48,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:48,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001312619] [2025-02-07 23:13:48,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001312619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:48,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:48,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-07 23:13:48,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875573473] [2025-02-07 23:13:48,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:48,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 23:13:48,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:48,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 23:13:48,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:13:48,173 INFO L87 Difference]: Start difference. First operand 497 states and 735 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:48,862 INFO L93 Difference]: Finished difference Result 1006 states and 1491 transitions. [2025-02-07 23:13:48,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 23:13:48,863 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-02-07 23:13:48,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:48,864 INFO L225 Difference]: With dead ends: 1006 [2025-02-07 23:13:48,864 INFO L226 Difference]: Without dead ends: 530 [2025-02-07 23:13:48,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-02-07 23:13:48,866 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 68 mSDsluCounter, 5813 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 6397 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:48,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 6397 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 23:13:48,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-02-07 23:13:48,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 497. [2025-02-07 23:13:48,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 1.4798387096774193) internal successors, (734), 496 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:48,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 734 transitions. [2025-02-07 23:13:48,873 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 734 transitions. Word has length 25 [2025-02-07 23:13:48,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:48,873 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 734 transitions. [2025-02-07 23:13:48,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:48,873 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 734 transitions. [2025-02-07 23:13:48,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-02-07 23:13:48,878 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:48,879 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:13:48,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 23:13:48,879 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:48,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:48,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1572291019, now seen corresponding path program 1 times [2025-02-07 23:13:48,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:48,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694872028] [2025-02-07 23:13:48,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:48,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:48,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-02-07 23:13:49,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-02-07 23:13:49,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:49,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:13:50,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:50,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694872028] [2025-02-07 23:13:50,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694872028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:50,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:50,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 23:13:50,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188476858] [2025-02-07 23:13:50,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:50,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:13:50,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:50,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:13:50,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:13:50,700 INFO L87 Difference]: Start difference. First operand 497 states and 734 transitions. Second operand has 10 states, 10 states have (on average 26.0) internal successors, (260), 10 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:51,336 INFO L93 Difference]: Finished difference Result 1673 states and 2488 transitions. [2025-02-07 23:13:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:13:51,337 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 26.0) internal successors, (260), 10 states have internal predecessors, (260), 0 states have call successors, (0), 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 260 [2025-02-07 23:13:51,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:51,341 INFO L225 Difference]: With dead ends: 1673 [2025-02-07 23:13:51,341 INFO L226 Difference]: Without dead ends: 1197 [2025-02-07 23:13:51,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-07 23:13:51,342 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 2309 mSDsluCounter, 4621 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2309 SdHoareTripleChecker+Valid, 5324 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:51,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2309 Valid, 5324 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 23:13:51,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2025-02-07 23:13:51,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 758. [2025-02-07 23:13:51,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 757 states have (on average 1.4821664464993396) internal successors, (1122), 757 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-02-07 23:13:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1122 transitions. [2025-02-07 23:13:51,356 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1122 transitions. Word has length 260 [2025-02-07 23:13:51,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:51,357 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1122 transitions. [2025-02-07 23:13:51,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.0) internal successors, (260), 10 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:51,357 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1122 transitions. [2025-02-07 23:13:51,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-02-07 23:13:51,358 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:51,359 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:13:51,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 23:13:51,359 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:51,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:51,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1026358126, now seen corresponding path program 1 times [2025-02-07 23:13:51,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:51,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515143734] [2025-02-07 23:13:51,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:51,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:51,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-02-07 23:13:51,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-02-07 23:13:51,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:51,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:51,883 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:13:51,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:51,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515143734] [2025-02-07 23:13:51,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515143734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:51,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:51,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:13:51,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196287911] [2025-02-07 23:13:51,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:51,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:13:51,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:51,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:13:51,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:13:51,885 INFO L87 Difference]: Start difference. First operand 758 states and 1122 transitions. Second operand has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:52,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:52,209 INFO L93 Difference]: Finished difference Result 1507 states and 2237 transitions. [2025-02-07 23:13:52,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:13:52,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 0 states have call successors, (0), 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 261 [2025-02-07 23:13:52,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:52,212 INFO L225 Difference]: With dead ends: 1507 [2025-02-07 23:13:52,212 INFO L226 Difference]: Without dead ends: 770 [2025-02-07 23:13:52,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:13:52,217 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 4 mSDsluCounter, 2357 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2950 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:52,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2950 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:13:52,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-02-07 23:13:52,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2025-02-07 23:13:52,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 769 states have (on average 1.4798439531859557) internal successors, (1138), 769 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:52,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1138 transitions. [2025-02-07 23:13:52,234 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1138 transitions. Word has length 261 [2025-02-07 23:13:52,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:52,235 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 1138 transitions. [2025-02-07 23:13:52,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:52,235 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1138 transitions. [2025-02-07 23:13:52,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-02-07 23:13:52,238 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:52,239 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:13:52,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 23:13:52,239 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:52,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:52,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1138183616, now seen corresponding path program 1 times [2025-02-07 23:13:52,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:52,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542128787] [2025-02-07 23:13:52,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:52,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:52,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-02-07 23:13:52,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-02-07 23:13:52,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:52,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:54,017 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:13:54,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:54,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542128787] [2025-02-07 23:13:54,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542128787] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:54,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:54,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-07 23:13:54,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282590288] [2025-02-07 23:13:54,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:54,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 23:13:54,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:54,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 23:13:54,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:13:54,019 INFO L87 Difference]: Start difference. First operand 770 states and 1138 transitions. Second operand has 9 states, 9 states have (on average 29.0) internal successors, (261), 9 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:54,528 INFO L93 Difference]: Finished difference Result 2449 states and 3635 transitions. [2025-02-07 23:13:54,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 23:13:54,529 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 29.0) internal successors, (261), 9 states have internal predecessors, (261), 0 states have call successors, (0), 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 261 [2025-02-07 23:13:54,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:54,534 INFO L225 Difference]: With dead ends: 2449 [2025-02-07 23:13:54,534 INFO L226 Difference]: Without dead ends: 1700 [2025-02-07 23:13:54,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:13:54,536 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 2070 mSDsluCounter, 2559 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2070 SdHoareTripleChecker+Valid, 3136 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:54,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2070 Valid, 3136 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:13:54,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2025-02-07 23:13:54,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1419. [2025-02-07 23:13:54,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 1418 states have (on average 1.4823695345557122) internal successors, (2102), 1418 states have internal predecessors, (2102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:54,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2102 transitions. [2025-02-07 23:13:54,559 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2102 transitions. Word has length 261 [2025-02-07 23:13:54,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:54,559 INFO L471 AbstractCegarLoop]: Abstraction has 1419 states and 2102 transitions. [2025-02-07 23:13:54,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.0) internal successors, (261), 9 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:54,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2102 transitions. [2025-02-07 23:13:54,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-07 23:13:54,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:54,562 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:13:54,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 23:13:54,563 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:54,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:54,563 INFO L85 PathProgramCache]: Analyzing trace with hash 423307756, now seen corresponding path program 1 times [2025-02-07 23:13:54,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:54,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723051576] [2025-02-07 23:13:54,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:54,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:54,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-07 23:13:54,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-07 23:13:54,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:54,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:55,512 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:13:55,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:55,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723051576] [2025-02-07 23:13:55,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723051576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:55,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:55,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-07 23:13:55,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519016803] [2025-02-07 23:13:55,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:55,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 23:13:55,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:55,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 23:13:55,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:13:55,516 INFO L87 Difference]: Start difference. First operand 1419 states and 2102 transitions. Second operand has 9 states, 9 states have (on average 29.11111111111111) internal successors, (262), 9 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:56,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:56,975 INFO L93 Difference]: Finished difference Result 4089 states and 6071 transitions. [2025-02-07 23:13:56,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:13:56,975 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 29.11111111111111) internal successors, (262), 9 states have internal predecessors, (262), 0 states have call successors, (0), 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 262 [2025-02-07 23:13:56,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:56,983 INFO L225 Difference]: With dead ends: 4089 [2025-02-07 23:13:56,983 INFO L226 Difference]: Without dead ends: 2691 [2025-02-07 23:13:56,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:13:56,985 INFO L435 NwaCegarLoop]: 1112 mSDtfsCounter, 744 mSDsluCounter, 7181 mSDsCounter, 0 mSdLazyCounter, 1805 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 8293 SdHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:56,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 8293 Invalid, 1807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1805 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-07 23:13:56,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691 states. [2025-02-07 23:13:57,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2691 to 1432. [2025-02-07 23:13:57,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1431 states have (on average 1.4807826694619148) internal successors, (2119), 1431 states have internal predecessors, (2119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:57,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2119 transitions. [2025-02-07 23:13:57,012 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2119 transitions. Word has length 262 [2025-02-07 23:13:57,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:57,012 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 2119 transitions. [2025-02-07 23:13:57,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.11111111111111) internal successors, (262), 9 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:57,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2119 transitions. [2025-02-07 23:13:57,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-02-07 23:13:57,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:57,015 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:13:57,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 23:13:57,015 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:57,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:57,016 INFO L85 PathProgramCache]: Analyzing trace with hash 737984302, now seen corresponding path program 1 times [2025-02-07 23:13:57,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:57,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969711087] [2025-02-07 23:13:57,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:57,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:57,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-07 23:13:57,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-07 23:13:57,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:57,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:13:57,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:57,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969711087] [2025-02-07 23:13:57,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969711087] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:57,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:57,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 23:13:57,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143704076] [2025-02-07 23:13:57,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:57,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 23:13:57,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:57,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 23:13:57,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:13:57,866 INFO L87 Difference]: Start difference. First operand 1432 states and 2119 transitions. Second operand has 9 states, 9 states have (on average 29.22222222222222) internal successors, (263), 8 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:58,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:58,381 INFO L93 Difference]: Finished difference Result 3903 states and 5795 transitions. [2025-02-07 23:13:58,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:13:58,381 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 29.22222222222222) internal successors, (263), 8 states have internal predecessors, (263), 0 states have call successors, (0), 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 263 [2025-02-07 23:13:58,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:58,388 INFO L225 Difference]: With dead ends: 3903 [2025-02-07 23:13:58,389 INFO L226 Difference]: Without dead ends: 2492 [2025-02-07 23:13:58,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:13:58,390 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 663 mSDsluCounter, 3987 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 4568 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:58,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 4568 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:13:58,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2025-02-07 23:13:58,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2296. [2025-02-07 23:13:58,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2296 states, 2295 states have (on average 1.4845315904139433) internal successors, (3407), 2295 states have internal predecessors, (3407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 3407 transitions. [2025-02-07 23:13:58,418 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 3407 transitions. Word has length 263 [2025-02-07 23:13:58,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:58,418 INFO L471 AbstractCegarLoop]: Abstraction has 2296 states and 3407 transitions. [2025-02-07 23:13:58,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.22222222222222) internal successors, (263), 8 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:58,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 3407 transitions. [2025-02-07 23:13:58,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-02-07 23:13:58,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:58,421 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:13:58,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 23:13:58,421 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:58,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:58,421 INFO L85 PathProgramCache]: Analyzing trace with hash -197285304, now seen corresponding path program 1 times [2025-02-07 23:13:58,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:58,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107686076] [2025-02-07 23:13:58,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:58,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:58,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-07 23:13:58,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-07 23:13:58,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:58,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:59,244 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 23:13:59,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:59,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107686076] [2025-02-07 23:13:59,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107686076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:59,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:59,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-07 23:13:59,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225599000] [2025-02-07 23:13:59,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:59,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 23:13:59,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:59,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 23:13:59,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:13:59,246 INFO L87 Difference]: Start difference. First operand 2296 states and 3407 transitions. Second operand has 9 states, 9 states have (on average 29.333333333333332) internal successors, (264), 9 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:59,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:59,683 INFO L93 Difference]: Finished difference Result 3736 states and 5541 transitions. [2025-02-07 23:13:59,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:13:59,684 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 29.333333333333332) internal successors, (264), 9 states have internal predecessors, (264), 0 states have call successors, (0), 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 264 [2025-02-07 23:13:59,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:59,693 INFO L225 Difference]: With dead ends: 3736 [2025-02-07 23:13:59,694 INFO L226 Difference]: Without dead ends: 2325 [2025-02-07 23:13:59,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:13:59,701 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 15 mSDsluCounter, 2885 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3467 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:59,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3467 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:13:59,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2025-02-07 23:13:59,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2315. [2025-02-07 23:13:59,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2315 states, 2314 states have (on average 1.4835782195332756) internal successors, (3433), 2314 states have internal predecessors, (3433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:59,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 3433 transitions. [2025-02-07 23:13:59,756 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 3433 transitions. Word has length 264 [2025-02-07 23:13:59,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:59,757 INFO L471 AbstractCegarLoop]: Abstraction has 2315 states and 3433 transitions. [2025-02-07 23:13:59,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.333333333333332) internal successors, (264), 9 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:59,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3433 transitions. [2025-02-07 23:13:59,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-02-07 23:13:59,760 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:59,760 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:13:59,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 23:13:59,761 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:59,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:59,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1206092755, now seen corresponding path program 1 times [2025-02-07 23:13:59,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:59,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253534673] [2025-02-07 23:13:59,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:59,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:59,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-07 23:14:00,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-07 23:14:00,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:00,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:01,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:01,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253534673] [2025-02-07 23:14:01,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253534673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:01,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:01,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 23:14:01,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801671726] [2025-02-07 23:14:01,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:01,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 23:14:01,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:01,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 23:14:01,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:14:01,071 INFO L87 Difference]: Start difference. First operand 2315 states and 3433 transitions. Second operand has 8 states, 8 states have (on average 33.0) internal successors, (264), 8 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:01,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:01,473 INFO L93 Difference]: Finished difference Result 4442 states and 6588 transitions. [2025-02-07 23:14:01,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:14:01,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 33.0) internal successors, (264), 8 states have internal predecessors, (264), 0 states have call successors, (0), 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 264 [2025-02-07 23:14:01,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:01,480 INFO L225 Difference]: With dead ends: 4442 [2025-02-07 23:14:01,480 INFO L226 Difference]: Without dead ends: 2479 [2025-02-07 23:14:01,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-07 23:14:01,484 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 623 mSDsluCounter, 2474 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 3059 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:01,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 3059 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:14:01,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2479 states. [2025-02-07 23:14:01,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2479 to 2470. [2025-02-07 23:14:01,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2470 states, 2469 states have (on average 1.4795463750506277) internal successors, (3653), 2469 states have internal predecessors, (3653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:01,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 3653 transitions. [2025-02-07 23:14:01,516 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 3653 transitions. Word has length 264 [2025-02-07 23:14:01,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:01,516 INFO L471 AbstractCegarLoop]: Abstraction has 2470 states and 3653 transitions. [2025-02-07 23:14:01,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 33.0) internal successors, (264), 8 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:01,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 3653 transitions. [2025-02-07 23:14:01,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-07 23:14:01,520 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:01,520 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:01,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 23:14:01,521 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:01,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:01,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1985552372, now seen corresponding path program 1 times [2025-02-07 23:14:01,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:01,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557631671] [2025-02-07 23:14:01,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:01,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:01,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-07 23:14:01,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-07 23:14:01,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:01,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:01,855 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:01,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:01,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557631671] [2025-02-07 23:14:01,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557631671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:01,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:01,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:14:01,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135821703] [2025-02-07 23:14:01,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:01,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:01,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:01,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:01,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:01,859 INFO L87 Difference]: Start difference. First operand 2470 states and 3653 transitions. Second operand has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:02,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:02,069 INFO L93 Difference]: Finished difference Result 4883 states and 7231 transitions. [2025-02-07 23:14:02,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:14:02,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 0 states have call successors, (0), 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 265 [2025-02-07 23:14:02,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:02,076 INFO L225 Difference]: With dead ends: 4883 [2025-02-07 23:14:02,076 INFO L226 Difference]: Without dead ends: 2530 [2025-02-07 23:14:02,078 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-02-07 23:14:02,079 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 4 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2362 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:02,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2362 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:14:02,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2025-02-07 23:14:02,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2530. [2025-02-07 23:14:02,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2530 states, 2529 states have (on average 1.476077500988533) internal successors, (3733), 2529 states have internal predecessors, (3733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2530 states and 3733 transitions. [2025-02-07 23:14:02,107 INFO L78 Accepts]: Start accepts. Automaton has 2530 states and 3733 transitions. Word has length 265 [2025-02-07 23:14:02,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:02,107 INFO L471 AbstractCegarLoop]: Abstraction has 2530 states and 3733 transitions. [2025-02-07 23:14:02,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:02,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2530 states and 3733 transitions. [2025-02-07 23:14:02,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-07 23:14:02,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:02,110 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:02,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 23:14:02,110 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:02,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:02,111 INFO L85 PathProgramCache]: Analyzing trace with hash 160119909, now seen corresponding path program 1 times [2025-02-07 23:14:02,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:02,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657683908] [2025-02-07 23:14:02,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:02,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:02,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-07 23:14:02,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-07 23:14:02,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:02,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:03,545 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:03,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:03,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657683908] [2025-02-07 23:14:03,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657683908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:03,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:03,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-07 23:14:03,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380807867] [2025-02-07 23:14:03,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:03,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 23:14:03,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:03,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 23:14:03,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:14:03,548 INFO L87 Difference]: Start difference. First operand 2530 states and 3733 transitions. Second operand has 11 states, 11 states have (on average 24.09090909090909) internal successors, (265), 11 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:04,133 INFO L93 Difference]: Finished difference Result 5191 states and 7671 transitions. [2025-02-07 23:14:04,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 23:14:04,134 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 24.09090909090909) internal successors, (265), 11 states have internal predecessors, (265), 0 states have call successors, (0), 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 265 [2025-02-07 23:14:04,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:04,140 INFO L225 Difference]: With dead ends: 5191 [2025-02-07 23:14:04,140 INFO L226 Difference]: Without dead ends: 2718 [2025-02-07 23:14:04,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-02-07 23:14:04,143 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 470 mSDsluCounter, 4340 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 4915 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:04,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 4915 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:14:04,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2025-02-07 23:14:04,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2680. [2025-02-07 23:14:04,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2680 states, 2679 states have (on average 1.4699514744307578) internal successors, (3938), 2679 states have internal predecessors, (3938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:04,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 3938 transitions. [2025-02-07 23:14:04,186 INFO L78 Accepts]: Start accepts. Automaton has 2680 states and 3938 transitions. Word has length 265 [2025-02-07 23:14:04,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:04,186 INFO L471 AbstractCegarLoop]: Abstraction has 2680 states and 3938 transitions. [2025-02-07 23:14:04,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 24.09090909090909) internal successors, (265), 11 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:04,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 3938 transitions. [2025-02-07 23:14:04,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-02-07 23:14:04,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:04,192 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:04,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 23:14:04,192 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:04,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:04,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1669687840, now seen corresponding path program 1 times [2025-02-07 23:14:04,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:04,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038119622] [2025-02-07 23:14:04,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:04,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:04,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-02-07 23:14:04,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-02-07 23:14:04,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:04,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:05,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:05,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038119622] [2025-02-07 23:14:05,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038119622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:05,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:05,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-07 23:14:05,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931383233] [2025-02-07 23:14:05,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:05,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 23:14:05,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:05,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 23:14:05,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:14:05,502 INFO L87 Difference]: Start difference. First operand 2680 states and 3938 transitions. Second operand has 9 states, 9 states have (on average 29.555555555555557) internal successors, (266), 9 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:05,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:05,890 INFO L93 Difference]: Finished difference Result 6731 states and 9908 transitions. [2025-02-07 23:14:05,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 23:14:05,890 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 29.555555555555557) internal successors, (266), 9 states have internal predecessors, (266), 0 states have call successors, (0), 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 266 [2025-02-07 23:14:05,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:05,902 INFO L225 Difference]: With dead ends: 6731 [2025-02-07 23:14:05,902 INFO L226 Difference]: Without dead ends: 4767 [2025-02-07 23:14:05,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:14:05,904 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 1099 mSDsluCounter, 3046 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 3625 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:05,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 3625 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:14:05,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4767 states. [2025-02-07 23:14:05,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4767 to 4475. [2025-02-07 23:14:05,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4475 states, 4474 states have (on average 1.4698256593652212) internal successors, (6576), 4474 states have internal predecessors, (6576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:05,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4475 states to 4475 states and 6576 transitions. [2025-02-07 23:14:05,939 INFO L78 Accepts]: Start accepts. Automaton has 4475 states and 6576 transitions. Word has length 266 [2025-02-07 23:14:05,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:05,939 INFO L471 AbstractCegarLoop]: Abstraction has 4475 states and 6576 transitions. [2025-02-07 23:14:05,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.555555555555557) internal successors, (266), 9 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:05,940 INFO L276 IsEmpty]: Start isEmpty. Operand 4475 states and 6576 transitions. [2025-02-07 23:14:05,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-02-07 23:14:05,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:05,943 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:05,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 23:14:05,943 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:05,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:05,943 INFO L85 PathProgramCache]: Analyzing trace with hash -388407064, now seen corresponding path program 1 times [2025-02-07 23:14:05,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:05,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314964918] [2025-02-07 23:14:05,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:05,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:05,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-02-07 23:14:06,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-02-07 23:14:06,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:06,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:07,165 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:07,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:07,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314964918] [2025-02-07 23:14:07,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314964918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:07,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:07,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-07 23:14:07,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324844335] [2025-02-07 23:14:07,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:07,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 23:14:07,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:07,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 23:14:07,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:14:07,166 INFO L87 Difference]: Start difference. First operand 4475 states and 6576 transitions. Second operand has 9 states, 9 states have (on average 29.666666666666668) internal successors, (267), 9 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:07,631 INFO L93 Difference]: Finished difference Result 7743 states and 11380 transitions. [2025-02-07 23:14:07,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 23:14:07,632 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 29.666666666666668) internal successors, (267), 9 states have internal predecessors, (267), 0 states have call successors, (0), 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 267 [2025-02-07 23:14:07,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:07,639 INFO L225 Difference]: With dead ends: 7743 [2025-02-07 23:14:07,640 INFO L226 Difference]: Without dead ends: 4791 [2025-02-07 23:14:07,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:14:07,644 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 1014 mSDsluCounter, 3445 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 4023 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:07,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 4023 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:14:07,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4791 states. [2025-02-07 23:14:07,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4791 to 4787. [2025-02-07 23:14:07,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4787 states, 4786 states have (on average 1.469703301295445) internal successors, (7034), 4786 states have internal predecessors, (7034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4787 states to 4787 states and 7034 transitions. [2025-02-07 23:14:07,689 INFO L78 Accepts]: Start accepts. Automaton has 4787 states and 7034 transitions. Word has length 267 [2025-02-07 23:14:07,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:07,690 INFO L471 AbstractCegarLoop]: Abstraction has 4787 states and 7034 transitions. [2025-02-07 23:14:07,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.666666666666668) internal successors, (267), 9 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:07,690 INFO L276 IsEmpty]: Start isEmpty. Operand 4787 states and 7034 transitions. [2025-02-07 23:14:07,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-02-07 23:14:07,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:07,694 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:07,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-07 23:14:07,694 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:07,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:07,695 INFO L85 PathProgramCache]: Analyzing trace with hash -26513937, now seen corresponding path program 1 times [2025-02-07 23:14:07,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:07,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933595738] [2025-02-07 23:14:07,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:07,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:07,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-02-07 23:14:07,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-02-07 23:14:07,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:07,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:08,032 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:08,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:08,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933595738] [2025-02-07 23:14:08,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933595738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:08,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:08,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:14:08,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335195995] [2025-02-07 23:14:08,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:08,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:14:08,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:08,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:14:08,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:14:08,034 INFO L87 Difference]: Start difference. First operand 4787 states and 7034 transitions. Second operand has 6 states, 6 states have (on average 44.5) internal successors, (267), 6 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:08,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:08,248 INFO L93 Difference]: Finished difference Result 8732 states and 12831 transitions. [2025-02-07 23:14:08,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:14:08,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 44.5) internal successors, (267), 6 states have internal predecessors, (267), 0 states have call successors, (0), 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 267 [2025-02-07 23:14:08,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:08,256 INFO L225 Difference]: With dead ends: 8732 [2025-02-07 23:14:08,256 INFO L226 Difference]: Without dead ends: 4817 [2025-02-07 23:14:08,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:14:08,261 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 3 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2354 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:08,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2354 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:14:08,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4817 states. [2025-02-07 23:14:08,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4817 to 4817. [2025-02-07 23:14:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4817 states, 4816 states have (on average 1.4678156146179402) internal successors, (7069), 4816 states have internal predecessors, (7069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4817 states to 4817 states and 7069 transitions. [2025-02-07 23:14:08,302 INFO L78 Accepts]: Start accepts. Automaton has 4817 states and 7069 transitions. Word has length 267 [2025-02-07 23:14:08,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:08,302 INFO L471 AbstractCegarLoop]: Abstraction has 4817 states and 7069 transitions. [2025-02-07 23:14:08,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.5) internal successors, (267), 6 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:08,302 INFO L276 IsEmpty]: Start isEmpty. Operand 4817 states and 7069 transitions. [2025-02-07 23:14:08,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-02-07 23:14:08,306 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:08,306 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:08,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-07 23:14:08,306 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:08,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:08,307 INFO L85 PathProgramCache]: Analyzing trace with hash 732776751, now seen corresponding path program 1 times [2025-02-07 23:14:08,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:08,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516094398] [2025-02-07 23:14:08,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:08,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:08,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-02-07 23:14:08,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-02-07 23:14:08,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:08,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:09,110 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:09,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:09,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516094398] [2025-02-07 23:14:09,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516094398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:09,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:09,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:14:09,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730659357] [2025-02-07 23:14:09,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:09,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:14:09,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:09,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:14:09,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:14:09,112 INFO L87 Difference]: Start difference. First operand 4817 states and 7069 transitions. Second operand has 6 states, 6 states have (on average 44.666666666666664) internal successors, (268), 6 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:09,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:09,403 INFO L93 Difference]: Finished difference Result 9222 states and 13538 transitions. [2025-02-07 23:14:09,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:14:09,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 44.666666666666664) internal successors, (268), 6 states have internal predecessors, (268), 0 states have call successors, (0), 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 268 [2025-02-07 23:14:09,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:09,413 INFO L225 Difference]: With dead ends: 9222 [2025-02-07 23:14:09,414 INFO L226 Difference]: Without dead ends: 6179 [2025-02-07 23:14:09,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:14:09,418 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 789 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 2193 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:09,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 2193 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:14:09,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6179 states. [2025-02-07 23:14:09,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6179 to 6175. [2025-02-07 23:14:09,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6175 states, 6174 states have (on average 1.4698736637512149) internal successors, (9075), 6174 states have internal predecessors, (9075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:09,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6175 states to 6175 states and 9075 transitions. [2025-02-07 23:14:09,474 INFO L78 Accepts]: Start accepts. Automaton has 6175 states and 9075 transitions. Word has length 268 [2025-02-07 23:14:09,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:09,475 INFO L471 AbstractCegarLoop]: Abstraction has 6175 states and 9075 transitions. [2025-02-07 23:14:09,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.666666666666664) internal successors, (268), 6 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:09,475 INFO L276 IsEmpty]: Start isEmpty. Operand 6175 states and 9075 transitions. [2025-02-07 23:14:09,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-02-07 23:14:09,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:09,480 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:09,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-07 23:14:09,480 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:09,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:09,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1815823405, now seen corresponding path program 1 times [2025-02-07 23:14:09,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:09,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047605799] [2025-02-07 23:14:09,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:09,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:09,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-02-07 23:14:09,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-02-07 23:14:09,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:09,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:10,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:10,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047605799] [2025-02-07 23:14:10,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047605799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:10,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:10,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 23:14:10,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768094356] [2025-02-07 23:14:10,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:10,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 23:14:10,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:10,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 23:14:10,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:14:10,491 INFO L87 Difference]: Start difference. First operand 6175 states and 9075 transitions. Second operand has 12 states, 12 states have (on average 22.416666666666668) internal successors, (269), 12 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:11,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:11,243 INFO L93 Difference]: Finished difference Result 10063 states and 14769 transitions. [2025-02-07 23:14:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 23:14:11,243 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 22.416666666666668) internal successors, (269), 12 states have internal predecessors, (269), 0 states have call successors, (0), 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 269 [2025-02-07 23:14:11,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:11,254 INFO L225 Difference]: With dead ends: 10063 [2025-02-07 23:14:11,254 INFO L226 Difference]: Without dead ends: 6360 [2025-02-07 23:14:11,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-02-07 23:14:11,260 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 110 mSDsluCounter, 6225 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 6855 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:11,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 6855 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1602 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 23:14:11,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6360 states. [2025-02-07 23:14:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6360 to 6196. [2025-02-07 23:14:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6196 states, 6195 states have (on average 1.4692493946731235) internal successors, (9102), 6195 states have internal predecessors, (9102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:11,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6196 states to 6196 states and 9102 transitions. [2025-02-07 23:14:11,341 INFO L78 Accepts]: Start accepts. Automaton has 6196 states and 9102 transitions. Word has length 269 [2025-02-07 23:14:11,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:11,342 INFO L471 AbstractCegarLoop]: Abstraction has 6196 states and 9102 transitions. [2025-02-07 23:14:11,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.416666666666668) internal successors, (269), 12 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:11,342 INFO L276 IsEmpty]: Start isEmpty. Operand 6196 states and 9102 transitions. [2025-02-07 23:14:11,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-02-07 23:14:11,348 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:11,348 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:11,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-07 23:14:11,348 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:11,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:11,349 INFO L85 PathProgramCache]: Analyzing trace with hash -556738839, now seen corresponding path program 1 times [2025-02-07 23:14:11,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:11,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483982823] [2025-02-07 23:14:11,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:11,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:11,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-02-07 23:14:12,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-02-07 23:14:12,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:12,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:12,926 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:12,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:12,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483982823] [2025-02-07 23:14:12,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483982823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:12,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:12,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-07 23:14:12,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372254463] [2025-02-07 23:14:12,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:12,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 23:14:12,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:12,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 23:14:12,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:14:12,928 INFO L87 Difference]: Start difference. First operand 6196 states and 9102 transitions. Second operand has 9 states, 9 states have (on average 29.88888888888889) internal successors, (269), 9 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:13,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:13,638 INFO L93 Difference]: Finished difference Result 13642 states and 20012 transitions. [2025-02-07 23:14:13,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:14:13,638 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 29.88888888888889) internal successors, (269), 9 states have internal predecessors, (269), 0 states have call successors, (0), 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 269 [2025-02-07 23:14:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:13,658 INFO L225 Difference]: With dead ends: 13642 [2025-02-07 23:14:13,661 INFO L226 Difference]: Without dead ends: 9887 [2025-02-07 23:14:13,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:14:13,676 INFO L435 NwaCegarLoop]: 1030 mSDtfsCounter, 667 mSDsluCounter, 6721 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 7751 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:13,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 7751 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 23:14:13,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9887 states. [2025-02-07 23:14:13,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9887 to 6315. [2025-02-07 23:14:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6315 states, 6314 states have (on average 1.468324358568261) internal successors, (9271), 6314 states have internal predecessors, (9271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6315 states to 6315 states and 9271 transitions. [2025-02-07 23:14:13,748 INFO L78 Accepts]: Start accepts. Automaton has 6315 states and 9271 transitions. Word has length 269 [2025-02-07 23:14:13,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:13,748 INFO L471 AbstractCegarLoop]: Abstraction has 6315 states and 9271 transitions. [2025-02-07 23:14:13,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.88888888888889) internal successors, (269), 9 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:13,749 INFO L276 IsEmpty]: Start isEmpty. Operand 6315 states and 9271 transitions. [2025-02-07 23:14:13,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-02-07 23:14:13,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:13,753 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:13,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-07 23:14:13,753 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:13,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:13,754 INFO L85 PathProgramCache]: Analyzing trace with hash 68875412, now seen corresponding path program 1 times [2025-02-07 23:14:13,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:13,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643073019] [2025-02-07 23:14:13,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:13,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:13,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-02-07 23:14:13,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-02-07 23:14:13,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:13,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:14,029 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:14,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:14,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643073019] [2025-02-07 23:14:14,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643073019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:14,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:14,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:14:14,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324679587] [2025-02-07 23:14:14,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:14,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:14,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:14,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:14,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:14,032 INFO L87 Difference]: Start difference. First operand 6315 states and 9271 transitions. Second operand has 5 states, 5 states have (on average 53.8) internal successors, (269), 5 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:14,253 INFO L93 Difference]: Finished difference Result 10233 states and 15011 transitions. [2025-02-07 23:14:14,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:14:14,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.8) internal successors, (269), 5 states have internal predecessors, (269), 0 states have call successors, (0), 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 269 [2025-02-07 23:14:14,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:14,260 INFO L225 Difference]: With dead ends: 10233 [2025-02-07 23:14:14,260 INFO L226 Difference]: Without dead ends: 6425 [2025-02-07 23:14:14,264 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-02-07 23:14:14,265 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 36 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 2355 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:14,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 2355 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:14:14,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6425 states. [2025-02-07 23:14:14,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6425 to 6425. [2025-02-07 23:14:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6425 states, 6424 states have (on average 1.4677770859277708) internal successors, (9429), 6424 states have internal predecessors, (9429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:14,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6425 states to 6425 states and 9429 transitions. [2025-02-07 23:14:14,319 INFO L78 Accepts]: Start accepts. Automaton has 6425 states and 9429 transitions. Word has length 269 [2025-02-07 23:14:14,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:14,320 INFO L471 AbstractCegarLoop]: Abstraction has 6425 states and 9429 transitions. [2025-02-07 23:14:14,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.8) internal successors, (269), 5 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:14,321 INFO L276 IsEmpty]: Start isEmpty. Operand 6425 states and 9429 transitions. [2025-02-07 23:14:14,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-02-07 23:14:14,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:14,326 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:14,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-07 23:14:14,326 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:14,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:14,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1458206919, now seen corresponding path program 1 times [2025-02-07 23:14:14,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:14,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202240155] [2025-02-07 23:14:14,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:14,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:14,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-02-07 23:14:15,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-02-07 23:14:15,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:15,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:15,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:15,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202240155] [2025-02-07 23:14:15,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202240155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:15,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:15,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:14:15,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001897726] [2025-02-07 23:14:15,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:15,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:14:15,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:15,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:14:15,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:14:15,579 INFO L87 Difference]: Start difference. First operand 6425 states and 9429 transitions. Second operand has 7 states, 7 states have (on average 38.42857142857143) internal successors, (269), 6 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:15,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:15,908 INFO L93 Difference]: Finished difference Result 10333 states and 15155 transitions. [2025-02-07 23:14:15,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:14:15,908 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 38.42857142857143) internal successors, (269), 6 states have internal predecessors, (269), 0 states have call successors, (0), 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 269 [2025-02-07 23:14:15,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:15,912 INFO L225 Difference]: With dead ends: 10333 [2025-02-07 23:14:15,912 INFO L226 Difference]: Without dead ends: 6445 [2025-02-07 23:14:15,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:14:15,914 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 474 mSDsluCounter, 2315 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 2896 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:15,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 2896 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:14:15,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6445 states. [2025-02-07 23:14:15,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6445 to 6445. [2025-02-07 23:14:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6445 states, 6444 states have (on average 1.4669459962756053) internal successors, (9453), 6444 states have internal predecessors, (9453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6445 states to 6445 states and 9453 transitions. [2025-02-07 23:14:15,963 INFO L78 Accepts]: Start accepts. Automaton has 6445 states and 9453 transitions. Word has length 269 [2025-02-07 23:14:15,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:15,963 INFO L471 AbstractCegarLoop]: Abstraction has 6445 states and 9453 transitions. [2025-02-07 23:14:15,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.42857142857143) internal successors, (269), 6 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:15,963 INFO L276 IsEmpty]: Start isEmpty. Operand 6445 states and 9453 transitions. [2025-02-07 23:14:15,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-02-07 23:14:15,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:15,967 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:15,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-07 23:14:15,968 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:15,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:15,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1494247638, now seen corresponding path program 1 times [2025-02-07 23:14:15,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:15,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084377319] [2025-02-07 23:14:15,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:15,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:16,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-07 23:14:16,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-07 23:14:16,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:16,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:16,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:16,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084377319] [2025-02-07 23:14:16,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084377319] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:16,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:16,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:14:16,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171449003] [2025-02-07 23:14:16,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:16,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:16,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:16,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:16,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:16,451 INFO L87 Difference]: Start difference. First operand 6445 states and 9453 transitions. Second operand has 5 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:16,711 INFO L93 Difference]: Finished difference Result 10392 states and 15226 transitions. [2025-02-07 23:14:16,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:14:16,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 0 states have call successors, (0), 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 270 [2025-02-07 23:14:16,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:16,716 INFO L225 Difference]: With dead ends: 10392 [2025-02-07 23:14:16,716 INFO L226 Difference]: Without dead ends: 6439 [2025-02-07 23:14:16,719 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-02-07 23:14:16,719 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 168 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 2355 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:16,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 2355 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:14:16,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6439 states. [2025-02-07 23:14:16,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6439 to 6439. [2025-02-07 23:14:16,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6439 states, 6438 states have (on average 1.466449207828518) internal successors, (9441), 6438 states have internal predecessors, (9441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:16,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6439 states to 6439 states and 9441 transitions. [2025-02-07 23:14:16,764 INFO L78 Accepts]: Start accepts. Automaton has 6439 states and 9441 transitions. Word has length 270 [2025-02-07 23:14:16,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:16,764 INFO L471 AbstractCegarLoop]: Abstraction has 6439 states and 9441 transitions. [2025-02-07 23:14:16,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:16,764 INFO L276 IsEmpty]: Start isEmpty. Operand 6439 states and 9441 transitions. [2025-02-07 23:14:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-02-07 23:14:16,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:16,768 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:16,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-07 23:14:16,768 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:16,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:16,769 INFO L85 PathProgramCache]: Analyzing trace with hash -954079308, now seen corresponding path program 1 times [2025-02-07 23:14:16,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:16,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074247182] [2025-02-07 23:14:16,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:16,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:16,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-07 23:14:17,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-07 23:14:17,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:17,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:17,717 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:17,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:17,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074247182] [2025-02-07 23:14:17,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074247182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:17,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:17,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:14:17,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629520051] [2025-02-07 23:14:17,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:17,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:14:17,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:17,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:14:17,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:14:17,718 INFO L87 Difference]: Start difference. First operand 6439 states and 9441 transitions. Second operand has 7 states, 7 states have (on average 38.57142857142857) internal successors, (270), 7 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:18,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:18,056 INFO L93 Difference]: Finished difference Result 10460 states and 15321 transitions. [2025-02-07 23:14:18,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:14:18,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 38.57142857142857) internal successors, (270), 7 states have internal predecessors, (270), 0 states have call successors, (0), 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 270 [2025-02-07 23:14:18,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:18,061 INFO L225 Difference]: With dead ends: 10460 [2025-02-07 23:14:18,061 INFO L226 Difference]: Without dead ends: 6511 [2025-02-07 23:14:18,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:14:18,064 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 649 mSDsluCounter, 2436 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 3020 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:18,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 3020 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:14:18,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6511 states. [2025-02-07 23:14:18,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6511 to 6495. [2025-02-07 23:14:18,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6495 states, 6494 states have (on average 1.4655066214967662) internal successors, (9517), 6494 states have internal predecessors, (9517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:18,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6495 states to 6495 states and 9517 transitions. [2025-02-07 23:14:18,101 INFO L78 Accepts]: Start accepts. Automaton has 6495 states and 9517 transitions. Word has length 270 [2025-02-07 23:14:18,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:18,101 INFO L471 AbstractCegarLoop]: Abstraction has 6495 states and 9517 transitions. [2025-02-07 23:14:18,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.57142857142857) internal successors, (270), 7 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:18,101 INFO L276 IsEmpty]: Start isEmpty. Operand 6495 states and 9517 transitions. [2025-02-07 23:14:18,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-02-07 23:14:18,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:18,105 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:18,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-07 23:14:18,105 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:18,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:18,105 INFO L85 PathProgramCache]: Analyzing trace with hash 487438325, now seen corresponding path program 1 times [2025-02-07 23:14:18,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:18,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980263925] [2025-02-07 23:14:18,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:18,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:18,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-07 23:14:18,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-07 23:14:18,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:18,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:18,667 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:18,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:18,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980263925] [2025-02-07 23:14:18,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980263925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:18,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:18,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-07 23:14:18,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216418506] [2025-02-07 23:14:18,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:18,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 23:14:18,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:18,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 23:14:18,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:14:18,670 INFO L87 Difference]: Start difference. First operand 6495 states and 9517 transitions. Second operand has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:19,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:19,017 INFO L93 Difference]: Finished difference Result 12773 states and 18753 transitions. [2025-02-07 23:14:19,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 23:14:19,017 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 0 states have call successors, (0), 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 270 [2025-02-07 23:14:19,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:19,022 INFO L225 Difference]: With dead ends: 12773 [2025-02-07 23:14:19,022 INFO L226 Difference]: Without dead ends: 7303 [2025-02-07 23:14:19,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:14:19,025 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 45 mSDsluCounter, 4051 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4633 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:19,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4633 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:14:19,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7303 states. [2025-02-07 23:14:19,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7303 to 7303. [2025-02-07 23:14:19,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7303 states, 7302 states have (on average 1.464941112024103) internal successors, (10697), 7302 states have internal predecessors, (10697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:19,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 10697 transitions. [2025-02-07 23:14:19,065 INFO L78 Accepts]: Start accepts. Automaton has 7303 states and 10697 transitions. Word has length 270 [2025-02-07 23:14:19,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:19,065 INFO L471 AbstractCegarLoop]: Abstraction has 7303 states and 10697 transitions. [2025-02-07 23:14:19,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:19,065 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 10697 transitions. [2025-02-07 23:14:19,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-02-07 23:14:19,069 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:19,069 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:19,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-07 23:14:19,070 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:19,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:19,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1657422138, now seen corresponding path program 1 times [2025-02-07 23:14:19,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:19,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108271979] [2025-02-07 23:14:19,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:19,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:19,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-07 23:14:19,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-07 23:14:19,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:19,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:19,335 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:19,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:19,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108271979] [2025-02-07 23:14:19,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108271979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:19,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:19,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:14:19,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757875459] [2025-02-07 23:14:19,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:19,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:14:19,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:19,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:14:19,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:14:19,337 INFO L87 Difference]: Start difference. First operand 7303 states and 10697 transitions. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:19,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:19,493 INFO L93 Difference]: Finished difference Result 13261 states and 19421 transitions. [2025-02-07 23:14:19,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:14:19,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 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 271 [2025-02-07 23:14:19,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:19,499 INFO L225 Difference]: With dead ends: 13261 [2025-02-07 23:14:19,499 INFO L226 Difference]: Without dead ends: 7367 [2025-02-07 23:14:19,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:14:19,508 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 0 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1769 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:19,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1769 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:14:19,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7367 states. [2025-02-07 23:14:19,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7367 to 7367. [2025-02-07 23:14:19,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7367 states, 7366 states have (on average 1.4609014390442574) internal successors, (10761), 7366 states have internal predecessors, (10761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:19,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7367 states to 7367 states and 10761 transitions. [2025-02-07 23:14:19,627 INFO L78 Accepts]: Start accepts. Automaton has 7367 states and 10761 transitions. Word has length 271 [2025-02-07 23:14:19,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:19,628 INFO L471 AbstractCegarLoop]: Abstraction has 7367 states and 10761 transitions. [2025-02-07 23:14:19,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:19,628 INFO L276 IsEmpty]: Start isEmpty. Operand 7367 states and 10761 transitions. [2025-02-07 23:14:19,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-02-07 23:14:19,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:19,637 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:19,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-07 23:14:19,637 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:19,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:19,637 INFO L85 PathProgramCache]: Analyzing trace with hash -910924119, now seen corresponding path program 1 times [2025-02-07 23:14:19,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:19,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834130302] [2025-02-07 23:14:19,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:19,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:19,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-07 23:14:20,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-07 23:14:20,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:20,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:21,275 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:21,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:21,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834130302] [2025-02-07 23:14:21,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834130302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:21,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:21,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-07 23:14:21,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365296646] [2025-02-07 23:14:21,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:21,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 23:14:21,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:21,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 23:14:21,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-02-07 23:14:21,276 INFO L87 Difference]: Start difference. First operand 7367 states and 10761 transitions. Second operand has 14 states, 14 states have (on average 19.357142857142858) internal successors, (271), 14 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:22,066 INFO L93 Difference]: Finished difference Result 12015 states and 17542 transitions. [2025-02-07 23:14:22,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 23:14:22,067 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 19.357142857142858) internal successors, (271), 14 states have internal predecessors, (271), 0 states have call successors, (0), 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 271 [2025-02-07 23:14:22,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:22,072 INFO L225 Difference]: With dead ends: 12015 [2025-02-07 23:14:22,072 INFO L226 Difference]: Without dead ends: 7642 [2025-02-07 23:14:22,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-02-07 23:14:22,076 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 322 mSDsluCounter, 7096 mSDsCounter, 0 mSdLazyCounter, 1842 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 7806 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:22,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 7806 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1842 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 23:14:22,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7642 states. [2025-02-07 23:14:22,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7642 to 7634. [2025-02-07 23:14:22,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7634 states, 7633 states have (on average 1.4610244988864143) internal successors, (11152), 7633 states have internal predecessors, (11152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7634 states to 7634 states and 11152 transitions. [2025-02-07 23:14:22,122 INFO L78 Accepts]: Start accepts. Automaton has 7634 states and 11152 transitions. Word has length 271 [2025-02-07 23:14:22,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:22,123 INFO L471 AbstractCegarLoop]: Abstraction has 7634 states and 11152 transitions. [2025-02-07 23:14:22,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 19.357142857142858) internal successors, (271), 14 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:22,123 INFO L276 IsEmpty]: Start isEmpty. Operand 7634 states and 11152 transitions. [2025-02-07 23:14:22,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-02-07 23:14:22,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:22,127 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:22,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-07 23:14:22,128 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:22,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:22,128 INFO L85 PathProgramCache]: Analyzing trace with hash -845639655, now seen corresponding path program 1 times [2025-02-07 23:14:22,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:22,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669140737] [2025-02-07 23:14:22,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:22,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:22,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-07 23:14:22,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-07 23:14:22,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:22,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:23,451 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:23,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:23,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669140737] [2025-02-07 23:14:23,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669140737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:23,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:23,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 23:14:23,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500676266] [2025-02-07 23:14:23,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:23,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:14:23,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:23,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:14:23,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:14:23,453 INFO L87 Difference]: Start difference. First operand 7634 states and 11152 transitions. Second operand has 10 states, 10 states have (on average 27.1) internal successors, (271), 10 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:23,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:23,963 INFO L93 Difference]: Finished difference Result 12640 states and 18436 transitions. [2025-02-07 23:14:23,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:14:23,963 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.1) internal successors, (271), 10 states have internal predecessors, (271), 0 states have call successors, (0), 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 271 [2025-02-07 23:14:23,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:23,969 INFO L225 Difference]: With dead ends: 12640 [2025-02-07 23:14:23,969 INFO L226 Difference]: Without dead ends: 7859 [2025-02-07 23:14:23,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:14:23,973 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 192 mSDsluCounter, 4428 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 5008 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:23,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 5008 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:14:23,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7859 states. [2025-02-07 23:14:24,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7859 to 7787. [2025-02-07 23:14:24,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7787 states, 7786 states have (on average 1.4585152838427948) internal successors, (11356), 7786 states have internal predecessors, (11356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7787 states to 7787 states and 11356 transitions. [2025-02-07 23:14:24,029 INFO L78 Accepts]: Start accepts. Automaton has 7787 states and 11356 transitions. Word has length 271 [2025-02-07 23:14:24,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:24,029 INFO L471 AbstractCegarLoop]: Abstraction has 7787 states and 11356 transitions. [2025-02-07 23:14:24,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.1) internal successors, (271), 10 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:24,029 INFO L276 IsEmpty]: Start isEmpty. Operand 7787 states and 11356 transitions. [2025-02-07 23:14:24,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-02-07 23:14:24,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:24,034 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:24,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-07 23:14:24,035 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:24,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:24,035 INFO L85 PathProgramCache]: Analyzing trace with hash -955793835, now seen corresponding path program 1 times [2025-02-07 23:14:24,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:24,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700566013] [2025-02-07 23:14:24,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:24,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:24,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-07 23:14:24,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-07 23:14:24,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:24,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:25,649 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:25,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:25,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700566013] [2025-02-07 23:14:25,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700566013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:25,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:25,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 23:14:25,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259049852] [2025-02-07 23:14:25,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:25,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 23:14:25,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:25,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 23:14:25,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:14:25,651 INFO L87 Difference]: Start difference. First operand 7787 states and 11356 transitions. Second operand has 12 states, 12 states have (on average 22.583333333333332) internal successors, (271), 12 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:26,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:26,232 INFO L93 Difference]: Finished difference Result 20127 states and 29443 transitions. [2025-02-07 23:14:26,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 23:14:26,233 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 22.583333333333332) internal successors, (271), 12 states have internal predecessors, (271), 0 states have call successors, (0), 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 271 [2025-02-07 23:14:26,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:26,244 INFO L225 Difference]: With dead ends: 20127 [2025-02-07 23:14:26,244 INFO L226 Difference]: Without dead ends: 12503 [2025-02-07 23:14:26,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-02-07 23:14:26,251 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 911 mSDsluCounter, 4555 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 5128 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:26,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 5128 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:14:26,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12503 states. [2025-02-07 23:14:26,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12503 to 12363. [2025-02-07 23:14:26,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12363 states, 12362 states have (on average 1.4593107911341208) internal successors, (18040), 12362 states have internal predecessors, (18040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:26,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12363 states to 12363 states and 18040 transitions. [2025-02-07 23:14:26,446 INFO L78 Accepts]: Start accepts. Automaton has 12363 states and 18040 transitions. Word has length 271 [2025-02-07 23:14:26,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:26,446 INFO L471 AbstractCegarLoop]: Abstraction has 12363 states and 18040 transitions. [2025-02-07 23:14:26,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.583333333333332) internal successors, (271), 12 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:26,446 INFO L276 IsEmpty]: Start isEmpty. Operand 12363 states and 18040 transitions. [2025-02-07 23:14:26,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-02-07 23:14:26,453 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:26,453 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:26,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-07 23:14:26,454 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:26,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:26,454 INFO L85 PathProgramCache]: Analyzing trace with hash -2084100464, now seen corresponding path program 1 times [2025-02-07 23:14:26,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:26,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958455369] [2025-02-07 23:14:26,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:26,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:26,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-07 23:14:26,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-07 23:14:26,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:26,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:26,768 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:26,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:26,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958455369] [2025-02-07 23:14:26,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958455369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:26,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:26,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:14:26,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203954334] [2025-02-07 23:14:26,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:26,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:26,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:26,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:26,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:26,770 INFO L87 Difference]: Start difference. First operand 12363 states and 18040 transitions. Second operand has 5 states, 5 states have (on average 54.2) internal successors, (271), 5 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:26,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:26,963 INFO L93 Difference]: Finished difference Result 22265 states and 32495 transitions. [2025-02-07 23:14:26,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:14:26,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.2) internal successors, (271), 5 states have internal predecessors, (271), 0 states have call successors, (0), 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 271 [2025-02-07 23:14:26,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:26,973 INFO L225 Difference]: With dead ends: 22265 [2025-02-07 23:14:26,973 INFO L226 Difference]: Without dead ends: 12507 [2025-02-07 23:14:26,980 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-02-07 23:14:26,980 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 4 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2350 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:26,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2350 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:14:26,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12507 states. [2025-02-07 23:14:27,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12507 to 12507. [2025-02-07 23:14:27,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12507 states, 12506 states have (on average 1.4578602270909964) internal successors, (18232), 12506 states have internal predecessors, (18232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:27,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12507 states to 12507 states and 18232 transitions. [2025-02-07 23:14:27,070 INFO L78 Accepts]: Start accepts. Automaton has 12507 states and 18232 transitions. Word has length 271 [2025-02-07 23:14:27,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:27,070 INFO L471 AbstractCegarLoop]: Abstraction has 12507 states and 18232 transitions. [2025-02-07 23:14:27,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.2) internal successors, (271), 5 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:27,070 INFO L276 IsEmpty]: Start isEmpty. Operand 12507 states and 18232 transitions. [2025-02-07 23:14:27,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-07 23:14:27,076 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:27,076 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:27,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-07 23:14:27,076 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:27,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:27,077 INFO L85 PathProgramCache]: Analyzing trace with hash -141006406, now seen corresponding path program 1 times [2025-02-07 23:14:27,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:27,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427397110] [2025-02-07 23:14:27,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:27,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:27,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-07 23:14:27,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-07 23:14:27,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:27,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:27,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:27,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427397110] [2025-02-07 23:14:27,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427397110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:27,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:27,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:14:27,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693360768] [2025-02-07 23:14:27,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:27,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:14:27,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:27,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:14:27,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:14:27,406 INFO L87 Difference]: Start difference. First operand 12507 states and 18232 transitions. Second operand has 6 states, 6 states have (on average 45.333333333333336) internal successors, (272), 6 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:27,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:27,623 INFO L93 Difference]: Finished difference Result 24705 states and 36043 transitions. [2025-02-07 23:14:27,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:14:27,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.333333333333336) internal successors, (272), 6 states have internal predecessors, (272), 0 states have call successors, (0), 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 272 [2025-02-07 23:14:27,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:27,634 INFO L225 Difference]: With dead ends: 24705 [2025-02-07 23:14:27,634 INFO L226 Difference]: Without dead ends: 12651 [2025-02-07 23:14:27,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:14:27,644 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 4 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2350 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:27,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2350 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:14:27,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12651 states. [2025-02-07 23:14:27,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12651 to 12651. [2025-02-07 23:14:27,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12651 states, 12650 states have (on average 1.4564426877470356) internal successors, (18424), 12650 states have internal predecessors, (18424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12651 states to 12651 states and 18424 transitions. [2025-02-07 23:14:27,783 INFO L78 Accepts]: Start accepts. Automaton has 12651 states and 18424 transitions. Word has length 272 [2025-02-07 23:14:27,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:27,783 INFO L471 AbstractCegarLoop]: Abstraction has 12651 states and 18424 transitions. [2025-02-07 23:14:27,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.333333333333336) internal successors, (272), 6 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:27,784 INFO L276 IsEmpty]: Start isEmpty. Operand 12651 states and 18424 transitions. [2025-02-07 23:14:27,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-07 23:14:27,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:27,792 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:27,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-07 23:14:27,793 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:27,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:27,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1358881853, now seen corresponding path program 1 times [2025-02-07 23:14:27,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:27,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109573196] [2025-02-07 23:14:27,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:27,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:27,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-07 23:14:28,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-07 23:14:28,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:28,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:29,268 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:29,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:29,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109573196] [2025-02-07 23:14:29,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109573196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:29,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:29,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-07 23:14:29,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473923901] [2025-02-07 23:14:29,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:29,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 23:14:29,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:29,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 23:14:29,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-07 23:14:29,273 INFO L87 Difference]: Start difference. First operand 12651 states and 18424 transitions. Second operand has 13 states, 13 states have (on average 20.923076923076923) internal successors, (272), 13 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:29,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:29,859 INFO L93 Difference]: Finished difference Result 20185 states and 29367 transitions. [2025-02-07 23:14:29,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 23:14:29,860 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 20.923076923076923) internal successors, (272), 13 states have internal predecessors, (272), 0 states have call successors, (0), 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 272 [2025-02-07 23:14:29,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:29,868 INFO L225 Difference]: With dead ends: 20185 [2025-02-07 23:14:29,868 INFO L226 Difference]: Without dead ends: 12813 [2025-02-07 23:14:29,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-02-07 23:14:29,873 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 110 mSDsluCounter, 6826 mSDsCounter, 0 mSdLazyCounter, 1742 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 7454 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:29,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 7454 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1742 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:14:29,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12813 states. [2025-02-07 23:14:29,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12813 to 12651. [2025-02-07 23:14:29,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12651 states, 12650 states have (on average 1.4563636363636363) internal successors, (18423), 12650 states have internal predecessors, (18423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:29,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12651 states to 12651 states and 18423 transitions. [2025-02-07 23:14:29,956 INFO L78 Accepts]: Start accepts. Automaton has 12651 states and 18423 transitions. Word has length 272 [2025-02-07 23:14:29,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:29,956 INFO L471 AbstractCegarLoop]: Abstraction has 12651 states and 18423 transitions. [2025-02-07 23:14:29,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 20.923076923076923) internal successors, (272), 13 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:29,957 INFO L276 IsEmpty]: Start isEmpty. Operand 12651 states and 18423 transitions. [2025-02-07 23:14:29,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-07 23:14:29,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:29,962 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:29,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-07 23:14:29,962 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:29,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:29,963 INFO L85 PathProgramCache]: Analyzing trace with hash -485930675, now seen corresponding path program 1 times [2025-02-07 23:14:29,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:29,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386038268] [2025-02-07 23:14:29,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:29,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:29,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-07 23:14:30,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-07 23:14:30,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:30,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:30,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:30,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386038268] [2025-02-07 23:14:30,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386038268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:30,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:30,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-07 23:14:30,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381222671] [2025-02-07 23:14:30,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:30,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 23:14:30,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:30,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 23:14:30,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:14:30,632 INFO L87 Difference]: Start difference. First operand 12651 states and 18423 transitions. Second operand has 9 states, 9 states have (on average 30.22222222222222) internal successors, (272), 9 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:31,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:31,247 INFO L93 Difference]: Finished difference Result 25662 states and 37373 transitions. [2025-02-07 23:14:31,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:14:31,247 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 30.22222222222222) internal successors, (272), 9 states have internal predecessors, (272), 0 states have call successors, (0), 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 272 [2025-02-07 23:14:31,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:31,262 INFO L225 Difference]: With dead ends: 25662 [2025-02-07 23:14:31,263 INFO L226 Difference]: Without dead ends: 18290 [2025-02-07 23:14:31,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:14:31,279 INFO L435 NwaCegarLoop]: 1030 mSDtfsCounter, 657 mSDsluCounter, 6716 mSDsCounter, 0 mSdLazyCounter, 1707 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 7746 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:31,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 7746 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1707 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:14:31,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18290 states. [2025-02-07 23:14:31,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18290 to 12648. [2025-02-07 23:14:31,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12648 states, 12647 states have (on average 1.456155610026093) internal successors, (18416), 12647 states have internal predecessors, (18416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:31,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12648 states to 12648 states and 18416 transitions. [2025-02-07 23:14:31,384 INFO L78 Accepts]: Start accepts. Automaton has 12648 states and 18416 transitions. Word has length 272 [2025-02-07 23:14:31,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:31,385 INFO L471 AbstractCegarLoop]: Abstraction has 12648 states and 18416 transitions. [2025-02-07 23:14:31,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.22222222222222) internal successors, (272), 9 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:31,385 INFO L276 IsEmpty]: Start isEmpty. Operand 12648 states and 18416 transitions. [2025-02-07 23:14:31,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-07 23:14:31,390 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:31,390 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:31,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-07 23:14:31,390 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:31,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:31,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1108749168, now seen corresponding path program 1 times [2025-02-07 23:14:31,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:31,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719752013] [2025-02-07 23:14:31,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:31,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:31,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-07 23:14:31,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-07 23:14:31,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:31,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:31,666 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:31,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:31,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719752013] [2025-02-07 23:14:31,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719752013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:31,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:31,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:14:31,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537035916] [2025-02-07 23:14:31,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:31,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:31,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:31,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:31,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:31,667 INFO L87 Difference]: Start difference. First operand 12648 states and 18416 transitions. Second operand has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:31,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:31,879 INFO L93 Difference]: Finished difference Result 20109 states and 29253 transitions. [2025-02-07 23:14:31,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:14:31,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 0 states have call successors, (0), 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 272 [2025-02-07 23:14:31,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:31,890 INFO L225 Difference]: With dead ends: 20109 [2025-02-07 23:14:31,890 INFO L226 Difference]: Without dead ends: 12740 [2025-02-07 23:14:31,896 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-02-07 23:14:31,896 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 15 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:31,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2351 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:14:31,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12740 states. [2025-02-07 23:14:31,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12740 to 12740. [2025-02-07 23:14:31,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12740 states, 12739 states have (on average 1.4553732632074732) internal successors, (18540), 12739 states have internal predecessors, (18540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:31,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12740 states to 12740 states and 18540 transitions. [2025-02-07 23:14:31,981 INFO L78 Accepts]: Start accepts. Automaton has 12740 states and 18540 transitions. Word has length 272 [2025-02-07 23:14:31,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:31,982 INFO L471 AbstractCegarLoop]: Abstraction has 12740 states and 18540 transitions. [2025-02-07 23:14:31,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:31,982 INFO L276 IsEmpty]: Start isEmpty. Operand 12740 states and 18540 transitions. [2025-02-07 23:14:31,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-07 23:14:31,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:31,989 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:31,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-07 23:14:31,989 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:31,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:31,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1649025291, now seen corresponding path program 1 times [2025-02-07 23:14:31,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:31,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656734641] [2025-02-07 23:14:31,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:31,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:32,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-07 23:14:32,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-07 23:14:32,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:32,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:32,349 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:32,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:32,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656734641] [2025-02-07 23:14:32,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656734641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:32,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:32,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:14:32,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859404620] [2025-02-07 23:14:32,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:32,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:32,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:32,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:32,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:32,351 INFO L87 Difference]: Start difference. First operand 12740 states and 18540 transitions. Second operand has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:32,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:32,537 INFO L93 Difference]: Finished difference Result 20205 states and 29381 transitions. [2025-02-07 23:14:32,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:14:32,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 0 states have call successors, (0), 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 272 [2025-02-07 23:14:32,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:32,546 INFO L225 Difference]: With dead ends: 20205 [2025-02-07 23:14:32,546 INFO L226 Difference]: Without dead ends: 12756 [2025-02-07 23:14:32,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-07 23:14:32,552 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 0 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1765 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:32,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1765 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:14:32,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12756 states. [2025-02-07 23:14:32,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12756 to 12756. [2025-02-07 23:14:32,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12756 states, 12755 states have (on average 1.4548020384163074) internal successors, (18556), 12755 states have internal predecessors, (18556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:32,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12756 states to 12756 states and 18556 transitions. [2025-02-07 23:14:32,638 INFO L78 Accepts]: Start accepts. Automaton has 12756 states and 18556 transitions. Word has length 272 [2025-02-07 23:14:32,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:32,639 INFO L471 AbstractCegarLoop]: Abstraction has 12756 states and 18556 transitions. [2025-02-07 23:14:32,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:32,639 INFO L276 IsEmpty]: Start isEmpty. Operand 12756 states and 18556 transitions. [2025-02-07 23:14:32,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-07 23:14:32,644 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:32,644 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:32,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-07 23:14:32,645 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:32,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:32,645 INFO L85 PathProgramCache]: Analyzing trace with hash -465524778, now seen corresponding path program 1 times [2025-02-07 23:14:32,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:32,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273576818] [2025-02-07 23:14:32,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:32,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:32,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-07 23:14:33,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-07 23:14:33,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:33,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:33,623 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:33,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:33,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273576818] [2025-02-07 23:14:33,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273576818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:33,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:33,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:14:33,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149607401] [2025-02-07 23:14:33,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:33,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:14:33,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:33,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:14:33,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:14:33,625 INFO L87 Difference]: Start difference. First operand 12756 states and 18556 transitions. Second operand has 7 states, 7 states have (on average 38.857142857142854) internal successors, (272), 6 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:33,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:33,947 INFO L93 Difference]: Finished difference Result 20221 states and 29390 transitions. [2025-02-07 23:14:33,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:14:33,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 38.857142857142854) internal successors, (272), 6 states have internal predecessors, (272), 0 states have call successors, (0), 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 272 [2025-02-07 23:14:33,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:33,959 INFO L225 Difference]: With dead ends: 20221 [2025-02-07 23:14:33,959 INFO L226 Difference]: Without dead ends: 12706 [2025-02-07 23:14:33,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:14:33,968 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 500 mSDsluCounter, 2311 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 2891 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:33,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 2891 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:14:33,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12706 states. [2025-02-07 23:14:34,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12706 to 12706. [2025-02-07 23:14:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12706 states, 12705 states have (on average 1.4549390003935458) internal successors, (18485), 12705 states have internal predecessors, (18485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:34,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12706 states to 12706 states and 18485 transitions. [2025-02-07 23:14:34,065 INFO L78 Accepts]: Start accepts. Automaton has 12706 states and 18485 transitions. Word has length 272 [2025-02-07 23:14:34,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:34,065 INFO L471 AbstractCegarLoop]: Abstraction has 12706 states and 18485 transitions. [2025-02-07 23:14:34,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.857142857142854) internal successors, (272), 6 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:34,065 INFO L276 IsEmpty]: Start isEmpty. Operand 12706 states and 18485 transitions. [2025-02-07 23:14:34,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-07 23:14:34,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:34,072 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:34,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-07 23:14:34,072 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:34,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:34,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1203362463, now seen corresponding path program 1 times [2025-02-07 23:14:34,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:34,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435845564] [2025-02-07 23:14:34,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:34,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:34,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-07 23:14:34,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-07 23:14:34,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:34,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:34,336 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:34,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:34,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435845564] [2025-02-07 23:14:34,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435845564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:34,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:34,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:14:34,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437667059] [2025-02-07 23:14:34,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:34,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:34,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:34,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:34,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:34,338 INFO L87 Difference]: Start difference. First operand 12706 states and 18485 transitions. Second operand has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:34,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:34,576 INFO L93 Difference]: Finished difference Result 26539 states and 38693 transitions. [2025-02-07 23:14:34,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:14:34,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 0 states have call successors, (0), 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 272 [2025-02-07 23:14:34,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:34,589 INFO L225 Difference]: With dead ends: 26539 [2025-02-07 23:14:34,589 INFO L226 Difference]: Without dead ends: 16386 [2025-02-07 23:14:34,598 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-02-07 23:14:34,598 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 67 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:34,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 2351 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:14:34,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16386 states. [2025-02-07 23:14:34,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16386 to 16386. [2025-02-07 23:14:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16386 states, 16385 states have (on average 1.4562709795544706) internal successors, (23861), 16385 states have internal predecessors, (23861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:34,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16386 states to 16386 states and 23861 transitions. [2025-02-07 23:14:34,713 INFO L78 Accepts]: Start accepts. Automaton has 16386 states and 23861 transitions. Word has length 272 [2025-02-07 23:14:34,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:34,713 INFO L471 AbstractCegarLoop]: Abstraction has 16386 states and 23861 transitions. [2025-02-07 23:14:34,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:34,713 INFO L276 IsEmpty]: Start isEmpty. Operand 16386 states and 23861 transitions. [2025-02-07 23:14:34,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-07 23:14:34,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:34,720 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:34,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-07 23:14:34,720 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:34,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:34,721 INFO L85 PathProgramCache]: Analyzing trace with hash 565432088, now seen corresponding path program 1 times [2025-02-07 23:14:34,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:34,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851975971] [2025-02-07 23:14:34,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:34,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:34,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-07 23:14:34,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-07 23:14:34,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:34,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:35,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:35,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851975971] [2025-02-07 23:14:35,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851975971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:35,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:35,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:14:35,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336962115] [2025-02-07 23:14:35,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:35,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:35,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:35,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:35,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:35,049 INFO L87 Difference]: Start difference. First operand 16386 states and 23861 transitions. Second operand has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:35,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:35,338 INFO L93 Difference]: Finished difference Result 30187 states and 43989 transitions. [2025-02-07 23:14:35,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:14:35,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 0 states have call successors, (0), 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 272 [2025-02-07 23:14:35,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:35,352 INFO L225 Difference]: With dead ends: 30187 [2025-02-07 23:14:35,352 INFO L226 Difference]: Without dead ends: 16482 [2025-02-07 23:14:35,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-07 23:14:35,362 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 0 mSDsluCounter, 1686 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2277 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:35,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2277 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:14:35,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16482 states. [2025-02-07 23:14:35,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16482 to 16482. [2025-02-07 23:14:35,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16482 states, 16481 states have (on average 1.453613251623081) internal successors, (23957), 16481 states have internal predecessors, (23957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16482 states to 16482 states and 23957 transitions. [2025-02-07 23:14:35,482 INFO L78 Accepts]: Start accepts. Automaton has 16482 states and 23957 transitions. Word has length 272 [2025-02-07 23:14:35,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:35,482 INFO L471 AbstractCegarLoop]: Abstraction has 16482 states and 23957 transitions. [2025-02-07 23:14:35,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.4) internal successors, (272), 5 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:35,482 INFO L276 IsEmpty]: Start isEmpty. Operand 16482 states and 23957 transitions. [2025-02-07 23:14:35,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-07 23:14:35,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:35,490 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:35,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-07 23:14:35,490 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:35,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:35,490 INFO L85 PathProgramCache]: Analyzing trace with hash 722637420, now seen corresponding path program 1 times [2025-02-07 23:14:35,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:35,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146784382] [2025-02-07 23:14:35,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:35,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:35,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-07 23:14:35,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-07 23:14:35,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:35,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:36,587 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:36,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:36,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146784382] [2025-02-07 23:14:36,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146784382] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:14:36,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77375597] [2025-02-07 23:14:36,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:36,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:14:36,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:14:36,591 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 23:14:36,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 23:14:36,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-07 23:14:37,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-07 23:14:37,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:37,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:37,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 1469 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-07 23:14:37,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:14:37,572 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:37,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:14:37,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77375597] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:37,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 23:14:37,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17] total 26 [2025-02-07 23:14:37,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214247854] [2025-02-07 23:14:37,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:37,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:14:37,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:37,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:14:37,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2025-02-07 23:14:37,578 INFO L87 Difference]: Start difference. First operand 16482 states and 23957 transitions. Second operand has 10 states, 10 states have (on average 27.3) internal successors, (273), 10 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:38,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:38,001 INFO L93 Difference]: Finished difference Result 33555 states and 48725 transitions. [2025-02-07 23:14:38,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 23:14:38,002 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.3) internal successors, (273), 10 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2025-02-07 23:14:38,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:38,024 INFO L225 Difference]: With dead ends: 33555 [2025-02-07 23:14:38,024 INFO L226 Difference]: Without dead ends: 23090 [2025-02-07 23:14:38,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 265 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2025-02-07 23:14:38,037 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 92 mSDsluCounter, 4051 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 4633 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:38,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 4633 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:14:38,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23090 states. [2025-02-07 23:14:38,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23090 to 23090. [2025-02-07 23:14:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23090 states, 23089 states have (on average 1.4492182424531161) internal successors, (33461), 23089 states have internal predecessors, (33461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:38,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23090 states to 23090 states and 33461 transitions. [2025-02-07 23:14:38,219 INFO L78 Accepts]: Start accepts. Automaton has 23090 states and 33461 transitions. Word has length 273 [2025-02-07 23:14:38,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:38,220 INFO L471 AbstractCegarLoop]: Abstraction has 23090 states and 33461 transitions. [2025-02-07 23:14:38,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.3) internal successors, (273), 10 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:38,220 INFO L276 IsEmpty]: Start isEmpty. Operand 23090 states and 33461 transitions. [2025-02-07 23:14:38,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-07 23:14:38,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:38,230 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:38,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 23:14:38,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:14:38,431 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:38,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:38,432 INFO L85 PathProgramCache]: Analyzing trace with hash -968054298, now seen corresponding path program 1 times [2025-02-07 23:14:38,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:38,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066576153] [2025-02-07 23:14:38,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:38,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:38,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-07 23:14:38,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-07 23:14:38,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:38,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:38,910 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:38,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:38,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066576153] [2025-02-07 23:14:38,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066576153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:38,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:38,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:14:38,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193453440] [2025-02-07 23:14:38,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:38,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:38,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:38,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:38,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:38,914 INFO L87 Difference]: Start difference. First operand 23090 states and 33461 transitions. Second operand has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:39,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:39,202 INFO L93 Difference]: Finished difference Result 36702 states and 53162 transitions. [2025-02-07 23:14:39,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:14:39,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2025-02-07 23:14:39,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:39,223 INFO L225 Difference]: With dead ends: 36702 [2025-02-07 23:14:39,223 INFO L226 Difference]: Without dead ends: 23810 [2025-02-07 23:14:39,235 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-02-07 23:14:39,236 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 86 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:39,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 2351 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:14:39,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23810 states. [2025-02-07 23:14:39,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23810 to 23810. [2025-02-07 23:14:39,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23810 states, 23809 states have (on average 1.4493258851694737) internal successors, (34507), 23809 states have internal predecessors, (34507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23810 states to 23810 states and 34507 transitions. [2025-02-07 23:14:39,424 INFO L78 Accepts]: Start accepts. Automaton has 23810 states and 34507 transitions. Word has length 273 [2025-02-07 23:14:39,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:39,425 INFO L471 AbstractCegarLoop]: Abstraction has 23810 states and 34507 transitions. [2025-02-07 23:14:39,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:39,426 INFO L276 IsEmpty]: Start isEmpty. Operand 23810 states and 34507 transitions. [2025-02-07 23:14:39,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-07 23:14:39,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:39,436 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:39,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-07 23:14:39,436 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:39,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:39,436 INFO L85 PathProgramCache]: Analyzing trace with hash -399514987, now seen corresponding path program 1 times [2025-02-07 23:14:39,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:39,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358251392] [2025-02-07 23:14:39,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:39,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:39,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-07 23:14:40,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-07 23:14:40,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:40,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:40,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:40,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358251392] [2025-02-07 23:14:40,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358251392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:40,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:40,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:14:40,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742090318] [2025-02-07 23:14:40,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:40,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:14:40,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:40,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:14:40,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:14:40,560 INFO L87 Difference]: Start difference. First operand 23810 states and 34507 transitions. Second operand has 7 states, 7 states have (on average 39.0) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:41,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:41,123 INFO L93 Difference]: Finished difference Result 37291 states and 54028 transitions. [2025-02-07 23:14:41,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:14:41,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.0) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2025-02-07 23:14:41,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:41,144 INFO L225 Difference]: With dead ends: 37291 [2025-02-07 23:14:41,144 INFO L226 Difference]: Without dead ends: 23826 [2025-02-07 23:14:41,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:14:41,158 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 473 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 2529 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:41,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 2529 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:14:41,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23826 states. [2025-02-07 23:14:41,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23826 to 23822. [2025-02-07 23:14:41,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23822 states, 23821 states have (on average 1.4492674530876117) internal successors, (34523), 23821 states have internal predecessors, (34523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23822 states to 23822 states and 34523 transitions. [2025-02-07 23:14:41,338 INFO L78 Accepts]: Start accepts. Automaton has 23822 states and 34523 transitions. Word has length 273 [2025-02-07 23:14:41,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:41,339 INFO L471 AbstractCegarLoop]: Abstraction has 23822 states and 34523 transitions. [2025-02-07 23:14:41,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.0) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:41,339 INFO L276 IsEmpty]: Start isEmpty. Operand 23822 states and 34523 transitions. [2025-02-07 23:14:41,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-07 23:14:41,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:41,349 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:41,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-07 23:14:41,349 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:41,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:41,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1518679368, now seen corresponding path program 1 times [2025-02-07 23:14:41,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:41,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155148305] [2025-02-07 23:14:41,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:41,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:41,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-07 23:14:41,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-07 23:14:41,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:41,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:41,979 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:41,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:41,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155148305] [2025-02-07 23:14:41,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155148305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:41,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:41,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 23:14:41,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840566217] [2025-02-07 23:14:41,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:41,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 23:14:41,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:41,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 23:14:41,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:14:41,981 INFO L87 Difference]: Start difference. First operand 23822 states and 34523 transitions. Second operand has 8 states, 8 states have (on average 34.125) internal successors, (273), 8 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:42,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:42,488 INFO L93 Difference]: Finished difference Result 37362 states and 54121 transitions. [2025-02-07 23:14:42,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:14:42,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.125) internal successors, (273), 8 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2025-02-07 23:14:42,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:42,509 INFO L225 Difference]: With dead ends: 37362 [2025-02-07 23:14:42,509 INFO L226 Difference]: Without dead ends: 23885 [2025-02-07 23:14:42,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:14:42,521 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 94 mSDsluCounter, 3620 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 4230 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:42,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 4230 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:14:42,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23885 states. [2025-02-07 23:14:42,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23885 to 23814. [2025-02-07 23:14:42,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23814 states, 23813 states have (on average 1.4492924033091168) internal successors, (34512), 23813 states have internal predecessors, (34512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23814 states to 23814 states and 34512 transitions. [2025-02-07 23:14:42,779 INFO L78 Accepts]: Start accepts. Automaton has 23814 states and 34512 transitions. Word has length 273 [2025-02-07 23:14:42,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:42,780 INFO L471 AbstractCegarLoop]: Abstraction has 23814 states and 34512 transitions. [2025-02-07 23:14:42,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.125) internal successors, (273), 8 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand 23814 states and 34512 transitions. [2025-02-07 23:14:42,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-07 23:14:42,793 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:42,793 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:42,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-07 23:14:42,793 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:42,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:42,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1796788319, now seen corresponding path program 1 times [2025-02-07 23:14:42,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:42,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615625618] [2025-02-07 23:14:42,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:42,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:42,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-07 23:14:43,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-07 23:14:43,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:43,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:43,305 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:43,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:43,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615625618] [2025-02-07 23:14:43,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615625618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:43,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:43,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:14:43,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730816407] [2025-02-07 23:14:43,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:43,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:14:43,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:43,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:14:43,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:14:43,307 INFO L87 Difference]: Start difference. First operand 23814 states and 34512 transitions. Second operand has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:43,632 INFO L93 Difference]: Finished difference Result 37758 states and 54663 transitions. [2025-02-07 23:14:43,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:14:43,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2025-02-07 23:14:43,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:43,652 INFO L225 Difference]: With dead ends: 37758 [2025-02-07 23:14:43,653 INFO L226 Difference]: Without dead ends: 24269 [2025-02-07 23:14:43,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-02-07 23:14:43,665 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 48 mSDsluCounter, 2341 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2929 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:43,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2929 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:14:43,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24269 states. [2025-02-07 23:14:43,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24269 to 24221. [2025-02-07 23:14:43,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24221 states, 24220 states have (on average 1.4477704376548308) internal successors, (35065), 24220 states have internal predecessors, (35065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:43,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24221 states to 24221 states and 35065 transitions. [2025-02-07 23:14:43,840 INFO L78 Accepts]: Start accepts. Automaton has 24221 states and 35065 transitions. Word has length 273 [2025-02-07 23:14:43,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:43,840 INFO L471 AbstractCegarLoop]: Abstraction has 24221 states and 35065 transitions. [2025-02-07 23:14:43,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:43,840 INFO L276 IsEmpty]: Start isEmpty. Operand 24221 states and 35065 transitions. [2025-02-07 23:14:43,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-07 23:14:43,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:43,852 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:43,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-07 23:14:43,852 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:43,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:43,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1443353311, now seen corresponding path program 1 times [2025-02-07 23:14:43,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:43,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951248286] [2025-02-07 23:14:43,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:43,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:43,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-07 23:14:44,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-07 23:14:44,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:44,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:44,279 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:44,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:44,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951248286] [2025-02-07 23:14:44,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951248286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:44,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:44,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:14:44,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469222232] [2025-02-07 23:14:44,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:44,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:14:44,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:44,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:14:44,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:14:44,280 INFO L87 Difference]: Start difference. First operand 24221 states and 35065 transitions. Second operand has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:44,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:44,661 INFO L93 Difference]: Finished difference Result 38195 states and 55259 transitions. [2025-02-07 23:14:44,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:14:44,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2025-02-07 23:14:44,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:44,679 INFO L225 Difference]: With dead ends: 38195 [2025-02-07 23:14:44,680 INFO L226 Difference]: Without dead ends: 24409 [2025-02-07 23:14:44,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-02-07 23:14:44,691 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 126 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 2932 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:44,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 2932 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:14:44,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24409 states. [2025-02-07 23:14:44,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24409 to 24119. [2025-02-07 23:14:44,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24119 states, 24118 states have (on average 1.4479227133261465) internal successors, (34921), 24118 states have internal predecessors, (34921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:44,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24119 states to 24119 states and 34921 transitions. [2025-02-07 23:14:44,869 INFO L78 Accepts]: Start accepts. Automaton has 24119 states and 34921 transitions. Word has length 273 [2025-02-07 23:14:44,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:44,869 INFO L471 AbstractCegarLoop]: Abstraction has 24119 states and 34921 transitions. [2025-02-07 23:14:44,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:44,869 INFO L276 IsEmpty]: Start isEmpty. Operand 24119 states and 34921 transitions. [2025-02-07 23:14:44,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-07 23:14:44,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:44,880 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:44,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-07 23:14:44,880 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:44,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:44,881 INFO L85 PathProgramCache]: Analyzing trace with hash -869101258, now seen corresponding path program 1 times [2025-02-07 23:14:44,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:44,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823964704] [2025-02-07 23:14:44,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:44,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:44,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-07 23:14:45,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-07 23:14:45,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:45,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:45,363 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:45,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:45,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823964704] [2025-02-07 23:14:45,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823964704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:45,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:45,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:14:45,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625612727] [2025-02-07 23:14:45,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:45,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:45,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:45,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:45,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:45,365 INFO L87 Difference]: Start difference. First operand 24119 states and 34921 transitions. Second operand has 5 states, 5 states have (on average 54.6) internal successors, (273), 4 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:45,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:45,652 INFO L93 Difference]: Finished difference Result 37886 states and 54824 transitions. [2025-02-07 23:14:45,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:14:45,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 4 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2025-02-07 23:14:45,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:45,672 INFO L225 Difference]: With dead ends: 37886 [2025-02-07 23:14:45,672 INFO L226 Difference]: Without dead ends: 24035 [2025-02-07 23:14:45,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:45,684 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 498 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:45,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 1555 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:14:45,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24035 states. [2025-02-07 23:14:45,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24035 to 24035. [2025-02-07 23:14:45,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24035 states, 24034 states have (on average 1.4479071315636183) internal successors, (34799), 24034 states have internal predecessors, (34799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:45,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24035 states to 24035 states and 34799 transitions. [2025-02-07 23:14:45,857 INFO L78 Accepts]: Start accepts. Automaton has 24035 states and 34799 transitions. Word has length 273 [2025-02-07 23:14:45,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:45,857 INFO L471 AbstractCegarLoop]: Abstraction has 24035 states and 34799 transitions. [2025-02-07 23:14:45,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 4 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:45,858 INFO L276 IsEmpty]: Start isEmpty. Operand 24035 states and 34799 transitions. [2025-02-07 23:14:45,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-07 23:14:45,868 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:45,868 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:45,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-07 23:14:45,868 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:45,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:45,868 INFO L85 PathProgramCache]: Analyzing trace with hash 618719114, now seen corresponding path program 1 times [2025-02-07 23:14:45,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:45,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55177244] [2025-02-07 23:14:45,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:45,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:45,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-07 23:14:45,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-07 23:14:45,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:45,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:46,133 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:46,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:46,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55177244] [2025-02-07 23:14:46,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55177244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:46,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:46,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:14:46,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544210175] [2025-02-07 23:14:46,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:46,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:14:46,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:46,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:14:46,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:14:46,135 INFO L87 Difference]: Start difference. First operand 24035 states and 34799 transitions. Second operand has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:46,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:46,446 INFO L93 Difference]: Finished difference Result 51069 states and 74249 transitions. [2025-02-07 23:14:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:14:46,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2025-02-07 23:14:46,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:46,468 INFO L225 Difference]: With dead ends: 51069 [2025-02-07 23:14:46,468 INFO L226 Difference]: Without dead ends: 31875 [2025-02-07 23:14:46,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:14:46,475 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 55 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 2350 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:46,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 2350 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:14:46,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31875 states. [2025-02-07 23:14:46,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31875 to 31875. [2025-02-07 23:14:46,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31875 states, 31874 states have (on average 1.451182782204932) internal successors, (46255), 31874 states have internal predecessors, (46255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:46,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31875 states to 31875 states and 46255 transitions. [2025-02-07 23:14:46,720 INFO L78 Accepts]: Start accepts. Automaton has 31875 states and 46255 transitions. Word has length 273 [2025-02-07 23:14:46,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:46,720 INFO L471 AbstractCegarLoop]: Abstraction has 31875 states and 46255 transitions. [2025-02-07 23:14:46,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:46,720 INFO L276 IsEmpty]: Start isEmpty. Operand 31875 states and 46255 transitions. [2025-02-07 23:14:46,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-07 23:14:46,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:46,733 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:46,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-07 23:14:46,733 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:46,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:46,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1519253324, now seen corresponding path program 1 times [2025-02-07 23:14:46,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:46,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932048183] [2025-02-07 23:14:46,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:46,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:46,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-07 23:14:46,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-07 23:14:46,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:46,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:47,001 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:47,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:47,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932048183] [2025-02-07 23:14:47,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932048183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:47,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:47,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:14:47,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733689500] [2025-02-07 23:14:47,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:47,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:47,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:47,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:47,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:47,003 INFO L87 Difference]: Start difference. First operand 31875 states and 46255 transitions. Second operand has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:47,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:47,276 INFO L93 Difference]: Finished difference Result 62717 states and 91049 transitions. [2025-02-07 23:14:47,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:14:47,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2025-02-07 23:14:47,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:47,306 INFO L225 Difference]: With dead ends: 62717 [2025-02-07 23:14:47,307 INFO L226 Difference]: Without dead ends: 32067 [2025-02-07 23:14:47,328 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-02-07 23:14:47,328 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 0 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:47,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2351 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:14:47,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32067 states. [2025-02-07 23:14:47,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32067 to 32067. [2025-02-07 23:14:47,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32067 states, 32066 states have (on average 1.4484812574065988) internal successors, (46447), 32066 states have internal predecessors, (46447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:47,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32067 states to 32067 states and 46447 transitions. [2025-02-07 23:14:47,569 INFO L78 Accepts]: Start accepts. Automaton has 32067 states and 46447 transitions. Word has length 273 [2025-02-07 23:14:47,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:47,569 INFO L471 AbstractCegarLoop]: Abstraction has 32067 states and 46447 transitions. [2025-02-07 23:14:47,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:47,570 INFO L276 IsEmpty]: Start isEmpty. Operand 32067 states and 46447 transitions. [2025-02-07 23:14:47,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-07 23:14:47,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:47,584 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:47,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-07 23:14:47,584 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:47,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:47,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1566030097, now seen corresponding path program 1 times [2025-02-07 23:14:47,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:47,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897564176] [2025-02-07 23:14:47,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:47,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:47,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-07 23:14:47,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-07 23:14:47,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:47,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:47,857 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:47,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:47,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897564176] [2025-02-07 23:14:47,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897564176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:47,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:47,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:14:47,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304383199] [2025-02-07 23:14:47,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:47,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:47,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:47,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:47,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:47,859 INFO L87 Difference]: Start difference. First operand 32067 states and 46447 transitions. Second operand has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:48,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:48,230 INFO L93 Difference]: Finished difference Result 61537 states and 89107 transitions. [2025-02-07 23:14:48,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:14:48,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2025-02-07 23:14:48,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:48,254 INFO L225 Difference]: With dead ends: 61537 [2025-02-07 23:14:48,254 INFO L226 Difference]: Without dead ends: 34647 [2025-02-07 23:14:48,265 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-02-07 23:14:48,266 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 115 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 2350 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:48,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 2350 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:14:48,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34647 states. [2025-02-07 23:14:48,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34647 to 34647. [2025-02-07 23:14:48,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34647 states, 34646 states have (on average 1.4461986953760897) internal successors, (50105), 34646 states have internal predecessors, (50105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34647 states to 34647 states and 50105 transitions. [2025-02-07 23:14:48,501 INFO L78 Accepts]: Start accepts. Automaton has 34647 states and 50105 transitions. Word has length 273 [2025-02-07 23:14:48,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:48,501 INFO L471 AbstractCegarLoop]: Abstraction has 34647 states and 50105 transitions. [2025-02-07 23:14:48,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:48,502 INFO L276 IsEmpty]: Start isEmpty. Operand 34647 states and 50105 transitions. [2025-02-07 23:14:48,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-07 23:14:48,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:48,516 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:48,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-02-07 23:14:48,516 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:48,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:48,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1584044932, now seen corresponding path program 1 times [2025-02-07 23:14:48,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:48,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512978969] [2025-02-07 23:14:48,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:48,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:48,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-07 23:14:48,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-07 23:14:48,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:48,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:49,085 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:49,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:49,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512978969] [2025-02-07 23:14:49,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512978969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:49,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:49,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:14:49,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065320761] [2025-02-07 23:14:49,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:49,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:49,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:49,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:49,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:49,089 INFO L87 Difference]: Start difference. First operand 34647 states and 50105 transitions. Second operand has 5 states, 5 states have (on average 54.8) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:49,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:49,515 INFO L93 Difference]: Finished difference Result 68533 states and 99133 transitions. [2025-02-07 23:14:49,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:14:49,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 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 274 [2025-02-07 23:14:49,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:49,545 INFO L225 Difference]: With dead ends: 68533 [2025-02-07 23:14:49,546 INFO L226 Difference]: Without dead ends: 34647 [2025-02-07 23:14:49,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-07 23:14:49,570 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 17 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2118 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:49,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2118 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:14:49,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34647 states. [2025-02-07 23:14:49,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34647 to 34647. [2025-02-07 23:14:49,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34647 states, 34646 states have (on average 1.4461698320152399) internal successors, (50104), 34646 states have internal predecessors, (50104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:49,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34647 states to 34647 states and 50104 transitions. [2025-02-07 23:14:49,821 INFO L78 Accepts]: Start accepts. Automaton has 34647 states and 50104 transitions. Word has length 274 [2025-02-07 23:14:49,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:49,821 INFO L471 AbstractCegarLoop]: Abstraction has 34647 states and 50104 transitions. [2025-02-07 23:14:49,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:49,821 INFO L276 IsEmpty]: Start isEmpty. Operand 34647 states and 50104 transitions. [2025-02-07 23:14:49,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-07 23:14:49,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:49,835 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:49,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-02-07 23:14:49,835 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:49,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:49,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1634820189, now seen corresponding path program 1 times [2025-02-07 23:14:49,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:49,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567665417] [2025-02-07 23:14:49,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:49,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:49,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-07 23:14:50,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-07 23:14:50,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:50,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:51,333 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:51,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:51,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567665417] [2025-02-07 23:14:51,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567665417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:51,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:51,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:14:51,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79248258] [2025-02-07 23:14:51,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:51,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:14:51,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:51,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:14:51,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:14:51,334 INFO L87 Difference]: Start difference. First operand 34647 states and 50104 transitions. Second operand has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:52,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:52,166 INFO L93 Difference]: Finished difference Result 71719 states and 103509 transitions. [2025-02-07 23:14:52,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 23:14:52,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 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 274 [2025-02-07 23:14:52,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:52,198 INFO L225 Difference]: With dead ends: 71719 [2025-02-07 23:14:52,198 INFO L226 Difference]: Without dead ends: 34791 [2025-02-07 23:14:52,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:14:52,222 INFO L435 NwaCegarLoop]: 1040 mSDtfsCounter, 556 mSDsluCounter, 3365 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 4405 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:52,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 4405 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 23:14:52,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34791 states. [2025-02-07 23:14:52,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34791 to 34719. [2025-02-07 23:14:52,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34719 states, 34718 states have (on average 1.4459358257964168) internal successors, (50200), 34718 states have internal predecessors, (50200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:52,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34719 states to 34719 states and 50200 transitions. [2025-02-07 23:14:52,510 INFO L78 Accepts]: Start accepts. Automaton has 34719 states and 50200 transitions. Word has length 274 [2025-02-07 23:14:52,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:52,510 INFO L471 AbstractCegarLoop]: Abstraction has 34719 states and 50200 transitions. [2025-02-07 23:14:52,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:52,510 INFO L276 IsEmpty]: Start isEmpty. Operand 34719 states and 50200 transitions. [2025-02-07 23:14:52,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-07 23:14:52,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:52,525 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:52,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-02-07 23:14:52,525 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:52,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:52,526 INFO L85 PathProgramCache]: Analyzing trace with hash 2073760424, now seen corresponding path program 1 times [2025-02-07 23:14:52,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:52,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658868867] [2025-02-07 23:14:52,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:52,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:52,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-07 23:14:52,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-07 23:14:52,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:52,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:53,051 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:53,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:53,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658868867] [2025-02-07 23:14:53,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658868867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:53,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:53,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:14:53,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901137457] [2025-02-07 23:14:53,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:53,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:14:53,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:53,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:14:53,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:14:53,053 INFO L87 Difference]: Start difference. First operand 34719 states and 50200 transitions. Second operand has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 7 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:53,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:53,469 INFO L93 Difference]: Finished difference Result 54597 states and 78885 transitions. [2025-02-07 23:14:53,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:14:53,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 7 states have internal predecessors, (274), 0 states have call successors, (0), 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 274 [2025-02-07 23:14:53,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:53,500 INFO L225 Difference]: With dead ends: 54597 [2025-02-07 23:14:53,500 INFO L226 Difference]: Without dead ends: 34765 [2025-02-07 23:14:53,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:14:53,519 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 35 mSDsluCounter, 2939 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3531 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:53,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3531 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:14:53,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34765 states. [2025-02-07 23:14:53,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34765 to 34765. [2025-02-07 23:14:53,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34765 states, 34764 states have (on average 1.4458060062133242) internal successors, (50262), 34764 states have internal predecessors, (50262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34765 states to 34765 states and 50262 transitions. [2025-02-07 23:14:53,792 INFO L78 Accepts]: Start accepts. Automaton has 34765 states and 50262 transitions. Word has length 274 [2025-02-07 23:14:53,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:53,796 INFO L471 AbstractCegarLoop]: Abstraction has 34765 states and 50262 transitions. [2025-02-07 23:14:53,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 7 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 34765 states and 50262 transitions. [2025-02-07 23:14:53,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-07 23:14:53,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:53,813 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:53,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-02-07 23:14:53,813 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:53,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:53,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1249869340, now seen corresponding path program 1 times [2025-02-07 23:14:53,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:53,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591740977] [2025-02-07 23:14:53,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:53,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:53,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-07 23:14:54,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-07 23:14:54,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:54,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:54,360 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:54,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:54,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591740977] [2025-02-07 23:14:54,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591740977] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:54,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:54,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 23:14:54,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911051055] [2025-02-07 23:14:54,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:54,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 23:14:54,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:54,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 23:14:54,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:14:54,361 INFO L87 Difference]: Start difference. First operand 34765 states and 50262 transitions. Second operand has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:54,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:54,813 INFO L93 Difference]: Finished difference Result 54905 states and 79305 transitions. [2025-02-07 23:14:54,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:14:54,813 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 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 274 [2025-02-07 23:14:54,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:54,843 INFO L225 Difference]: With dead ends: 54905 [2025-02-07 23:14:54,843 INFO L226 Difference]: Without dead ends: 34821 [2025-02-07 23:14:54,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:14:54,861 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 2 mSDsluCounter, 3482 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4065 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:54,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4065 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:14:54,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34821 states. [2025-02-07 23:14:55,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34821 to 34821. [2025-02-07 23:14:55,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34821 states, 34820 states have (on average 1.4454910970706492) internal successors, (50332), 34820 states have internal predecessors, (50332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34821 states to 34821 states and 50332 transitions. [2025-02-07 23:14:55,278 INFO L78 Accepts]: Start accepts. Automaton has 34821 states and 50332 transitions. Word has length 274 [2025-02-07 23:14:55,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:55,278 INFO L471 AbstractCegarLoop]: Abstraction has 34821 states and 50332 transitions. [2025-02-07 23:14:55,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:55,278 INFO L276 IsEmpty]: Start isEmpty. Operand 34821 states and 50332 transitions. [2025-02-07 23:14:55,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-07 23:14:55,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:55,296 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:55,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-02-07 23:14:55,296 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:55,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:55,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1640418655, now seen corresponding path program 1 times [2025-02-07 23:14:55,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:55,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401804795] [2025-02-07 23:14:55,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:55,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:55,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-07 23:14:55,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-07 23:14:55,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:55,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:55,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:55,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401804795] [2025-02-07 23:14:55,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401804795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:55,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:55,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:14:55,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379824249] [2025-02-07 23:14:55,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:55,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:55,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:55,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:55,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:55,567 INFO L87 Difference]: Start difference. First operand 34821 states and 50332 transitions. Second operand has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:55,860 INFO L93 Difference]: Finished difference Result 56085 states and 80990 transitions. [2025-02-07 23:14:55,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:14:55,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 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 274 [2025-02-07 23:14:55,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:55,892 INFO L225 Difference]: With dead ends: 56085 [2025-02-07 23:14:55,892 INFO L226 Difference]: Without dead ends: 35173 [2025-02-07 23:14:55,911 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-02-07 23:14:55,911 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 4 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:55,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2351 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:14:55,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35173 states. [2025-02-07 23:14:56,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35173 to 35173. [2025-02-07 23:14:56,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35173 states, 35172 states have (on average 1.4437620834754918) internal successors, (50780), 35172 states have internal predecessors, (50780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:56,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35173 states to 35173 states and 50780 transitions. [2025-02-07 23:14:56,188 INFO L78 Accepts]: Start accepts. Automaton has 35173 states and 50780 transitions. Word has length 274 [2025-02-07 23:14:56,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:56,188 INFO L471 AbstractCegarLoop]: Abstraction has 35173 states and 50780 transitions. [2025-02-07 23:14:56,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:56,188 INFO L276 IsEmpty]: Start isEmpty. Operand 35173 states and 50780 transitions. [2025-02-07 23:14:56,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-07 23:14:56,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:56,203 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:56,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-02-07 23:14:56,203 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:56,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:56,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1620599686, now seen corresponding path program 1 times [2025-02-07 23:14:56,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:56,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699265069] [2025-02-07 23:14:56,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:56,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:56,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-07 23:14:56,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-07 23:14:56,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:56,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:56,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:56,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699265069] [2025-02-07 23:14:56,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699265069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:56,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:56,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:14:56,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644670035] [2025-02-07 23:14:56,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:56,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:56,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:56,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:56,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:56,461 INFO L87 Difference]: Start difference. First operand 35173 states and 50780 transitions. Second operand has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:56,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:56,771 INFO L93 Difference]: Finished difference Result 68853 states and 99070 transitions. [2025-02-07 23:14:56,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:14:56,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 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 274 [2025-02-07 23:14:56,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:56,814 INFO L225 Difference]: With dead ends: 68853 [2025-02-07 23:14:56,815 INFO L226 Difference]: Without dead ends: 47621 [2025-02-07 23:14:56,838 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-02-07 23:14:56,838 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 82 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:56,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 2351 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:14:56,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47621 states. [2025-02-07 23:14:57,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47621 to 47621. [2025-02-07 23:14:57,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47621 states, 47620 states have (on average 1.4359512809743804) internal successors, (68380), 47620 states have internal predecessors, (68380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:57,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47621 states to 47621 states and 68380 transitions. [2025-02-07 23:14:57,211 INFO L78 Accepts]: Start accepts. Automaton has 47621 states and 68380 transitions. Word has length 274 [2025-02-07 23:14:57,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:57,211 INFO L471 AbstractCegarLoop]: Abstraction has 47621 states and 68380 transitions. [2025-02-07 23:14:57,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:57,211 INFO L276 IsEmpty]: Start isEmpty. Operand 47621 states and 68380 transitions. [2025-02-07 23:14:57,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-07 23:14:57,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:57,230 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:57,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-02-07 23:14:57,230 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:57,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:57,231 INFO L85 PathProgramCache]: Analyzing trace with hash 517431232, now seen corresponding path program 1 times [2025-02-07 23:14:57,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:57,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80642281] [2025-02-07 23:14:57,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:57,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:57,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-07 23:14:57,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-07 23:14:57,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:57,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:57,615 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:57,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:57,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80642281] [2025-02-07 23:14:57,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80642281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:57,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:57,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:14:57,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966144384] [2025-02-07 23:14:57,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:57,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:57,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:57,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:57,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:57,616 INFO L87 Difference]: Start difference. First operand 47621 states and 68380 transitions. Second operand has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:57,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:57,999 INFO L93 Difference]: Finished difference Result 83061 states and 119230 transitions. [2025-02-07 23:14:58,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:14:58,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 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 274 [2025-02-07 23:14:58,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:58,048 INFO L225 Difference]: With dead ends: 83061 [2025-02-07 23:14:58,048 INFO L226 Difference]: Without dead ends: 48133 [2025-02-07 23:14:58,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-07 23:14:58,077 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 0 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2279 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:58,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2279 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:14:58,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48133 states. [2025-02-07 23:14:58,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48133 to 48133. [2025-02-07 23:14:58,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48133 states, 48132 states have (on average 1.431313886811269) internal successors, (68892), 48132 states have internal predecessors, (68892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48133 states to 48133 states and 68892 transitions. [2025-02-07 23:14:58,444 INFO L78 Accepts]: Start accepts. Automaton has 48133 states and 68892 transitions. Word has length 274 [2025-02-07 23:14:58,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:58,444 INFO L471 AbstractCegarLoop]: Abstraction has 48133 states and 68892 transitions. [2025-02-07 23:14:58,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 48133 states and 68892 transitions. [2025-02-07 23:14:58,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-07 23:14:58,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:58,463 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:58,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-02-07 23:14:58,464 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:58,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:58,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1386513257, now seen corresponding path program 1 times [2025-02-07 23:14:58,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:58,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424961667] [2025-02-07 23:14:58,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:58,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:58,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-07 23:14:58,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-07 23:14:58,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:58,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:58,756 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:58,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:58,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424961667] [2025-02-07 23:14:58,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424961667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:58,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:58,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:14:58,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988923662] [2025-02-07 23:14:58,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:58,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:58,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:58,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:58,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:58,757 INFO L87 Difference]: Start difference. First operand 48133 states and 68892 transitions. Second operand has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:59,046 INFO L93 Difference]: Finished difference Result 94613 states and 135454 transitions. [2025-02-07 23:14:59,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:14:59,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 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 274 [2025-02-07 23:14:59,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:59,092 INFO L225 Difference]: With dead ends: 94613 [2025-02-07 23:14:59,092 INFO L226 Difference]: Without dead ends: 48325 [2025-02-07 23:14:59,127 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-02-07 23:14:59,127 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 0 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1765 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:59,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1765 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:14:59,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48325 states. [2025-02-07 23:14:59,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48325 to 48325. [2025-02-07 23:14:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48325 states, 48324 states have (on average 1.4296001986590514) internal successors, (69084), 48324 states have internal predecessors, (69084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:59,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48325 states to 48325 states and 69084 transitions. [2025-02-07 23:14:59,758 INFO L78 Accepts]: Start accepts. Automaton has 48325 states and 69084 transitions. Word has length 274 [2025-02-07 23:14:59,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:59,759 INFO L471 AbstractCegarLoop]: Abstraction has 48325 states and 69084 transitions. [2025-02-07 23:14:59,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:59,759 INFO L276 IsEmpty]: Start isEmpty. Operand 48325 states and 69084 transitions. [2025-02-07 23:14:59,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-07 23:14:59,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:59,781 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:14:59,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-02-07 23:14:59,781 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:59,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:59,785 INFO L85 PathProgramCache]: Analyzing trace with hash -65100651, now seen corresponding path program 1 times [2025-02-07 23:14:59,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:59,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302365643] [2025-02-07 23:14:59,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:59,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:59,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-07 23:15:00,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-07 23:15:00,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:15:00,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:15:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:15:00,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:15:00,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302365643] [2025-02-07 23:15:00,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302365643] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:15:00,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:15:00,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:15:00,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690734632] [2025-02-07 23:15:00,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:15:00,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:15:00,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:15:00,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:15:00,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:15:00,760 INFO L87 Difference]: Start difference. First operand 48325 states and 69084 transitions. Second operand has 5 states, 5 states have (on average 55.0) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:15:01,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:15:01,101 INFO L93 Difference]: Finished difference Result 88957 states and 127174 transitions. [2025-02-07 23:15:01,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:15:01,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 55.0) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 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 275 [2025-02-07 23:15:01,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:15:01,137 INFO L225 Difference]: With dead ends: 88957 [2025-02-07 23:15:01,138 INFO L226 Difference]: Without dead ends: 41415 [2025-02-07 23:15:01,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-07 23:15:01,168 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 16 mSDsluCounter, 1747 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2335 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:15:01,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2335 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:15:01,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41415 states. [2025-02-07 23:15:01,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41415 to 41415. [2025-02-07 23:15:01,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41415 states, 41414 states have (on average 1.429347563625827) internal successors, (59195), 41414 states have internal predecessors, (59195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:15:01,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41415 states to 41415 states and 59195 transitions. [2025-02-07 23:15:01,579 INFO L78 Accepts]: Start accepts. Automaton has 41415 states and 59195 transitions. Word has length 275 [2025-02-07 23:15:01,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:15:01,579 INFO L471 AbstractCegarLoop]: Abstraction has 41415 states and 59195 transitions. [2025-02-07 23:15:01,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.0) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:15:01,579 INFO L276 IsEmpty]: Start isEmpty. Operand 41415 states and 59195 transitions. [2025-02-07 23:15:01,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-07 23:15:01,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:15:01,593 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:15:01,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-02-07 23:15:01,593 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:15:01,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:15:01,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1811154359, now seen corresponding path program 1 times [2025-02-07 23:15:01,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:15:01,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795167843] [2025-02-07 23:15:01,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:15:01,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:15:01,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-07 23:15:01,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-07 23:15:01,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:15:01,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:15:02,559 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:15:02,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:15:02,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795167843] [2025-02-07 23:15:02,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795167843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:15:02,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:15:02,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 23:15:02,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661147429] [2025-02-07 23:15:02,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:15:02,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 23:15:02,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:15:02,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 23:15:02,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:15:02,560 INFO L87 Difference]: Start difference. First operand 41415 states and 59195 transitions. Second operand has 8 states, 8 states have (on average 34.375) internal successors, (275), 8 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:15:02,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:15:02,985 INFO L93 Difference]: Finished difference Result 74029 states and 105817 transitions. [2025-02-07 23:15:02,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:15:02,985 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.375) internal successors, (275), 8 states have internal predecessors, (275), 0 states have call successors, (0), 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 275 [2025-02-07 23:15:02,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:15:03,021 INFO L225 Difference]: With dead ends: 74029 [2025-02-07 23:15:03,022 INFO L226 Difference]: Without dead ends: 41607 [2025-02-07 23:15:03,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:15:03,047 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 34 mSDsluCounter, 3063 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3684 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:15:03,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3684 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:15:03,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41607 states. [2025-02-07 23:15:03,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41607 to 41511. [2025-02-07 23:15:03,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41511 states, 41510 states have (on average 1.4283546133461817) internal successors, (59291), 41510 states have internal predecessors, (59291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:15:03,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41511 states to 41511 states and 59291 transitions. [2025-02-07 23:15:03,367 INFO L78 Accepts]: Start accepts. Automaton has 41511 states and 59291 transitions. Word has length 275 [2025-02-07 23:15:03,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:15:03,367 INFO L471 AbstractCegarLoop]: Abstraction has 41511 states and 59291 transitions. [2025-02-07 23:15:03,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.375) internal successors, (275), 8 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:15:03,367 INFO L276 IsEmpty]: Start isEmpty. Operand 41511 states and 59291 transitions. [2025-02-07 23:15:03,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-07 23:15:03,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:15:03,381 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:15:03,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-02-07 23:15:03,381 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:15:03,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:15:03,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1251229770, now seen corresponding path program 1 times [2025-02-07 23:15:03,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:15:03,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841212946] [2025-02-07 23:15:03,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:15:03,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:15:03,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-07 23:15:03,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-07 23:15:03,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:15:03,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:15:03,688 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:15:03,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:15:03,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841212946] [2025-02-07 23:15:03,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841212946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:15:03,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:15:03,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:15:03,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588217461] [2025-02-07 23:15:03,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:15:03,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:15:03,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:15:03,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:15:03,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:15:03,689 INFO L87 Difference]: Start difference. First operand 41511 states and 59291 transitions. Second operand has 6 states, 6 states have (on average 45.833333333333336) internal successors, (275), 6 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:15:04,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:15:04,475 INFO L93 Difference]: Finished difference Result 78590 states and 112056 transitions. [2025-02-07 23:15:04,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 23:15:04,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.833333333333336) internal successors, (275), 6 states have internal predecessors, (275), 0 states have call successors, (0), 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 275 [2025-02-07 23:15:04,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:15:04,510 INFO L225 Difference]: With dead ends: 78590 [2025-02-07 23:15:04,510 INFO L226 Difference]: Without dead ends: 41539 [2025-02-07 23:15:04,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:15:04,523 INFO L435 NwaCegarLoop]: 1070 mSDtfsCounter, 551 mSDsluCounter, 3705 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 4775 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:15:04,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 4775 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 23:15:04,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41539 states. [2025-02-07 23:15:04,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41539 to 41525. [2025-02-07 23:15:04,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41525 states, 41524 states have (on average 1.4282101916963683) internal successors, (59305), 41524 states have internal predecessors, (59305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:15:04,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41525 states to 41525 states and 59305 transitions. [2025-02-07 23:15:04,843 INFO L78 Accepts]: Start accepts. Automaton has 41525 states and 59305 transitions. Word has length 275 [2025-02-07 23:15:04,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:15:04,844 INFO L471 AbstractCegarLoop]: Abstraction has 41525 states and 59305 transitions. [2025-02-07 23:15:04,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.833333333333336) internal successors, (275), 6 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:15:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 41525 states and 59305 transitions. [2025-02-07 23:15:04,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-07 23:15:04,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:15:04,861 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:15:04,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-02-07 23:15:04,862 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:15:04,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:15:04,862 INFO L85 PathProgramCache]: Analyzing trace with hash 204667312, now seen corresponding path program 1 times [2025-02-07 23:15:04,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:15:04,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686318111] [2025-02-07 23:15:04,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:15:04,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:15:04,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-07 23:15:04,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-07 23:15:04,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:15:04,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:15:05,194 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:15:05,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:15:05,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686318111] [2025-02-07 23:15:05,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686318111] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:15:05,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:15:05,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:15:05,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064997404] [2025-02-07 23:15:05,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:15:05,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:15:05,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:15:05,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:15:05,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:15:05,195 INFO L87 Difference]: Start difference. First operand 41525 states and 59305 transitions. Second operand has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:15:05,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:15:05,565 INFO L93 Difference]: Finished difference Result 68531 states and 97826 transitions. [2025-02-07 23:15:05,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:15:05,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 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 275 [2025-02-07 23:15:05,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:15:05,603 INFO L225 Difference]: With dead ends: 68531 [2025-02-07 23:15:05,604 INFO L226 Difference]: Without dead ends: 41539 [2025-02-07 23:15:05,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-07 23:15:05,629 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 0 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2283 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:15:05,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2283 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:15:05,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41539 states. [2025-02-07 23:15:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41539 to 41539. [2025-02-07 23:15:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41539 states, 41538 states have (on average 1.4280658673985267) internal successors, (59319), 41538 states have internal predecessors, (59319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:15:06,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41539 states to 41539 states and 59319 transitions. [2025-02-07 23:15:06,117 INFO L78 Accepts]: Start accepts. Automaton has 41539 states and 59319 transitions. Word has length 275 [2025-02-07 23:15:06,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:15:06,118 INFO L471 AbstractCegarLoop]: Abstraction has 41539 states and 59319 transitions. [2025-02-07 23:15:06,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:15:06,118 INFO L276 IsEmpty]: Start isEmpty. Operand 41539 states and 59319 transitions. [2025-02-07 23:15:06,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-07 23:15:06,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:15:06,137 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 23:15:06,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-02-07 23:15:06,137 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:15:06,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:15:06,138 INFO L85 PathProgramCache]: Analyzing trace with hash -254022662, now seen corresponding path program 1 times [2025-02-07 23:15:06,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:15:06,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332605510] [2025-02-07 23:15:06,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:15:06,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:15:06,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes.