./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Ibuf.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f5e5c42bbeffae4fb860efffdbf66b7537cb720af3f49bb62a0f81dcf7dbce99 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:35:21,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:35:21,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:35:21,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:35:21,381 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:35:21,401 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:35:21,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:35:21,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:35:21,403 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:35:21,403 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:35:21,404 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:35:21,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:35:21,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:35:21,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:35:21,404 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:35:21,405 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:35:21,405 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:35:21,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:35:21,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:35:21,405 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:35:21,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:35:21,405 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:35:21,405 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:35:21,405 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:35:21,406 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:35:21,406 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:35:21,406 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:35:21,406 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:35:21,406 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:35:21,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:35:21,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:35:21,407 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:35:21,407 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:35:21,407 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:35:21,407 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:35:21,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:35:21,407 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:35:21,407 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:35:21,407 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:35:21,407 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:35:21,407 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f5e5c42bbeffae4fb860efffdbf66b7537cb720af3f49bb62a0f81dcf7dbce99 [2025-03-03 17:35:21,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:35:21,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:35:21,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:35:21,644 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:35:21,644 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:35:21,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Ibuf.c [2025-03-03 17:35:22,759 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b331ac2e/a105b10ea19e48caa55050ffc1e3f47c/FLAG402fe993f [2025-03-03 17:35:22,994 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:35:22,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Ibuf.c [2025-03-03 17:35:23,006 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b331ac2e/a105b10ea19e48caa55050ffc1e3f47c/FLAG402fe993f [2025-03-03 17:35:23,023 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b331ac2e/a105b10ea19e48caa55050ffc1e3f47c [2025-03-03 17:35:23,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:35:23,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:35:23,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:35:23,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:35:23,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:35:23,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:35:23" (1/1) ... [2025-03-03 17:35:23,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5749fb1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:23, skipping insertion in model container [2025-03-03 17:35:23,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:35:23" (1/1) ... [2025-03-03 17:35:23,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:35:23,174 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Ibuf.c[1246,1259] [2025-03-03 17:35:23,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:35:23,314 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:35:23,322 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Ibuf.c[1246,1259] [2025-03-03 17:35:23,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:35:23,411 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:35:23,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:23 WrapperNode [2025-03-03 17:35:23,411 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:35:23,412 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:35:23,412 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:35:23,412 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:35:23,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:23" (1/1) ... [2025-03-03 17:35:23,441 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:23" (1/1) ... [2025-03-03 17:35:23,566 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1465 [2025-03-03 17:35:23,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:35:23,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:35:23,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:35:23,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:35:23,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:23" (1/1) ... [2025-03-03 17:35:23,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:23" (1/1) ... [2025-03-03 17:35:23,602 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:23" (1/1) ... [2025-03-03 17:35:23,697 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 17:35:23,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:23" (1/1) ... [2025-03-03 17:35:23,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:23" (1/1) ... [2025-03-03 17:35:23,732 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:23" (1/1) ... [2025-03-03 17:35:23,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:23" (1/1) ... [2025-03-03 17:35:23,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:23" (1/1) ... [2025-03-03 17:35:23,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:23" (1/1) ... [2025-03-03 17:35:23,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:35:23,779 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:35:23,780 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:35:23,780 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:35:23,780 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:23" (1/1) ... [2025-03-03 17:35:23,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:35:23,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:35:23,806 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 17:35:23,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 17:35:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:35:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:35:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:35:23,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:35:23,964 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:35:23,966 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:35:25,406 INFO L? ?]: Removed 912 outVars from TransFormulas that were not future-live. [2025-03-03 17:35:25,406 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:35:25,485 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:35:25,485 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:35:25,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:35:25 BoogieIcfgContainer [2025-03-03 17:35:25,485 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:35:25,487 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:35:25,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:35:25,491 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:35:25,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:35:23" (1/3) ... [2025-03-03 17:35:25,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e86436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:35:25, skipping insertion in model container [2025-03-03 17:35:25,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:23" (2/3) ... [2025-03-03 17:35:25,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e86436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:35:25, skipping insertion in model container [2025-03-03 17:35:25,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:35:25" (3/3) ... [2025-03-03 17:35:25,493 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Ibuf.c [2025-03-03 17:35:25,505 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:35:25,506 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_Ibuf.c that has 1 procedures, 482 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:35:25,567 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:35:25,577 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;@739d47e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:35:25,577 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:35:25,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 482 states, 480 states have (on average 1.4979166666666666) internal successors, (719), 481 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:25,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 17:35:25,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:25,587 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-03-03 17:35:25,587 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:25,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:25,592 INFO L85 PathProgramCache]: Analyzing trace with hash -458391249, now seen corresponding path program 1 times [2025-03-03 17:35:25,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:25,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429295749] [2025-03-03 17:35:25,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:25,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:25,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-03 17:35:25,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 17:35:25,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:25,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:26,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:26,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:26,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429295749] [2025-03-03 17:35:26,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429295749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:26,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:26,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:26,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844225057] [2025-03-03 17:35:26,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:26,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:26,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:26,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:26,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:26,051 INFO L87 Difference]: Start difference. First operand has 482 states, 480 states have (on average 1.4979166666666666) internal successors, (719), 481 states have internal predecessors, (719), 0 states have call successors, (0), 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.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-03-03 17:35:26,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:26,347 INFO L93 Difference]: Finished difference Result 953 states and 1425 transitions. [2025-03-03 17:35:26,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:26,349 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-03-03 17:35:26,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:26,357 INFO L225 Difference]: With dead ends: 953 [2025-03-03 17:35:26,357 INFO L226 Difference]: Without dead ends: 481 [2025-03-03 17:35:26,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:26,361 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 0 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1780 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-03-03 17:35:26,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1780 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:35:26,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-03 17:35:26,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2025-03-03 17:35:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.49375) internal successors, (717), 480 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-03-03 17:35:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 717 transitions. [2025-03-03 17:35:26,408 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 717 transitions. Word has length 21 [2025-03-03 17:35:26,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:26,408 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 717 transitions. [2025-03-03 17:35:26,410 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-03-03 17:35:26,411 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 717 transitions. [2025-03-03 17:35:26,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 17:35:26,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:26,412 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-03-03 17:35:26,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:35:26,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:26,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:26,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1320546916, now seen corresponding path program 1 times [2025-03-03 17:35:26,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:26,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62381221] [2025-03-03 17:35:26,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:26,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:26,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 17:35:26,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 17:35:26,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:26,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:26,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:26,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:26,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62381221] [2025-03-03 17:35:26,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62381221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:26,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:26,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:26,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687933870] [2025-03-03 17:35:26,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:26,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:26,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:26,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:26,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:26,519 INFO L87 Difference]: Start difference. First operand 481 states and 717 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-03-03 17:35:26,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:26,737 INFO L93 Difference]: Finished difference Result 954 states and 1423 transitions. [2025-03-03 17:35:26,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:26,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-03-03 17:35:26,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:26,739 INFO L225 Difference]: With dead ends: 954 [2025-03-03 17:35:26,739 INFO L226 Difference]: Without dead ends: 483 [2025-03-03 17:35:26,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:26,743 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 0 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1777 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-03-03 17:35:26,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1777 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:35:26,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-03-03 17:35:26,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2025-03-03 17:35:26,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 1.491701244813278) internal successors, (719), 482 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:26,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 719 transitions. [2025-03-03 17:35:26,757 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 719 transitions. Word has length 22 [2025-03-03 17:35:26,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:26,757 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 719 transitions. [2025-03-03 17:35:26,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-03-03 17:35:26,757 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 719 transitions. [2025-03-03 17:35:26,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 17:35:26,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:26,758 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-03-03 17:35:26,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:35:26,758 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:26,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:26,758 INFO L85 PathProgramCache]: Analyzing trace with hash -350738742, now seen corresponding path program 1 times [2025-03-03 17:35:26,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:26,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135947053] [2025-03-03 17:35:26,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:26,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:26,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 17:35:26,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 17:35:26,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:26,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:26,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:26,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135947053] [2025-03-03 17:35:26,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135947053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:26,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:26,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:35:26,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772387349] [2025-03-03 17:35:26,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:26,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:35:26,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:26,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:35:26,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:35:26,964 INFO L87 Difference]: Start difference. First operand 483 states and 719 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-03-03 17:35:27,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:27,456 INFO L93 Difference]: Finished difference Result 1404 states and 2092 transitions. [2025-03-03 17:35:27,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:35:27,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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-03-03 17:35:27,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:27,460 INFO L225 Difference]: With dead ends: 1404 [2025-03-03 17:35:27,460 INFO L226 Difference]: Without dead ends: 931 [2025-03-03 17:35:27,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:35:27,462 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 751 mSDsluCounter, 2866 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 3451 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:27,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 3451 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:35:27,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-03 17:35:27,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 492. [2025-03-03 17:35:27,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 1.4887983706720977) internal successors, (731), 491 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 731 transitions. [2025-03-03 17:35:27,482 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 731 transitions. Word has length 23 [2025-03-03 17:35:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:27,482 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 731 transitions. [2025-03-03 17:35:27,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:27,483 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 731 transitions. [2025-03-03 17:35:27,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 17:35:27,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:27,483 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-03-03 17:35:27,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:35:27,483 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:27,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:27,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1091076710, now seen corresponding path program 1 times [2025-03-03 17:35:27,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:27,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447107817] [2025-03-03 17:35:27,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:27,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:27,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 17:35:27,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 17:35:27,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:27,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:27,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:27,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:27,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447107817] [2025-03-03 17:35:27,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447107817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:27,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:27,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 17:35:27,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154183854] [2025-03-03 17:35:27,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:27,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:35:27,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:27,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:35:27,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:35:27,773 INFO L87 Difference]: Start difference. First operand 492 states and 731 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 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-03-03 17:35:28,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:28,374 INFO L93 Difference]: Finished difference Result 1041 states and 1542 transitions. [2025-03-03 17:35:28,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:35:28,375 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 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-03-03 17:35:28,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:28,377 INFO L225 Difference]: With dead ends: 1041 [2025-03-03 17:35:28,377 INFO L226 Difference]: Without dead ends: 563 [2025-03-03 17:35:28,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 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-03-03 17:35:28,378 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 118 mSDsluCounter, 4652 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 5236 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:28,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 5236 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:35:28,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-03-03 17:35:28,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 504. [2025-03-03 17:35:28,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 503 states have (on average 1.4831013916500995) internal successors, (746), 503 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:28,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 746 transitions. [2025-03-03 17:35:28,387 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 746 transitions. Word has length 24 [2025-03-03 17:35:28,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:28,387 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 746 transitions. [2025-03-03 17:35:28,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 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-03-03 17:35:28,388 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 746 transitions. [2025-03-03 17:35:28,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 17:35:28,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:28,388 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-03-03 17:35:28,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 17:35:28,389 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:28,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:28,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1394701813, now seen corresponding path program 1 times [2025-03-03 17:35:28,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:28,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66446381] [2025-03-03 17:35:28,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:28,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:28,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 17:35:28,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 17:35:28,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:28,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:28,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:28,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:28,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66446381] [2025-03-03 17:35:28,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66446381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:28,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:28,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:35:28,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903198002] [2025-03-03 17:35:28,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:28,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:35:28,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:28,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:35:28,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:28,525 INFO L87 Difference]: Start difference. First operand 504 states and 746 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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-03-03 17:35:28,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:28,728 INFO L93 Difference]: Finished difference Result 981 states and 1457 transitions. [2025-03-03 17:35:28,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:35:28,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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-03-03 17:35:28,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:28,730 INFO L225 Difference]: With dead ends: 981 [2025-03-03 17:35:28,730 INFO L226 Difference]: Without dead ends: 508 [2025-03-03 17:35:28,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-03-03 17:35:28,732 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 705 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1776 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:28,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 1776 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:35:28,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-03-03 17:35:28,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 507. [2025-03-03 17:35:28,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 506 states have (on average 1.4802371541501975) internal successors, (749), 506 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-03-03 17:35:28,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 749 transitions. [2025-03-03 17:35:28,740 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 749 transitions. Word has length 24 [2025-03-03 17:35:28,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:28,740 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 749 transitions. [2025-03-03 17:35:28,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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-03-03 17:35:28,741 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 749 transitions. [2025-03-03 17:35:28,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 17:35:28,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:28,741 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-03-03 17:35:28,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 17:35:28,742 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:28,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:28,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1352002917, now seen corresponding path program 1 times [2025-03-03 17:35:28,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:28,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410211154] [2025-03-03 17:35:28,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:28,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:28,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 17:35:28,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 17:35:28,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:28,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:28,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:28,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:28,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410211154] [2025-03-03 17:35:28,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410211154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:28,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:28,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 17:35:28,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049631055] [2025-03-03 17:35:28,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:28,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:35:28,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:28,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:35:28,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:35:28,996 INFO L87 Difference]: Start difference. First operand 507 states and 749 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 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-03-03 17:35:29,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:29,548 INFO L93 Difference]: Finished difference Result 1048 states and 1548 transitions. [2025-03-03 17:35:29,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:35:29,548 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 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-03-03 17:35:29,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:29,550 INFO L225 Difference]: With dead ends: 1048 [2025-03-03 17:35:29,550 INFO L226 Difference]: Without dead ends: 572 [2025-03-03 17:35:29,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 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-03-03 17:35:29,551 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 118 mSDsluCounter, 4645 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 5228 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:29,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 5228 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:35:29,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-03 17:35:29,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 513. [2025-03-03 17:35:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 1.478515625) internal successors, (757), 512 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-03-03 17:35:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 757 transitions. [2025-03-03 17:35:29,559 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 757 transitions. Word has length 25 [2025-03-03 17:35:29,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:29,560 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 757 transitions. [2025-03-03 17:35:29,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 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-03-03 17:35:29,560 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 757 transitions. [2025-03-03 17:35:29,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 17:35:29,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:29,560 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-03-03 17:35:29,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:35:29,561 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:29,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:29,561 INFO L85 PathProgramCache]: Analyzing trace with hash -796376132, now seen corresponding path program 1 times [2025-03-03 17:35:29,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:29,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671733874] [2025-03-03 17:35:29,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:29,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:29,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 17:35:29,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 17:35:29,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:29,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:29,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:29,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:29,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671733874] [2025-03-03 17:35:29,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671733874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:29,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:29,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:35:29,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271470113] [2025-03-03 17:35:29,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:29,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:35:29,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:29,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:35:29,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:35:29,706 INFO L87 Difference]: Start difference. First operand 513 states and 757 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-03-03 17:35:30,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:30,165 INFO L93 Difference]: Finished difference Result 1370 states and 2029 transitions. [2025-03-03 17:35:30,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:35:30,165 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-03-03 17:35:30,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:30,168 INFO L225 Difference]: With dead ends: 1370 [2025-03-03 17:35:30,168 INFO L226 Difference]: Without dead ends: 881 [2025-03-03 17:35:30,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:35:30,169 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 610 mSDsluCounter, 2904 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 3489 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:30,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 3489 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:35:30,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-03 17:35:30,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 505. [2025-03-03 17:35:30,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 1.4742063492063493) internal successors, (743), 504 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:30,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 743 transitions. [2025-03-03 17:35:30,180 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 743 transitions. Word has length 25 [2025-03-03 17:35:30,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:30,180 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 743 transitions. [2025-03-03 17:35:30,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-03-03 17:35:30,180 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 743 transitions. [2025-03-03 17:35:30,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 17:35:30,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:30,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:35:30,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 17:35:30,181 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:30,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:30,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1732224637, now seen corresponding path program 1 times [2025-03-03 17:35:30,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:30,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291386925] [2025-03-03 17:35:30,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:30,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:30,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 17:35:30,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 17:35:30,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:30,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:30,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:30,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:30,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291386925] [2025-03-03 17:35:30,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291386925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:30,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:30,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 17:35:30,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153332039] [2025-03-03 17:35:30,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:30,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 17:35:30,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:30,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 17:35:30,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:35:30,510 INFO L87 Difference]: Start difference. First operand 505 states and 743 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:30,944 INFO L93 Difference]: Finished difference Result 1033 states and 1523 transitions. [2025-03-03 17:35:30,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 17:35:30,944 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-03-03 17:35:30,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:30,946 INFO L225 Difference]: With dead ends: 1033 [2025-03-03 17:35:30,946 INFO L226 Difference]: Without dead ends: 557 [2025-03-03 17:35:30,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-03-03 17:35:30,947 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 92 mSDsluCounter, 3490 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 4073 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:30,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 4073 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:35:30,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-03-03 17:35:30,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 505. [2025-03-03 17:35:30,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 1.4722222222222223) internal successors, (742), 504 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:30,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 742 transitions. [2025-03-03 17:35:30,955 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 742 transitions. Word has length 26 [2025-03-03 17:35:30,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:30,955 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 742 transitions. [2025-03-03 17:35:30,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:30,955 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 742 transitions. [2025-03-03 17:35:30,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 17:35:30,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:30,956 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:35:30,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 17:35:30,956 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:30,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:30,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1871041379, now seen corresponding path program 1 times [2025-03-03 17:35:30,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:30,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968877062] [2025-03-03 17:35:30,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:30,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:30,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 17:35:30,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 17:35:30,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:30,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:31,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:31,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:31,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968877062] [2025-03-03 17:35:31,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968877062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:31,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:31,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:35:31,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618451440] [2025-03-03 17:35:31,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:31,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:35:31,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:31,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:35:31,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:31,034 INFO L87 Difference]: Start difference. First operand 505 states and 742 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:31,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:31,252 INFO L93 Difference]: Finished difference Result 994 states and 1467 transitions. [2025-03-03 17:35:31,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:35:31,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-03-03 17:35:31,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:31,253 INFO L225 Difference]: With dead ends: 994 [2025-03-03 17:35:31,253 INFO L226 Difference]: Without dead ends: 511 [2025-03-03 17:35:31,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:35:31,254 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 36 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 2353 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:31,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 2353 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:35:31,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-03 17:35:31,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 498. [2025-03-03 17:35:31,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 497 states have (on average 1.476861167002012) internal successors, (734), 497 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-03-03 17:35:31,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 734 transitions. [2025-03-03 17:35:31,262 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 734 transitions. Word has length 27 [2025-03-03 17:35:31,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:31,262 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 734 transitions. [2025-03-03 17:35:31,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:31,262 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 734 transitions. [2025-03-03 17:35:31,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-03 17:35:31,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:31,265 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-03-03 17:35:31,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 17:35:31,265 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:31,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:31,266 INFO L85 PathProgramCache]: Analyzing trace with hash 662654040, now seen corresponding path program 1 times [2025-03-03 17:35:31,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:31,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923229664] [2025-03-03 17:35:31,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:31,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:31,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-03 17:35:32,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-03 17:35:32,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:32,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:33,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:33,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923229664] [2025-03-03 17:35:33,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923229664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:33,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:33,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 17:35:33,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582311292] [2025-03-03 17:35:33,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:33,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:35:33,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:33,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:35:33,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:35:33,381 INFO L87 Difference]: Start difference. First operand 498 states and 734 transitions. Second operand has 10 states, 10 states have (on average 26.1) internal successors, (261), 10 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-03-03 17:35:33,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:33,999 INFO L93 Difference]: Finished difference Result 1655 states and 2461 transitions. [2025-03-03 17:35:33,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 17:35:34,000 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 26.1) internal successors, (261), 10 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-03-03 17:35:34,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:34,004 INFO L225 Difference]: With dead ends: 1655 [2025-03-03 17:35:34,004 INFO L226 Difference]: Without dead ends: 1179 [2025-03-03 17:35:34,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-03 17:35:34,005 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 1270 mSDsluCounter, 4555 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 5134 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:34,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 5134 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:35:34,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2025-03-03 17:35:34,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 742. [2025-03-03 17:35:34,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 1.4804318488529016) internal successors, (1097), 741 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1097 transitions. [2025-03-03 17:35:34,019 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1097 transitions. Word has length 261 [2025-03-03 17:35:34,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:34,019 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1097 transitions. [2025-03-03 17:35:34,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.1) internal successors, (261), 10 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-03-03 17:35:34,020 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1097 transitions. [2025-03-03 17:35:34,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-03 17:35:34,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:34,021 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-03-03 17:35:34,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 17:35:34,022 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:34,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:34,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1429670175, now seen corresponding path program 1 times [2025-03-03 17:35:34,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:34,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116408401] [2025-03-03 17:35:34,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:34,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:34,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-03 17:35:34,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-03 17:35:34,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:34,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:35,287 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:35,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:35,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116408401] [2025-03-03 17:35:35,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116408401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:35,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:35,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:35:35,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493372456] [2025-03-03 17:35:35,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:35,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:35:35,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:35,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:35:35,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:35:35,289 INFO L87 Difference]: Start difference. First operand 742 states and 1097 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-03-03 17:35:35,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:35,841 INFO L93 Difference]: Finished difference Result 1684 states and 2504 transitions. [2025-03-03 17:35:35,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:35:35,842 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-03-03 17:35:35,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:35,846 INFO L225 Difference]: With dead ends: 1684 [2025-03-03 17:35:35,847 INFO L226 Difference]: Without dead ends: 1208 [2025-03-03 17:35:35,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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-03-03 17:35:35,848 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 664 mSDsluCounter, 4053 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 4635 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:35,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 4635 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:35:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2025-03-03 17:35:35,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1081. [2025-03-03 17:35:35,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1080 states have (on average 1.4851851851851852) internal successors, (1604), 1080 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:35,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1604 transitions. [2025-03-03 17:35:35,866 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1604 transitions. Word has length 262 [2025-03-03 17:35:35,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:35,866 INFO L471 AbstractCegarLoop]: Abstraction has 1081 states and 1604 transitions. [2025-03-03 17:35:35,867 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-03-03 17:35:35,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1604 transitions. [2025-03-03 17:35:35,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-03 17:35:35,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:35,872 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] [2025-03-03 17:35:35,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 17:35:35,873 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:35,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:35,873 INFO L85 PathProgramCache]: Analyzing trace with hash -684436575, now seen corresponding path program 1 times [2025-03-03 17:35:35,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:35,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432880467] [2025-03-03 17:35:35,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:35,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:35,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-03 17:35:36,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-03 17:35:36,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:36,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:37,200 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:37,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:37,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432880467] [2025-03-03 17:35:37,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432880467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:37,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:37,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:35:37,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477711661] [2025-03-03 17:35:37,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:37,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:35:37,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:37,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:35:37,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:35:37,203 INFO L87 Difference]: Start difference. First operand 1081 states and 1604 transitions. Second operand has 9 states, 9 states have (on average 29.22222222222222) internal successors, (263), 9 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-03-03 17:35:37,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:37,667 INFO L93 Difference]: Finished difference Result 2028 states and 3016 transitions. [2025-03-03 17:35:37,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:35:37,667 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 29.22222222222222) internal successors, (263), 9 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-03-03 17:35:37,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:37,671 INFO L225 Difference]: With dead ends: 2028 [2025-03-03 17:35:37,672 INFO L226 Difference]: Without dead ends: 1492 [2025-03-03 17:35:37,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:35:37,674 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 1357 mSDsluCounter, 2990 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 3569 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:37,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1357 Valid, 3569 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:35:37,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2025-03-03 17:35:37,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1425. [2025-03-03 17:35:37,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1425 states, 1424 states have (on average 1.4859550561797752) internal successors, (2116), 1424 states have internal predecessors, (2116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 2116 transitions. [2025-03-03 17:35:37,694 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 2116 transitions. Word has length 263 [2025-03-03 17:35:37,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:37,694 INFO L471 AbstractCegarLoop]: Abstraction has 1425 states and 2116 transitions. [2025-03-03 17:35:37,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.22222222222222) internal successors, (263), 9 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-03-03 17:35:37,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 2116 transitions. [2025-03-03 17:35:37,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-03 17:35:37,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:37,698 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] [2025-03-03 17:35:37,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 17:35:37,698 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:37,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:37,698 INFO L85 PathProgramCache]: Analyzing trace with hash -767106957, now seen corresponding path program 1 times [2025-03-03 17:35:37,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:37,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104492023] [2025-03-03 17:35:37,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:37,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:37,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-03 17:35:38,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-03 17:35:38,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:38,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:38,798 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:38,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:38,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104492023] [2025-03-03 17:35:38,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104492023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:38,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:38,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:35:38,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623731347] [2025-03-03 17:35:38,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:38,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:35:38,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:38,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:35:38,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:35:38,800 INFO L87 Difference]: Start difference. First operand 1425 states and 2116 transitions. Second operand has 7 states, 7 states have (on average 37.714285714285715) internal successors, (264), 7 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-03-03 17:35:39,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:39,137 INFO L93 Difference]: Finished difference Result 2564 states and 3812 transitions. [2025-03-03 17:35:39,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:35:39,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 37.714285714285715) internal successors, (264), 7 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-03-03 17:35:39,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:39,144 INFO L225 Difference]: With dead ends: 2564 [2025-03-03 17:35:39,145 INFO L226 Difference]: Without dead ends: 2077 [2025-03-03 17:35:39,146 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-03-03 17:35:39,147 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 673 mSDsluCounter, 2334 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 2921 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:39,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 2921 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:35:39,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2025-03-03 17:35:39,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 2073. [2025-03-03 17:35:39,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2073 states, 2072 states have (on average 1.486969111969112) internal successors, (3081), 2072 states have internal predecessors, (3081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:39,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 2073 states and 3081 transitions. [2025-03-03 17:35:39,182 INFO L78 Accepts]: Start accepts. Automaton has 2073 states and 3081 transitions. Word has length 264 [2025-03-03 17:35:39,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:39,183 INFO L471 AbstractCegarLoop]: Abstraction has 2073 states and 3081 transitions. [2025-03-03 17:35:39,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.714285714285715) internal successors, (264), 7 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-03-03 17:35:39,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 3081 transitions. [2025-03-03 17:35:39,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-03 17:35:39,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:39,188 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] [2025-03-03 17:35:39,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 17:35:39,188 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:39,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:39,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1891082914, now seen corresponding path program 1 times [2025-03-03 17:35:39,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:39,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750774241] [2025-03-03 17:35:39,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:39,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:39,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-03 17:35:39,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-03 17:35:39,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:39,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:40,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:40,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750774241] [2025-03-03 17:35:40,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750774241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:40,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:40,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 17:35:40,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567436962] [2025-03-03 17:35:40,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:40,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 17:35:40,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:40,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 17:35:40,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-03 17:35:40,719 INFO L87 Difference]: Start difference. First operand 2073 states and 3081 transitions. Second operand has 13 states, 13 states have (on average 20.384615384615383) internal successors, (265), 13 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-03-03 17:35:41,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:41,343 INFO L93 Difference]: Finished difference Result 5320 states and 7932 transitions. [2025-03-03 17:35:41,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 17:35:41,343 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 20.384615384615383) internal successors, (265), 13 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-03-03 17:35:41,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:41,352 INFO L225 Difference]: With dead ends: 5320 [2025-03-03 17:35:41,352 INFO L226 Difference]: Without dead ends: 3305 [2025-03-03 17:35:41,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-03 17:35:41,356 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 1071 mSDsluCounter, 5104 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 5674 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:41,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 5674 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 17:35:41,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3305 states. [2025-03-03 17:35:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3305 to 3289. [2025-03-03 17:35:41,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3289 states, 3288 states have (on average 1.4850973236009732) internal successors, (4883), 3288 states have internal predecessors, (4883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3289 states to 3289 states and 4883 transitions. [2025-03-03 17:35:41,401 INFO L78 Accepts]: Start accepts. Automaton has 3289 states and 4883 transitions. Word has length 265 [2025-03-03 17:35:41,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:41,402 INFO L471 AbstractCegarLoop]: Abstraction has 3289 states and 4883 transitions. [2025-03-03 17:35:41,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 20.384615384615383) internal successors, (265), 13 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-03-03 17:35:41,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3289 states and 4883 transitions. [2025-03-03 17:35:41,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-03 17:35:41,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:41,407 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] [2025-03-03 17:35:41,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 17:35:41,408 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:41,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:41,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1057893930, now seen corresponding path program 1 times [2025-03-03 17:35:41,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:41,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52186863] [2025-03-03 17:35:41,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:41,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:41,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-03 17:35:42,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-03 17:35:42,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:42,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:42,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:42,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52186863] [2025-03-03 17:35:42,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52186863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:42,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:42,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 17:35:42,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923285207] [2025-03-03 17:35:42,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:42,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:35:42,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:42,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:35:42,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:35:42,842 INFO L87 Difference]: Start difference. First operand 3289 states and 4883 transitions. Second operand has 10 states, 10 states have (on average 26.6) internal successors, (266), 10 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-03-03 17:35:43,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:43,431 INFO L93 Difference]: Finished difference Result 6239 states and 9258 transitions. [2025-03-03 17:35:43,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 17:35:43,431 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 26.6) internal successors, (266), 10 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-03-03 17:35:43,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:43,439 INFO L225 Difference]: With dead ends: 6239 [2025-03-03 17:35:43,440 INFO L226 Difference]: Without dead ends: 3611 [2025-03-03 17:35:43,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-03 17:35:43,445 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 662 mSDsluCounter, 4629 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 5210 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:43,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 5210 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:35:43,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3611 states. [2025-03-03 17:35:43,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3611 to 3314. [2025-03-03 17:35:43,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3314 states, 3313 states have (on average 1.4847570178086327) internal successors, (4919), 3313 states have internal predecessors, (4919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:43,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3314 states to 3314 states and 4919 transitions. [2025-03-03 17:35:43,490 INFO L78 Accepts]: Start accepts. Automaton has 3314 states and 4919 transitions. Word has length 266 [2025-03-03 17:35:43,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:43,490 INFO L471 AbstractCegarLoop]: Abstraction has 3314 states and 4919 transitions. [2025-03-03 17:35:43,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.6) internal successors, (266), 10 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-03-03 17:35:43,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3314 states and 4919 transitions. [2025-03-03 17:35:43,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-03 17:35:43,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:43,497 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] [2025-03-03 17:35:43,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 17:35:43,498 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:43,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:43,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1337087434, now seen corresponding path program 1 times [2025-03-03 17:35:43,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:43,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701916038] [2025-03-03 17:35:43,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:43,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:43,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-03 17:35:43,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-03 17:35:43,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:43,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:43,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:43,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701916038] [2025-03-03 17:35:43,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701916038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:43,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:43,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:35:43,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106567376] [2025-03-03 17:35:43,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:43,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:35:43,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:43,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:35:43,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:35:43,845 INFO L87 Difference]: Start difference. First operand 3314 states and 4919 transitions. Second operand has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 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-03-03 17:35:44,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:44,062 INFO L93 Difference]: Finished difference Result 5941 states and 8827 transitions. [2025-03-03 17:35:44,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:35:44,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 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-03-03 17:35:44,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:44,072 INFO L225 Difference]: With dead ends: 5941 [2025-03-03 17:35:44,072 INFO L226 Difference]: Without dead ends: 3332 [2025-03-03 17:35:44,076 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-03-03 17:35:44,077 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 4 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2362 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-03-03 17:35:44,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2362 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:35:44,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3332 states. [2025-03-03 17:35:44,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3332 to 3332. [2025-03-03 17:35:44,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3332 states, 3331 states have (on average 1.483938757129991) internal successors, (4943), 3331 states have internal predecessors, (4943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:44,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 4943 transitions. [2025-03-03 17:35:44,126 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 4943 transitions. Word has length 266 [2025-03-03 17:35:44,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:44,127 INFO L471 AbstractCegarLoop]: Abstraction has 3332 states and 4943 transitions. [2025-03-03 17:35:44,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 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-03-03 17:35:44,127 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 4943 transitions. [2025-03-03 17:35:44,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-03 17:35:44,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:44,133 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] [2025-03-03 17:35:44,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 17:35:44,133 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:44,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:44,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1046434939, now seen corresponding path program 1 times [2025-03-03 17:35:44,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:44,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224538369] [2025-03-03 17:35:44,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:44,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:44,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-03 17:35:44,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-03 17:35:44,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:44,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:44,425 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:44,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:44,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224538369] [2025-03-03 17:35:44,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224538369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:44,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:44,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:35:44,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875715512] [2025-03-03 17:35:44,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:44,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:35:44,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:44,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:35:44,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:44,428 INFO L87 Difference]: Start difference. First operand 3332 states and 4943 transitions. Second operand has 5 states, 5 states have (on average 53.4) internal successors, (267), 5 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-03-03 17:35:44,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:44,644 INFO L93 Difference]: Finished difference Result 6564 states and 9748 transitions. [2025-03-03 17:35:44,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:35:44,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.4) internal successors, (267), 5 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-03-03 17:35:44,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:44,652 INFO L225 Difference]: With dead ends: 6564 [2025-03-03 17:35:44,652 INFO L226 Difference]: Without dead ends: 3350 [2025-03-03 17:35:44,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:44,655 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-03-03 17:35:44,655 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-03-03 17:35:44,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3350 states. [2025-03-03 17:35:44,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3350 to 3350. [2025-03-03 17:35:44,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3350 states, 3349 states have (on average 1.4831292923260675) internal successors, (4967), 3349 states have internal predecessors, (4967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3350 states to 3350 states and 4967 transitions. [2025-03-03 17:35:44,695 INFO L78 Accepts]: Start accepts. Automaton has 3350 states and 4967 transitions. Word has length 267 [2025-03-03 17:35:44,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:44,696 INFO L471 AbstractCegarLoop]: Abstraction has 3350 states and 4967 transitions. [2025-03-03 17:35:44,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.4) internal successors, (267), 5 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-03-03 17:35:44,700 INFO L276 IsEmpty]: Start isEmpty. Operand 3350 states and 4967 transitions. [2025-03-03 17:35:44,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-03 17:35:44,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:44,705 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] [2025-03-03 17:35:44,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 17:35:44,706 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:44,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:44,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1800266444, now seen corresponding path program 1 times [2025-03-03 17:35:44,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:44,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35856664] [2025-03-03 17:35:44,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:44,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:44,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-03 17:35:45,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-03 17:35:45,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:45,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:45,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:45,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35856664] [2025-03-03 17:35:45,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35856664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:45,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:45,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:35:45,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112513972] [2025-03-03 17:35:45,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:45,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:35:45,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:45,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:35:45,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:35:45,830 INFO L87 Difference]: Start difference. First operand 3350 states and 4967 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-03-03 17:35:46,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:46,513 INFO L93 Difference]: Finished difference Result 5309 states and 7878 transitions. [2025-03-03 17:35:46,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:35:46,514 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-03-03 17:35:46,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:46,522 INFO L225 Difference]: With dead ends: 5309 [2025-03-03 17:35:46,522 INFO L226 Difference]: Without dead ends: 4319 [2025-03-03 17:35:46,523 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-03-03 17:35:46,523 INFO L435 NwaCegarLoop]: 1123 mSDtfsCounter, 743 mSDsluCounter, 7233 mSDsCounter, 0 mSdLazyCounter, 1831 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 8356 SdHoareTripleChecker+Invalid, 1833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:46,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 8356 Invalid, 1833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1831 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 17:35:46,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4319 states. [2025-03-03 17:35:46,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4319 to 3363. [2025-03-03 17:35:46,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3363 states, 3362 states have (on average 1.4824509220701962) internal successors, (4984), 3362 states have internal predecessors, (4984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:46,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3363 states to 3363 states and 4984 transitions. [2025-03-03 17:35:46,561 INFO L78 Accepts]: Start accepts. Automaton has 3363 states and 4984 transitions. Word has length 267 [2025-03-03 17:35:46,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:46,561 INFO L471 AbstractCegarLoop]: Abstraction has 3363 states and 4984 transitions. [2025-03-03 17:35:46,562 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-03-03 17:35:46,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3363 states and 4984 transitions. [2025-03-03 17:35:46,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-03 17:35:46,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:46,566 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] [2025-03-03 17:35:46,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 17:35:46,566 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:46,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:46,566 INFO L85 PathProgramCache]: Analyzing trace with hash -979836779, now seen corresponding path program 1 times [2025-03-03 17:35:46,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:46,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120256163] [2025-03-03 17:35:46,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:46,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:46,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-03 17:35:47,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-03 17:35:47,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:47,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:47,447 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:47,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:47,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120256163] [2025-03-03 17:35:47,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120256163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:47,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:47,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:35:47,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857740214] [2025-03-03 17:35:47,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:47,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:35:47,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:47,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:35:47,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:35:47,449 INFO L87 Difference]: Start difference. First operand 3363 states and 4984 transitions. Second operand has 7 states, 7 states have (on average 38.285714285714285) internal successors, (268), 7 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-03-03 17:35:47,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:47,739 INFO L93 Difference]: Finished difference Result 4371 states and 6480 transitions. [2025-03-03 17:35:47,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:35:47,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 38.285714285714285) internal successors, (268), 7 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-03-03 17:35:47,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:47,744 INFO L225 Difference]: With dead ends: 4371 [2025-03-03 17:35:47,744 INFO L226 Difference]: Without dead ends: 3368 [2025-03-03 17:35:47,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:35:47,746 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 475 mSDsluCounter, 2323 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 2906 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-03-03 17:35:47,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 2906 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:35:47,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3368 states. [2025-03-03 17:35:47,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3368 to 3368. [2025-03-03 17:35:47,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 3367 states have (on average 1.482031482031482) internal successors, (4990), 3367 states have internal predecessors, (4990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 4990 transitions. [2025-03-03 17:35:47,774 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 4990 transitions. Word has length 268 [2025-03-03 17:35:47,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:47,774 INFO L471 AbstractCegarLoop]: Abstraction has 3368 states and 4990 transitions. [2025-03-03 17:35:47,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.285714285714285) internal successors, (268), 7 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-03-03 17:35:47,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 4990 transitions. [2025-03-03 17:35:47,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-03 17:35:47,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:47,778 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, 1, 1, 1, 1] [2025-03-03 17:35:47,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 17:35:47,779 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:47,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:47,780 INFO L85 PathProgramCache]: Analyzing trace with hash -328645814, now seen corresponding path program 1 times [2025-03-03 17:35:47,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:47,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675928000] [2025-03-03 17:35:47,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:47,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-03 17:35:48,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-03 17:35:48,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:48,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:48,916 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:48,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:48,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675928000] [2025-03-03 17:35:48,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675928000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:48,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:48,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 17:35:48,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090409361] [2025-03-03 17:35:48,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:48,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 17:35:48,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:48,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 17:35:48,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:35:48,918 INFO L87 Difference]: Start difference. First operand 3368 states and 4990 transitions. Second operand has 12 states, 12 states have (on average 22.333333333333332) internal successors, (268), 12 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-03-03 17:35:49,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:49,449 INFO L93 Difference]: Finished difference Result 4450 states and 6587 transitions. [2025-03-03 17:35:49,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 17:35:49,449 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 22.333333333333332) internal successors, (268), 12 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-03-03 17:35:49,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:49,455 INFO L225 Difference]: With dead ends: 4450 [2025-03-03 17:35:49,455 INFO L226 Difference]: Without dead ends: 3442 [2025-03-03 17:35:49,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-03 17:35:49,457 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 111 mSDsluCounter, 5617 mSDsCounter, 0 mSdLazyCounter, 1440 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 6248 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:49,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 6248 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1440 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:35:49,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2025-03-03 17:35:49,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3380. [2025-03-03 17:35:49,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3380 states, 3379 states have (on average 1.4812074578277596) internal successors, (5005), 3379 states have internal predecessors, (5005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 3380 states and 5005 transitions. [2025-03-03 17:35:49,489 INFO L78 Accepts]: Start accepts. Automaton has 3380 states and 5005 transitions. Word has length 268 [2025-03-03 17:35:49,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:49,490 INFO L471 AbstractCegarLoop]: Abstraction has 3380 states and 5005 transitions. [2025-03-03 17:35:49,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.333333333333332) internal successors, (268), 12 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-03-03 17:35:49,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 5005 transitions. [2025-03-03 17:35:49,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-03 17:35:49,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:49,494 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-03-03 17:35:49,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 17:35:49,494 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:49,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:49,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2070010350, now seen corresponding path program 1 times [2025-03-03 17:35:49,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:49,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120969949] [2025-03-03 17:35:49,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:49,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:49,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-03 17:35:49,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-03 17:35:49,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:49,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:50,104 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:50,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:50,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120969949] [2025-03-03 17:35:50,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120969949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:50,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:50,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:35:50,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553294932] [2025-03-03 17:35:50,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:50,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:35:50,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:50,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:35:50,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:35:50,106 INFO L87 Difference]: Start difference. First operand 3380 states and 5005 transitions. Second operand has 9 states, 9 states have (on average 29.77777777777778) internal successors, (268), 9 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-03-03 17:35:50,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:50,426 INFO L93 Difference]: Finished difference Result 6537 states and 9699 transitions. [2025-03-03 17:35:50,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:35:50,427 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 29.77777777777778) internal successors, (268), 9 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-03-03 17:35:50,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:50,433 INFO L225 Difference]: With dead ends: 6537 [2025-03-03 17:35:50,434 INFO L226 Difference]: Without dead ends: 4764 [2025-03-03 17:35:50,436 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-03-03 17:35:50,436 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 93 mSDsluCounter, 4072 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 4657 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:50,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 4657 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:35:50,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4764 states. [2025-03-03 17:35:50,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4764 to 4764. [2025-03-03 17:35:50,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4764 states, 4763 states have (on average 1.4799496115893345) internal successors, (7049), 4763 states have internal predecessors, (7049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:50,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4764 states to 4764 states and 7049 transitions. [2025-03-03 17:35:50,478 INFO L78 Accepts]: Start accepts. Automaton has 4764 states and 7049 transitions. Word has length 268 [2025-03-03 17:35:50,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:50,478 INFO L471 AbstractCegarLoop]: Abstraction has 4764 states and 7049 transitions. [2025-03-03 17:35:50,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.77777777777778) internal successors, (268), 9 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-03-03 17:35:50,497 INFO L276 IsEmpty]: Start isEmpty. Operand 4764 states and 7049 transitions. [2025-03-03 17:35:50,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-03 17:35:50,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:50,505 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-03-03 17:35:50,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 17:35:50,505 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:50,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:50,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1592546724, now seen corresponding path program 1 times [2025-03-03 17:35:50,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:50,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858080645] [2025-03-03 17:35:50,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:50,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:50,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-03 17:35:50,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-03 17:35:50,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:50,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:51,450 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:51,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:51,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858080645] [2025-03-03 17:35:51,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858080645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:51,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:51,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:35:51,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775585430] [2025-03-03 17:35:51,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:51,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:35:51,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:51,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:35:51,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:35:51,452 INFO L87 Difference]: Start difference. First operand 4764 states and 7049 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-03-03 17:35:51,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:51,664 INFO L93 Difference]: Finished difference Result 6151 states and 9098 transitions. [2025-03-03 17:35:51,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:35:51,665 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-03-03 17:35:51,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:51,671 INFO L225 Difference]: With dead ends: 6151 [2025-03-03 17:35:51,672 INFO L226 Difference]: Without dead ends: 4764 [2025-03-03 17:35:51,674 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-03-03 17:35:51,675 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 795 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 2200 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.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:51,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 2200 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:35:51,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4764 states. [2025-03-03 17:35:51,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4764 to 4764. [2025-03-03 17:35:51,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4764 states, 4763 states have (on average 1.4795297081671215) internal successors, (7047), 4763 states have internal predecessors, (7047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:51,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4764 states to 4764 states and 7047 transitions. [2025-03-03 17:35:51,749 INFO L78 Accepts]: Start accepts. Automaton has 4764 states and 7047 transitions. Word has length 268 [2025-03-03 17:35:51,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:51,749 INFO L471 AbstractCegarLoop]: Abstraction has 4764 states and 7047 transitions. [2025-03-03 17:35:51,749 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-03-03 17:35:51,749 INFO L276 IsEmpty]: Start isEmpty. Operand 4764 states and 7047 transitions. [2025-03-03 17:35:51,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-03 17:35:51,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:51,763 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-03-03 17:35:51,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 17:35:51,763 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:51,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:51,764 INFO L85 PathProgramCache]: Analyzing trace with hash 659231918, now seen corresponding path program 1 times [2025-03-03 17:35:51,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:51,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265958013] [2025-03-03 17:35:51,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:51,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:51,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-03 17:35:52,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-03 17:35:52,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:52,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:53,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:53,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265958013] [2025-03-03 17:35:53,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265958013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:53,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:53,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 17:35:53,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009908469] [2025-03-03 17:35:53,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:53,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 17:35:53,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:53,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 17:35:53,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:35:53,041 INFO L87 Difference]: Start difference. First operand 4764 states and 7047 transitions. Second operand has 11 states, 11 states have (on average 24.363636363636363) internal successors, (268), 11 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-03-03 17:35:53,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:53,419 INFO L93 Difference]: Finished difference Result 10145 states and 15027 transitions. [2025-03-03 17:35:53,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 17:35:53,420 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 24.363636363636363) internal successors, (268), 11 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-03-03 17:35:53,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:53,429 INFO L225 Difference]: With dead ends: 10145 [2025-03-03 17:35:53,430 INFO L226 Difference]: Without dead ends: 6292 [2025-03-03 17:35:53,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:35:53,435 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 137 mSDsluCounter, 4733 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 5318 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:53,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 5318 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:35:53,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6292 states. [2025-03-03 17:35:53,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6292 to 5596. [2025-03-03 17:35:53,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5596 states, 5595 states have (on average 1.4736371760500446) internal successors, (8245), 5595 states have internal predecessors, (8245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:53,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 8245 transitions. [2025-03-03 17:35:53,488 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 8245 transitions. Word has length 268 [2025-03-03 17:35:53,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:53,489 INFO L471 AbstractCegarLoop]: Abstraction has 5596 states and 8245 transitions. [2025-03-03 17:35:53,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 24.363636363636363) internal successors, (268), 11 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-03-03 17:35:53,489 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 8245 transitions. [2025-03-03 17:35:53,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-03 17:35:53,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:53,495 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-03-03 17:35:53,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 17:35:53,495 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:53,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:53,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1097102790, now seen corresponding path program 1 times [2025-03-03 17:35:53,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:53,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519675548] [2025-03-03 17:35:53,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:53,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:53,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-03 17:35:54,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-03 17:35:54,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:54,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:55,531 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:55,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:55,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519675548] [2025-03-03 17:35:55,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519675548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:55,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:55,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 17:35:55,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813340878] [2025-03-03 17:35:55,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:55,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 17:35:55,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:55,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 17:35:55,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-03 17:35:55,533 INFO L87 Difference]: Start difference. First operand 5596 states and 8245 transitions. Second operand has 15 states, 15 states have (on average 17.933333333333334) internal successors, (269), 15 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-03-03 17:35:56,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:56,688 INFO L93 Difference]: Finished difference Result 13621 states and 20061 transitions. [2025-03-03 17:35:56,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 17:35:56,688 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 17.933333333333334) internal successors, (269), 15 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-03-03 17:35:56,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:56,701 INFO L225 Difference]: With dead ends: 13621 [2025-03-03 17:35:56,701 INFO L226 Difference]: Without dead ends: 10848 [2025-03-03 17:35:56,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2025-03-03 17:35:56,705 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 2184 mSDsluCounter, 6896 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2184 SdHoareTripleChecker+Valid, 7461 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:56,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2184 Valid, 7461 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 17:35:56,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10848 states. [2025-03-03 17:35:56,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10848 to 8341. [2025-03-03 17:35:56,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8341 states, 8340 states have (on average 1.4701438848920863) internal successors, (12261), 8340 states have internal predecessors, (12261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:56,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8341 states to 8341 states and 12261 transitions. [2025-03-03 17:35:56,785 INFO L78 Accepts]: Start accepts. Automaton has 8341 states and 12261 transitions. Word has length 269 [2025-03-03 17:35:56,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:56,786 INFO L471 AbstractCegarLoop]: Abstraction has 8341 states and 12261 transitions. [2025-03-03 17:35:56,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 17.933333333333334) internal successors, (269), 15 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-03-03 17:35:56,786 INFO L276 IsEmpty]: Start isEmpty. Operand 8341 states and 12261 transitions. [2025-03-03 17:35:56,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 17:35:56,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:56,795 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, 1] [2025-03-03 17:35:56,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 17:35:56,795 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:56,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:56,796 INFO L85 PathProgramCache]: Analyzing trace with hash -947200346, now seen corresponding path program 1 times [2025-03-03 17:35:56,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:56,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364590269] [2025-03-03 17:35:56,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:56,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:56,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 17:35:57,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 17:35:57,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:57,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:58,102 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:58,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:58,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364590269] [2025-03-03 17:35:58,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364590269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:58,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:58,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:35:58,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084256501] [2025-03-03 17:35:58,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:58,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:35:58,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:58,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:35:58,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:35:58,104 INFO L87 Difference]: Start difference. First operand 8341 states and 12261 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-03-03 17:35:58,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:58,495 INFO L93 Difference]: Finished difference Result 12686 states and 18665 transitions. [2025-03-03 17:35:58,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:35:58,495 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-03-03 17:35:58,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:58,508 INFO L225 Difference]: With dead ends: 12686 [2025-03-03 17:35:58,508 INFO L226 Difference]: Without dead ends: 10869 [2025-03-03 17:35:58,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:35:58,514 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 741 mSDsluCounter, 3645 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 4223 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:58,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 4223 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:35:58,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10869 states. [2025-03-03 17:35:58,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10869 to 10861. [2025-03-03 17:35:58,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10861 states, 10860 states have (on average 1.4693370165745856) internal successors, (15957), 10860 states have internal predecessors, (15957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:58,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 15957 transitions. [2025-03-03 17:35:58,619 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 15957 transitions. Word has length 270 [2025-03-03 17:35:58,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:58,620 INFO L471 AbstractCegarLoop]: Abstraction has 10861 states and 15957 transitions. [2025-03-03 17:35:58,620 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-03-03 17:35:58,620 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 15957 transitions. [2025-03-03 17:35:58,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 17:35:58,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:58,631 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, 1] [2025-03-03 17:35:58,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 17:35:58,632 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:58,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:58,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1272650323, now seen corresponding path program 1 times [2025-03-03 17:35:58,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:58,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612949636] [2025-03-03 17:35:58,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:58,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:58,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 17:35:58,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 17:35:58,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:58,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:59,077 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:59,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:59,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612949636] [2025-03-03 17:35:59,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612949636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:59,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:59,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:35:59,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911307503] [2025-03-03 17:35:59,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:59,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:35:59,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:59,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:35:59,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:35:59,082 INFO L87 Difference]: Start difference. First operand 10861 states and 15957 transitions. Second operand has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 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-03-03 17:35:59,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:59,350 INFO L93 Difference]: Finished difference Result 17673 states and 26006 transitions. [2025-03-03 17:35:59,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:35:59,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 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-03-03 17:35:59,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:59,363 INFO L225 Difference]: With dead ends: 17673 [2025-03-03 17:35:59,363 INFO L226 Difference]: Without dead ends: 10873 [2025-03-03 17:35:59,371 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-03-03 17:35:59,372 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 3 mSDsluCounter, 2357 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 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.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:59,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2950 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:35:59,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10873 states. [2025-03-03 17:35:59,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10873 to 10873. [2025-03-03 17:35:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10873 states, 10872 states have (on average 1.4690029433406917) internal successors, (15971), 10872 states have internal predecessors, (15971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10873 states to 10873 states and 15971 transitions. [2025-03-03 17:35:59,484 INFO L78 Accepts]: Start accepts. Automaton has 10873 states and 15971 transitions. Word has length 270 [2025-03-03 17:35:59,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:59,485 INFO L471 AbstractCegarLoop]: Abstraction has 10873 states and 15971 transitions. [2025-03-03 17:35:59,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 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-03-03 17:35:59,485 INFO L276 IsEmpty]: Start isEmpty. Operand 10873 states and 15971 transitions. [2025-03-03 17:35:59,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-03 17:35:59,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:59,495 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, 1, 1] [2025-03-03 17:35:59,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 17:35:59,496 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:59,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:59,496 INFO L85 PathProgramCache]: Analyzing trace with hash 330718375, now seen corresponding path program 1 times [2025-03-03 17:35:59,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:59,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406891015] [2025-03-03 17:35:59,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:59,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:59,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-03 17:36:00,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-03 17:36:00,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:00,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:00,707 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:00,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:00,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406891015] [2025-03-03 17:36:00,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406891015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:00,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:00,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:36:00,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967592965] [2025-03-03 17:36:00,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:00,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:36:00,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:00,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:36:00,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:36:00,709 INFO L87 Difference]: Start difference. First operand 10873 states and 15971 transitions. Second operand has 8 states, 8 states have (on average 33.875) internal successors, (271), 8 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-03-03 17:36:01,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:01,054 INFO L93 Difference]: Finished difference Result 21620 states and 31776 transitions. [2025-03-03 17:36:01,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:36:01,055 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 33.875) internal successors, (271), 8 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-03-03 17:36:01,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:01,065 INFO L225 Difference]: With dead ends: 21620 [2025-03-03 17:36:01,065 INFO L226 Difference]: Without dead ends: 11041 [2025-03-03 17:36:01,075 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-03-03 17:36:01,076 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 462 mSDsluCounter, 3146 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 3730 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:01,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 3730 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:36:01,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11041 states. [2025-03-03 17:36:01,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11041 to 11023. [2025-03-03 17:36:01,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11023 states, 11022 states have (on average 1.468063872255489) internal successors, (16181), 11022 states have internal predecessors, (16181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:01,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11023 states to 11023 states and 16181 transitions. [2025-03-03 17:36:01,181 INFO L78 Accepts]: Start accepts. Automaton has 11023 states and 16181 transitions. Word has length 271 [2025-03-03 17:36:01,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:01,182 INFO L471 AbstractCegarLoop]: Abstraction has 11023 states and 16181 transitions. [2025-03-03 17:36:01,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 33.875) internal successors, (271), 8 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-03-03 17:36:01,182 INFO L276 IsEmpty]: Start isEmpty. Operand 11023 states and 16181 transitions. [2025-03-03 17:36:01,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-03 17:36:01,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:01,191 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, 1, 1] [2025-03-03 17:36:01,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 17:36:01,192 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:01,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:01,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1778961639, now seen corresponding path program 1 times [2025-03-03 17:36:01,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:01,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853753935] [2025-03-03 17:36:01,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:01,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:01,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-03 17:36:01,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-03 17:36:01,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:01,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:01,579 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:01,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:01,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853753935] [2025-03-03 17:36:01,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853753935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:01,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:01,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:01,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434268061] [2025-03-03 17:36:01,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:01,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:01,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:01,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:01,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:01,581 INFO L87 Difference]: Start difference. First operand 11023 states and 16181 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-03-03 17:36:01,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:01,873 INFO L93 Difference]: Finished difference Result 18004 states and 26456 transitions. [2025-03-03 17:36:01,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:01,873 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-03-03 17:36:01,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:01,884 INFO L225 Difference]: With dead ends: 18004 [2025-03-03 17:36:01,884 INFO L226 Difference]: Without dead ends: 11095 [2025-03-03 17:36:01,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:01,892 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 4 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2358 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-03-03 17:36:01,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2358 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:36:01,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11095 states. [2025-03-03 17:36:01,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11095 to 11095. [2025-03-03 17:36:01,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11095 states, 11094 states have (on average 1.4671894717865512) internal successors, (16277), 11094 states have internal predecessors, (16277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:01,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11095 states to 11095 states and 16277 transitions. [2025-03-03 17:36:01,992 INFO L78 Accepts]: Start accepts. Automaton has 11095 states and 16277 transitions. Word has length 271 [2025-03-03 17:36:01,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:01,992 INFO L471 AbstractCegarLoop]: Abstraction has 11095 states and 16277 transitions. [2025-03-03 17:36:01,992 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-03-03 17:36:01,992 INFO L276 IsEmpty]: Start isEmpty. Operand 11095 states and 16277 transitions. [2025-03-03 17:36:02,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-03 17:36:02,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:02,001 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, 1, 1, 1] [2025-03-03 17:36:02,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 17:36:02,002 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:02,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:02,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1224260810, now seen corresponding path program 1 times [2025-03-03 17:36:02,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:02,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213716634] [2025-03-03 17:36:02,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:02,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:02,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 17:36:02,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 17:36:02,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:02,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:03,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:03,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213716634] [2025-03-03 17:36:03,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213716634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:03,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:03,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 17:36:03,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134300047] [2025-03-03 17:36:03,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:03,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 17:36:03,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:03,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 17:36:03,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:36:03,315 INFO L87 Difference]: Start difference. First operand 11095 states and 16277 transitions. Second operand has 12 states, 12 states have (on average 22.666666666666668) internal successors, (272), 12 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-03-03 17:36:03,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:03,868 INFO L93 Difference]: Finished difference Result 14053 states and 20628 transitions. [2025-03-03 17:36:03,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 17:36:03,868 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 22.666666666666668) internal successors, (272), 12 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-03-03 17:36:03,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:03,880 INFO L225 Difference]: With dead ends: 14053 [2025-03-03 17:36:03,881 INFO L226 Difference]: Without dead ends: 11161 [2025-03-03 17:36:03,887 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-03-03 17:36:03,888 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 111 mSDsluCounter, 6227 mSDsCounter, 0 mSdLazyCounter, 1601 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 6857 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:03,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 6857 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1601 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:36:03,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11161 states. [2025-03-03 17:36:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11161 to 11101. [2025-03-03 17:36:03,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11101 states, 11100 states have (on average 1.4671171171171171) internal successors, (16285), 11100 states have internal predecessors, (16285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:03,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11101 states to 11101 states and 16285 transitions. [2025-03-03 17:36:03,991 INFO L78 Accepts]: Start accepts. Automaton has 11101 states and 16285 transitions. Word has length 272 [2025-03-03 17:36:03,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:03,991 INFO L471 AbstractCegarLoop]: Abstraction has 11101 states and 16285 transitions. [2025-03-03 17:36:03,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.666666666666668) internal successors, (272), 12 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-03-03 17:36:03,991 INFO L276 IsEmpty]: Start isEmpty. Operand 11101 states and 16285 transitions. [2025-03-03 17:36:03,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-03 17:36:03,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:04,000 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-03-03 17:36:04,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 17:36:04,000 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:04,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:04,000 INFO L85 PathProgramCache]: Analyzing trace with hash -924118239, now seen corresponding path program 1 times [2025-03-03 17:36:04,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:04,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331107201] [2025-03-03 17:36:04,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:04,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:04,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 17:36:04,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 17:36:04,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:04,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:05,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:05,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331107201] [2025-03-03 17:36:05,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331107201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:05,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:05,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 17:36:05,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272959399] [2025-03-03 17:36:05,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:05,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:36:05,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:05,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:36:05,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:36:05,253 INFO L87 Difference]: Start difference. First operand 11101 states and 16285 transitions. Second operand has 10 states, 10 states have (on average 27.2) internal successors, (272), 10 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-03-03 17:36:05,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:05,937 INFO L93 Difference]: Finished difference Result 16923 states and 24851 transitions. [2025-03-03 17:36:05,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:36:05,937 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.2) internal successors, (272), 10 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-03-03 17:36:05,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:05,952 INFO L225 Difference]: With dead ends: 16923 [2025-03-03 17:36:05,953 INFO L226 Difference]: Without dead ends: 13982 [2025-03-03 17:36:05,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:36:05,961 INFO L435 NwaCegarLoop]: 1031 mSDtfsCounter, 665 mSDsluCounter, 7755 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 8786 SdHoareTripleChecker+Invalid, 1947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:05,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 8786 Invalid, 1947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1945 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 17:36:05,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13982 states. [2025-03-03 17:36:06,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13982 to 11246. [2025-03-03 17:36:06,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11246 states, 11245 states have (on average 1.4664295242329923) internal successors, (16490), 11245 states have internal predecessors, (16490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:06,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11246 states to 11246 states and 16490 transitions. [2025-03-03 17:36:06,061 INFO L78 Accepts]: Start accepts. Automaton has 11246 states and 16490 transitions. Word has length 272 [2025-03-03 17:36:06,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:06,062 INFO L471 AbstractCegarLoop]: Abstraction has 11246 states and 16490 transitions. [2025-03-03 17:36:06,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.2) internal successors, (272), 10 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-03-03 17:36:06,062 INFO L276 IsEmpty]: Start isEmpty. Operand 11246 states and 16490 transitions. [2025-03-03 17:36:06,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-03 17:36:06,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:06,071 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-03-03 17:36:06,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 17:36:06,071 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:06,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:06,072 INFO L85 PathProgramCache]: Analyzing trace with hash -298503988, now seen corresponding path program 1 times [2025-03-03 17:36:06,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:06,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748856709] [2025-03-03 17:36:06,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:06,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:06,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 17:36:06,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 17:36:06,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:06,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:06,471 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:06,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:06,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748856709] [2025-03-03 17:36:06,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748856709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:06,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:06,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:06,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130201641] [2025-03-03 17:36:06,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:06,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:06,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:06,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:06,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:06,473 INFO L87 Difference]: Start difference. First operand 11246 states and 16490 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-03-03 17:36:06,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:06,654 INFO L93 Difference]: Finished difference Result 14370 states and 21078 transitions. [2025-03-03 17:36:06,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:06,654 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-03-03 17:36:06,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:06,665 INFO L225 Difference]: With dead ends: 14370 [2025-03-03 17:36:06,665 INFO L226 Difference]: Without dead ends: 11374 [2025-03-03 17:36:06,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:06,671 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 34 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 2359 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-03-03 17:36:06,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 2359 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:36:06,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11374 states. [2025-03-03 17:36:06,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11374 to 11374. [2025-03-03 17:36:06,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11374 states, 11373 states have (on average 1.465576365075178) internal successors, (16668), 11373 states have internal predecessors, (16668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:06,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11374 states to 11374 states and 16668 transitions. [2025-03-03 17:36:06,759 INFO L78 Accepts]: Start accepts. Automaton has 11374 states and 16668 transitions. Word has length 272 [2025-03-03 17:36:06,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:06,760 INFO L471 AbstractCegarLoop]: Abstraction has 11374 states and 16668 transitions. [2025-03-03 17:36:06,760 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-03-03 17:36:06,760 INFO L276 IsEmpty]: Start isEmpty. Operand 11374 states and 16668 transitions. [2025-03-03 17:36:06,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-03 17:36:06,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:06,769 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-03-03 17:36:06,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 17:36:06,769 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:06,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:06,770 INFO L85 PathProgramCache]: Analyzing trace with hash 282976404, now seen corresponding path program 1 times [2025-03-03 17:36:06,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:06,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058461484] [2025-03-03 17:36:06,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:06,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:06,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-03 17:36:07,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-03 17:36:07,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:07,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:07,370 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:07,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:07,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058461484] [2025-03-03 17:36:07,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058461484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:07,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:07,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:07,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121742451] [2025-03-03 17:36:07,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:07,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:07,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:07,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:07,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:07,372 INFO L87 Difference]: Start difference. First operand 11374 states and 16668 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-03-03 17:36:07,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:07,608 INFO L93 Difference]: Finished difference Result 14503 states and 21259 transitions. [2025-03-03 17:36:07,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:07,609 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-03-03 17:36:07,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:07,620 INFO L225 Difference]: With dead ends: 14503 [2025-03-03 17:36:07,620 INFO L226 Difference]: Without dead ends: 11368 [2025-03-03 17:36:07,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:07,625 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 168 mSDsluCounter, 1765 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:07,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 2357 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:36:07,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11368 states. [2025-03-03 17:36:07,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11368 to 11368. [2025-03-03 17:36:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11368 states, 11367 states have (on average 1.465294272895223) internal successors, (16656), 11367 states have internal predecessors, (16656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11368 states to 11368 states and 16656 transitions. [2025-03-03 17:36:07,718 INFO L78 Accepts]: Start accepts. Automaton has 11368 states and 16656 transitions. Word has length 273 [2025-03-03 17:36:07,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:07,718 INFO L471 AbstractCegarLoop]: Abstraction has 11368 states and 16656 transitions. [2025-03-03 17:36:07,719 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-03-03 17:36:07,719 INFO L276 IsEmpty]: Start isEmpty. Operand 11368 states and 16656 transitions. [2025-03-03 17:36:07,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-03 17:36:07,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:07,728 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, 1] [2025-03-03 17:36:07,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 17:36:07,728 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:07,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:07,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1397262658, now seen corresponding path program 1 times [2025-03-03 17:36:07,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:07,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134165629] [2025-03-03 17:36:07,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:07,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:07,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-03 17:36:08,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-03 17:36:08,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:08,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:09,157 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:09,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:09,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134165629] [2025-03-03 17:36:09,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134165629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:09,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:09,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 17:36:09,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044028330] [2025-03-03 17:36:09,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:09,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 17:36:09,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:09,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 17:36:09,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 17:36:09,159 INFO L87 Difference]: Start difference. First operand 11368 states and 16656 transitions. Second operand has 13 states, 13 states have (on average 21.0) internal successors, (273), 13 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-03-03 17:36:09,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:09,685 INFO L93 Difference]: Finished difference Result 14518 states and 21275 transitions. [2025-03-03 17:36:09,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 17:36:09,685 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 21.0) internal successors, (273), 13 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-03-03 17:36:09,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:09,695 INFO L225 Difference]: With dead ends: 14518 [2025-03-03 17:36:09,695 INFO L226 Difference]: Without dead ends: 11431 [2025-03-03 17:36:09,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 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-03-03 17:36:09,700 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 110 mSDsluCounter, 5610 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 6240 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:09,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 6240 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:36:09,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11431 states. [2025-03-03 17:36:09,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11431 to 11371. [2025-03-03 17:36:09,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11371 states, 11370 states have (on average 1.4651715039577837) internal successors, (16659), 11370 states have internal predecessors, (16659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:09,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11371 states to 11371 states and 16659 transitions. [2025-03-03 17:36:09,782 INFO L78 Accepts]: Start accepts. Automaton has 11371 states and 16659 transitions. Word has length 273 [2025-03-03 17:36:09,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:09,782 INFO L471 AbstractCegarLoop]: Abstraction has 11371 states and 16659 transitions. [2025-03-03 17:36:09,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 21.0) internal successors, (273), 13 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-03-03 17:36:09,782 INFO L276 IsEmpty]: Start isEmpty. Operand 11371 states and 16659 transitions. [2025-03-03 17:36:09,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-03 17:36:09,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:09,789 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-03-03 17:36:09,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 17:36:09,790 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:09,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:09,790 INFO L85 PathProgramCache]: Analyzing trace with hash -650506191, now seen corresponding path program 1 times [2025-03-03 17:36:09,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:09,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137446283] [2025-03-03 17:36:09,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:09,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:09,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-03 17:36:10,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-03 17:36:10,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:10,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:10,807 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:10,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:10,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137446283] [2025-03-03 17:36:10,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137446283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:10,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:10,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:36:10,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798816823] [2025-03-03 17:36:10,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:10,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:36:10,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:10,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:36:10,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:36:10,808 INFO L87 Difference]: Start difference. First operand 11371 states and 16659 transitions. Second operand has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 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-03-03 17:36:11,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:11,367 INFO L93 Difference]: Finished difference Result 17187 states and 25208 transitions. [2025-03-03 17:36:11,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:36:11,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 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-03-03 17:36:11,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:11,380 INFO L225 Difference]: With dead ends: 17187 [2025-03-03 17:36:11,381 INFO L226 Difference]: Without dead ends: 14097 [2025-03-03 17:36:11,385 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-03-03 17:36:11,386 INFO L435 NwaCegarLoop]: 1033 mSDtfsCounter, 658 mSDsluCounter, 6736 mSDsCounter, 0 mSdLazyCounter, 1707 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 7769 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-03-03 17:36:11,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 7769 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1707 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:36:11,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14097 states. [2025-03-03 17:36:11,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14097 to 11369. [2025-03-03 17:36:11,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11369 states, 11368 states have (on average 1.4649894440534834) internal successors, (16654), 11368 states have internal predecessors, (16654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:11,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 16654 transitions. [2025-03-03 17:36:11,506 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 16654 transitions. Word has length 273 [2025-03-03 17:36:11,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:11,507 INFO L471 AbstractCegarLoop]: Abstraction has 11369 states and 16654 transitions. [2025-03-03 17:36:11,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 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-03-03 17:36:11,507 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 16654 transitions. [2025-03-03 17:36:11,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-03 17:36:11,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:11,515 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-03-03 17:36:11,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 17:36:11,515 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:11,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:11,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1514090803, now seen corresponding path program 1 times [2025-03-03 17:36:11,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:11,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130795253] [2025-03-03 17:36:11,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:11,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:11,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-03 17:36:11,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-03 17:36:11,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:11,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:11,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:11,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130795253] [2025-03-03 17:36:11,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130795253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:11,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:11,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:11,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010626812] [2025-03-03 17:36:11,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:11,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:11,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:11,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:11,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:11,883 INFO L87 Difference]: Start difference. First operand 11369 states and 16654 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-03-03 17:36:12,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:12,060 INFO L93 Difference]: Finished difference Result 14549 states and 21316 transitions. [2025-03-03 17:36:12,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:12,060 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-03-03 17:36:12,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:12,069 INFO L225 Difference]: With dead ends: 14549 [2025-03-03 17:36:12,069 INFO L226 Difference]: Without dead ends: 11461 [2025-03-03 17:36:12,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:12,073 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 15 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2359 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.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:12,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2359 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:12,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11461 states. [2025-03-03 17:36:12,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11461 to 11461. [2025-03-03 17:36:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11461 states, 11460 states have (on average 1.4640488656195463) internal successors, (16778), 11460 states have internal predecessors, (16778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:12,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11461 states to 11461 states and 16778 transitions. [2025-03-03 17:36:12,147 INFO L78 Accepts]: Start accepts. Automaton has 11461 states and 16778 transitions. Word has length 273 [2025-03-03 17:36:12,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:12,147 INFO L471 AbstractCegarLoop]: Abstraction has 11461 states and 16778 transitions. [2025-03-03 17:36:12,147 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-03-03 17:36:12,147 INFO L276 IsEmpty]: Start isEmpty. Operand 11461 states and 16778 transitions. [2025-03-03 17:36:12,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-03 17:36:12,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:12,154 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-03-03 17:36:12,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 17:36:12,154 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:12,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:12,155 INFO L85 PathProgramCache]: Analyzing trace with hash -23102034, now seen corresponding path program 1 times [2025-03-03 17:36:12,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:12,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816971833] [2025-03-03 17:36:12,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:12,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:12,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-03 17:36:12,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-03 17:36:12,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:12,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:12,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:12,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816971833] [2025-03-03 17:36:12,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816971833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:12,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:12,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:12,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862787501] [2025-03-03 17:36:12,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:12,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:12,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:12,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:12,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:12,532 INFO L87 Difference]: Start difference. First operand 11461 states and 16778 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-03-03 17:36:12,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:12,770 INFO L93 Difference]: Finished difference Result 14645 states and 21444 transitions. [2025-03-03 17:36:12,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:36:12,771 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-03-03 17:36:12,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:12,780 INFO L225 Difference]: With dead ends: 14645 [2025-03-03 17:36:12,781 INFO L226 Difference]: Without dead ends: 11477 [2025-03-03 17:36:12,785 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-03-03 17:36:12,785 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 0 mSDsluCounter, 1698 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2291 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.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:12,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2291 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:36:12,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11477 states. [2025-03-03 17:36:12,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11477 to 11477. [2025-03-03 17:36:12,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11477 states, 11476 states have (on average 1.463401882188916) internal successors, (16794), 11476 states have internal predecessors, (16794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:12,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11477 states to 11477 states and 16794 transitions. [2025-03-03 17:36:12,907 INFO L78 Accepts]: Start accepts. Automaton has 11477 states and 16794 transitions. Word has length 273 [2025-03-03 17:36:12,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:12,907 INFO L471 AbstractCegarLoop]: Abstraction has 11477 states and 16794 transitions. [2025-03-03 17:36:12,907 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-03-03 17:36:12,907 INFO L276 IsEmpty]: Start isEmpty. Operand 11477 states and 16794 transitions. [2025-03-03 17:36:12,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-03 17:36:12,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:12,917 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-03-03 17:36:12,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 17:36:12,917 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:12,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:12,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1583063140, now seen corresponding path program 1 times [2025-03-03 17:36:12,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:12,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216257882] [2025-03-03 17:36:12,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:12,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:12,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-03 17:36:13,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-03 17:36:13,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:13,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:13,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:13,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216257882] [2025-03-03 17:36:13,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216257882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:13,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:13,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:36:13,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879891298] [2025-03-03 17:36:13,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:13,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:36:13,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:13,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:36:13,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:13,855 INFO L87 Difference]: Start difference. First operand 11477 states and 16794 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-03-03 17:36:14,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:14,093 INFO L93 Difference]: Finished difference Result 15156 states and 22174 transitions. [2025-03-03 17:36:14,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:36:14,093 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-03-03 17:36:14,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:14,102 INFO L225 Difference]: With dead ends: 15156 [2025-03-03 17:36:14,102 INFO L226 Difference]: Without dead ends: 11924 [2025-03-03 17:36:14,105 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-03-03 17:36:14,105 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 131 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 2942 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.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:14,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 2942 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:36:14,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11924 states. [2025-03-03 17:36:14,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11924 to 11876. [2025-03-03 17:36:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11876 states, 11875 states have (on average 1.463242105263158) internal successors, (17376), 11875 states have internal predecessors, (17376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11876 states to 11876 states and 17376 transitions. [2025-03-03 17:36:14,176 INFO L78 Accepts]: Start accepts. Automaton has 11876 states and 17376 transitions. Word has length 273 [2025-03-03 17:36:14,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:14,176 INFO L471 AbstractCegarLoop]: Abstraction has 11876 states and 17376 transitions. [2025-03-03 17:36:14,177 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-03-03 17:36:14,177 INFO L276 IsEmpty]: Start isEmpty. Operand 11876 states and 17376 transitions. [2025-03-03 17:36:14,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-03 17:36:14,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:14,183 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-03-03 17:36:14,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 17:36:14,183 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:14,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:14,183 INFO L85 PathProgramCache]: Analyzing trace with hash -2137652103, now seen corresponding path program 1 times [2025-03-03 17:36:14,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:14,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313298328] [2025-03-03 17:36:14,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:14,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:14,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-03 17:36:14,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-03 17:36:14,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:14,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:15,066 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:15,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:15,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313298328] [2025-03-03 17:36:15,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313298328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:15,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:15,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:36:15,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113121511] [2025-03-03 17:36:15,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:15,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:36:15,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:15,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:36:15,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:15,067 INFO L87 Difference]: Start difference. First operand 11876 states and 17376 transitions. Second operand has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 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-03-03 17:36:15,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:15,297 INFO L93 Difference]: Finished difference Result 15638 states and 22866 transitions. [2025-03-03 17:36:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:36:15,298 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 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-03-03 17:36:15,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:15,308 INFO L225 Difference]: With dead ends: 15638 [2025-03-03 17:36:15,308 INFO L226 Difference]: Without dead ends: 11906 [2025-03-03 17:36:15,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:15,312 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 500 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 2898 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.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:15,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 2898 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:36:15,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11906 states. [2025-03-03 17:36:15,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11906 to 11906. [2025-03-03 17:36:15,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11906 states, 11905 states have (on average 1.4625787484250314) internal successors, (17412), 11905 states have internal predecessors, (17412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:15,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11906 states to 11906 states and 17412 transitions. [2025-03-03 17:36:15,410 INFO L78 Accepts]: Start accepts. Automaton has 11906 states and 17412 transitions. Word has length 273 [2025-03-03 17:36:15,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:15,410 INFO L471 AbstractCegarLoop]: Abstraction has 11906 states and 17412 transitions. [2025-03-03 17:36:15,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 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-03-03 17:36:15,410 INFO L276 IsEmpty]: Start isEmpty. Operand 11906 states and 17412 transitions. [2025-03-03 17:36:15,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-03 17:36:15,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:15,417 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-03-03 17:36:15,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 17:36:15,417 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:15,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:15,418 INFO L85 PathProgramCache]: Analyzing trace with hash 746038125, now seen corresponding path program 1 times [2025-03-03 17:36:15,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:15,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923402135] [2025-03-03 17:36:15,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:15,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:15,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-03 17:36:15,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-03 17:36:15,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:15,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:15,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:15,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923402135] [2025-03-03 17:36:15,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923402135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:15,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:15,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:36:15,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865890123] [2025-03-03 17:36:15,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:15,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:36:15,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:15,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:36:15,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:36:15,690 INFO L87 Difference]: Start difference. First operand 11906 states and 17412 transitions. Second operand has 4 states, 4 states have (on average 68.25) 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-03-03 17:36:15,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:15,841 INFO L93 Difference]: Finished difference Result 20826 states and 30450 transitions. [2025-03-03 17:36:15,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:36:15,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.25) 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-03-03 17:36:15,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:15,852 INFO L225 Difference]: With dead ends: 20826 [2025-03-03 17:36:15,852 INFO L226 Difference]: Without dead ends: 12066 [2025-03-03 17:36:15,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:36:15,860 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 0 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1772 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-03-03 17:36:15,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1772 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:15,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12066 states. [2025-03-03 17:36:15,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12066 to 12066. [2025-03-03 17:36:15,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12066 states, 12065 states have (on average 1.4564442602569416) internal successors, (17572), 12065 states have internal predecessors, (17572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:15,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12066 states to 12066 states and 17572 transitions. [2025-03-03 17:36:15,944 INFO L78 Accepts]: Start accepts. Automaton has 12066 states and 17572 transitions. Word has length 273 [2025-03-03 17:36:15,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:15,944 INFO L471 AbstractCegarLoop]: Abstraction has 12066 states and 17572 transitions. [2025-03-03 17:36:15,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.25) 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-03-03 17:36:15,945 INFO L276 IsEmpty]: Start isEmpty. Operand 12066 states and 17572 transitions. [2025-03-03 17:36:15,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-03 17:36:15,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:15,952 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-03-03 17:36:15,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 17:36:15,952 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:15,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:15,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1769148417, now seen corresponding path program 1 times [2025-03-03 17:36:15,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:15,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761400669] [2025-03-03 17:36:15,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:15,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:15,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-03 17:36:16,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-03 17:36:16,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:16,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:16,418 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:16,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:16,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761400669] [2025-03-03 17:36:16,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761400669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:16,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:16,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:16,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515009109] [2025-03-03 17:36:16,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:16,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:16,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:16,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:16,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:16,419 INFO L87 Difference]: Start difference. First operand 12066 states and 17572 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-03-03 17:36:16,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:16,589 INFO L93 Difference]: Finished difference Result 21946 states and 32018 transitions. [2025-03-03 17:36:16,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:36:16,589 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-03-03 17:36:16,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:16,602 INFO L225 Difference]: With dead ends: 21946 [2025-03-03 17:36:16,602 INFO L226 Difference]: Without dead ends: 12114 [2025-03-03 17:36:16,610 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-03-03 17:36:16,611 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 0 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:16,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1768 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:16,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12114 states. [2025-03-03 17:36:16,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12114 to 12114. [2025-03-03 17:36:16,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12114 states, 12113 states have (on average 1.4546355155617932) internal successors, (17620), 12113 states have internal predecessors, (17620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:16,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12114 states to 12114 states and 17620 transitions. [2025-03-03 17:36:16,746 INFO L78 Accepts]: Start accepts. Automaton has 12114 states and 17620 transitions. Word has length 273 [2025-03-03 17:36:16,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:16,746 INFO L471 AbstractCegarLoop]: Abstraction has 12114 states and 17620 transitions. [2025-03-03 17:36:16,746 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-03-03 17:36:16,746 INFO L276 IsEmpty]: Start isEmpty. Operand 12114 states and 17620 transitions. [2025-03-03 17:36:16,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-03 17:36:16,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:16,756 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-03-03 17:36:16,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 17:36:16,756 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:16,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:16,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1856476966, now seen corresponding path program 1 times [2025-03-03 17:36:16,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:16,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081820586] [2025-03-03 17:36:16,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:16,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:16,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-03 17:36:16,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-03 17:36:16,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:16,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:17,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:17,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081820586] [2025-03-03 17:36:17,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081820586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:17,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:17,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:17,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276231427] [2025-03-03 17:36:17,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:17,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:17,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:17,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:17,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:17,099 INFO L87 Difference]: Start difference. First operand 12114 states and 17620 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-03-03 17:36:17,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:17,301 INFO L93 Difference]: Finished difference Result 23182 states and 33784 transitions. [2025-03-03 17:36:17,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:17,302 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-03-03 17:36:17,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:17,314 INFO L225 Difference]: With dead ends: 23182 [2025-03-03 17:36:17,314 INFO L226 Difference]: Without dead ends: 13158 [2025-03-03 17:36:17,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:17,322 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 116 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 2358 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-03-03 17:36:17,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 2358 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:36:17,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13158 states. [2025-03-03 17:36:17,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13158 to 13158. [2025-03-03 17:36:17,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13158 states, 13157 states have (on average 1.4536748498897925) internal successors, (19126), 13157 states have internal predecessors, (19126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:17,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13158 states to 13158 states and 19126 transitions. [2025-03-03 17:36:17,418 INFO L78 Accepts]: Start accepts. Automaton has 13158 states and 19126 transitions. Word has length 273 [2025-03-03 17:36:17,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:17,418 INFO L471 AbstractCegarLoop]: Abstraction has 13158 states and 19126 transitions. [2025-03-03 17:36:17,418 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-03-03 17:36:17,418 INFO L276 IsEmpty]: Start isEmpty. Operand 13158 states and 19126 transitions. [2025-03-03 17:36:17,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-03 17:36:17,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:17,426 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-03-03 17:36:17,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 17:36:17,427 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:17,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:17,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1624067797, now seen corresponding path program 1 times [2025-03-03 17:36:17,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:17,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775492906] [2025-03-03 17:36:17,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:17,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:17,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 17:36:17,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 17:36:17,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:17,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:17,720 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:17,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:17,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775492906] [2025-03-03 17:36:17,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775492906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:17,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:17,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:17,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604823230] [2025-03-03 17:36:17,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:17,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:17,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:17,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:17,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:17,721 INFO L87 Difference]: Start difference. First operand 13158 states and 19126 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-03-03 17:36:17,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:17,910 INFO L93 Difference]: Finished difference Result 24702 states and 35928 transitions. [2025-03-03 17:36:17,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:36:17,911 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-03-03 17:36:17,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:17,920 INFO L225 Difference]: With dead ends: 24702 [2025-03-03 17:36:17,921 INFO L226 Difference]: Without dead ends: 13206 [2025-03-03 17:36:17,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:17,929 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 0 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2359 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.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:17,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2359 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:17,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13206 states. [2025-03-03 17:36:18,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13206 to 13206. [2025-03-03 17:36:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13206 states, 13205 states have (on average 1.4520257478227945) internal successors, (19174), 13205 states have internal predecessors, (19174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13206 states to 13206 states and 19174 transitions. [2025-03-03 17:36:18,030 INFO L78 Accepts]: Start accepts. Automaton has 13206 states and 19174 transitions. Word has length 274 [2025-03-03 17:36:18,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:18,030 INFO L471 AbstractCegarLoop]: Abstraction has 13206 states and 19174 transitions. [2025-03-03 17:36:18,030 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-03-03 17:36:18,030 INFO L276 IsEmpty]: Start isEmpty. Operand 13206 states and 19174 transitions. [2025-03-03 17:36:18,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-03 17:36:18,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:18,038 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-03-03 17:36:18,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-03 17:36:18,038 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:18,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:18,039 INFO L85 PathProgramCache]: Analyzing trace with hash 984511768, now seen corresponding path program 1 times [2025-03-03 17:36:18,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:18,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439551040] [2025-03-03 17:36:18,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:18,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:18,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 17:36:18,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 17:36:18,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:18,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:18,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:18,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439551040] [2025-03-03 17:36:18,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439551040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:18,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:18,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:18,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818474276] [2025-03-03 17:36:18,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:18,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:18,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:18,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:18,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:18,292 INFO L87 Difference]: Start difference. First operand 13206 states and 19174 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-03-03 17:36:18,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:18,481 INFO L93 Difference]: Finished difference Result 24582 states and 35704 transitions. [2025-03-03 17:36:18,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:18,482 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-03-03 17:36:18,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:18,497 INFO L225 Difference]: With dead ends: 24582 [2025-03-03 17:36:18,497 INFO L226 Difference]: Without dead ends: 19166 [2025-03-03 17:36:18,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:18,505 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 82 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 2359 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.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:18,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 2359 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:18,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19166 states. [2025-03-03 17:36:18,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19166 to 19166. [2025-03-03 17:36:18,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19166 states, 19165 states have (on average 1.4504565614401252) internal successors, (27798), 19165 states have internal predecessors, (27798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:18,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19166 states to 19166 states and 27798 transitions. [2025-03-03 17:36:18,671 INFO L78 Accepts]: Start accepts. Automaton has 19166 states and 27798 transitions. Word has length 274 [2025-03-03 17:36:18,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:18,671 INFO L471 AbstractCegarLoop]: Abstraction has 19166 states and 27798 transitions. [2025-03-03 17:36:18,671 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-03-03 17:36:18,672 INFO L276 IsEmpty]: Start isEmpty. Operand 19166 states and 27798 transitions. [2025-03-03 17:36:18,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-03 17:36:18,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:18,684 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-03-03 17:36:18,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-03 17:36:18,684 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:18,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:18,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1545448420, now seen corresponding path program 1 times [2025-03-03 17:36:18,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:18,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722228731] [2025-03-03 17:36:18,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:18,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:18,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 17:36:18,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 17:36:18,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:18,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:19,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:19,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722228731] [2025-03-03 17:36:19,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722228731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:19,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:19,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:19,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177925672] [2025-03-03 17:36:19,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:19,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:19,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:19,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:19,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:19,106 INFO L87 Difference]: Start difference. First operand 19166 states and 27798 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-03-03 17:36:19,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:19,316 INFO L93 Difference]: Finished difference Result 24710 states and 35850 transitions. [2025-03-03 17:36:19,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:19,317 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-03-03 17:36:19,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:19,333 INFO L225 Difference]: With dead ends: 24710 [2025-03-03 17:36:19,333 INFO L226 Difference]: Without dead ends: 19154 [2025-03-03 17:36:19,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:19,341 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 86 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 2359 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-03-03 17:36:19,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 2359 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:36:19,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19154 states. [2025-03-03 17:36:19,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19154 to 19154. [2025-03-03 17:36:19,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19154 states, 19153 states have (on average 1.450112253954994) internal successors, (27774), 19153 states have internal predecessors, (27774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19154 states to 19154 states and 27774 transitions. [2025-03-03 17:36:19,477 INFO L78 Accepts]: Start accepts. Automaton has 19154 states and 27774 transitions. Word has length 274 [2025-03-03 17:36:19,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:19,477 INFO L471 AbstractCegarLoop]: Abstraction has 19154 states and 27774 transitions. [2025-03-03 17:36:19,477 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-03-03 17:36:19,477 INFO L276 IsEmpty]: Start isEmpty. Operand 19154 states and 27774 transitions. [2025-03-03 17:36:19,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-03 17:36:19,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:19,489 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, 1] [2025-03-03 17:36:19,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-03 17:36:19,489 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:19,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:19,489 INFO L85 PathProgramCache]: Analyzing trace with hash -630039160, now seen corresponding path program 1 times [2025-03-03 17:36:19,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:19,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033132568] [2025-03-03 17:36:19,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:19,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:19,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 17:36:19,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 17:36:19,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:19,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:20,051 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:20,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:20,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033132568] [2025-03-03 17:36:20,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033132568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:20,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:20,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:36:20,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626356755] [2025-03-03 17:36:20,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:20,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:36:20,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:20,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:36:20,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:36:20,053 INFO L87 Difference]: Start difference. First operand 19154 states and 27774 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-03-03 17:36:20,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:20,378 INFO L93 Difference]: Finished difference Result 24637 states and 35739 transitions. [2025-03-03 17:36:20,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:36:20,379 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-03-03 17:36:20,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:20,394 INFO L225 Difference]: With dead ends: 24637 [2025-03-03 17:36:20,394 INFO L226 Difference]: Without dead ends: 19192 [2025-03-03 17:36:20,401 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-03-03 17:36:20,401 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 94 mSDsluCounter, 3632 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 4244 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.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:20,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 4244 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:36:20,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19192 states. [2025-03-03 17:36:20,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19192 to 19148. [2025-03-03 17:36:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19148 states, 19147 states have (on average 1.4500966208805557) internal successors, (27765), 19147 states have internal predecessors, (27765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:20,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19148 states to 19148 states and 27765 transitions. [2025-03-03 17:36:20,535 INFO L78 Accepts]: Start accepts. Automaton has 19148 states and 27765 transitions. Word has length 274 [2025-03-03 17:36:20,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:20,536 INFO L471 AbstractCegarLoop]: Abstraction has 19148 states and 27765 transitions. [2025-03-03 17:36:20,536 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-03-03 17:36:20,536 INFO L276 IsEmpty]: Start isEmpty. Operand 19148 states and 27765 transitions. [2025-03-03 17:36:20,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-03 17:36:20,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:20,548 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-03-03 17:36:20,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-03 17:36:20,548 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:20,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:20,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1551161162, now seen corresponding path program 1 times [2025-03-03 17:36:20,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:20,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937519063] [2025-03-03 17:36:20,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:20,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:20,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 17:36:21,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 17:36:21,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:21,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:21,846 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:21,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:21,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937519063] [2025-03-03 17:36:21,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937519063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:21,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:21,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:36:21,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426365338] [2025-03-03 17:36:21,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:21,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:36:21,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:21,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:36:21,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:21,847 INFO L87 Difference]: Start difference. First operand 19148 states and 27765 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-03-03 17:36:22,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:22,235 INFO L93 Difference]: Finished difference Result 24603 states and 35696 transitions. [2025-03-03 17:36:22,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:36:22,235 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-03-03 17:36:22,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:22,249 INFO L225 Difference]: With dead ends: 24603 [2025-03-03 17:36:22,249 INFO L226 Difference]: Without dead ends: 19164 [2025-03-03 17:36:22,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:22,257 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 464 mSDsluCounter, 2030 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 2539 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.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:22,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 2539 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:36:22,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19164 states. [2025-03-03 17:36:22,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19164 to 19160. [2025-03-03 17:36:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19160 states, 19159 states have (on average 1.450023487655932) internal successors, (27781), 19159 states have internal predecessors, (27781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:22,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19160 states to 19160 states and 27781 transitions. [2025-03-03 17:36:22,395 INFO L78 Accepts]: Start accepts. Automaton has 19160 states and 27781 transitions. Word has length 274 [2025-03-03 17:36:22,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:22,395 INFO L471 AbstractCegarLoop]: Abstraction has 19160 states and 27781 transitions. [2025-03-03 17:36:22,395 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-03-03 17:36:22,396 INFO L276 IsEmpty]: Start isEmpty. Operand 19160 states and 27781 transitions. [2025-03-03 17:36:22,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-03 17:36:22,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:22,408 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-03-03 17:36:22,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-03 17:36:22,408 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:22,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:22,409 INFO L85 PathProgramCache]: Analyzing trace with hash 645142144, now seen corresponding path program 1 times [2025-03-03 17:36:22,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:22,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51903876] [2025-03-03 17:36:22,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:22,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:22,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 17:36:22,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 17:36:22,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:22,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:22,900 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:22,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:22,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51903876] [2025-03-03 17:36:22,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51903876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:22,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:22,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:36:22,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722876867] [2025-03-03 17:36:22,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:22,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:36:22,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:22,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:36:22,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:22,901 INFO L87 Difference]: Start difference. First operand 19160 states and 27781 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-03-03 17:36:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:23,151 INFO L93 Difference]: Finished difference Result 24986 states and 36216 transitions. [2025-03-03 17:36:23,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:36:23,151 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-03-03 17:36:23,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:23,168 INFO L225 Difference]: With dead ends: 24986 [2025-03-03 17:36:23,168 INFO L226 Difference]: Without dead ends: 19525 [2025-03-03 17:36:23,176 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-03-03 17:36:23,176 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 48 mSDsluCounter, 2349 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2939 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.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:23,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2939 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:36:23,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19525 states. [2025-03-03 17:36:23,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19525 to 19483. [2025-03-03 17:36:23,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19483 states, 19482 states have (on average 1.4483625911097424) internal successors, (28217), 19482 states have internal predecessors, (28217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:23,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19483 states to 19483 states and 28217 transitions. [2025-03-03 17:36:23,327 INFO L78 Accepts]: Start accepts. Automaton has 19483 states and 28217 transitions. Word has length 274 [2025-03-03 17:36:23,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:23,327 INFO L471 AbstractCegarLoop]: Abstraction has 19483 states and 28217 transitions. [2025-03-03 17:36:23,327 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-03-03 17:36:23,327 INFO L276 IsEmpty]: Start isEmpty. Operand 19483 states and 28217 transitions. [2025-03-03 17:36:23,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-03 17:36:23,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:23,339 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-03-03 17:36:23,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-03 17:36:23,339 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:23,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:23,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2020747433, now seen corresponding path program 1 times [2025-03-03 17:36:23,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:23,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438042868] [2025-03-03 17:36:23,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:23,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:23,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 17:36:23,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 17:36:23,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:23,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:23,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:23,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438042868] [2025-03-03 17:36:23,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438042868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:23,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:23,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:23,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103241181] [2025-03-03 17:36:23,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:23,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:23,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:23,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:23,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:23,775 INFO L87 Difference]: Start difference. First operand 19483 states and 28217 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-03-03 17:36:24,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:24,023 INFO L93 Difference]: Finished difference Result 25173 states and 36462 transitions. [2025-03-03 17:36:24,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:24,023 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-03-03 17:36:24,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:24,039 INFO L225 Difference]: With dead ends: 25173 [2025-03-03 17:36:24,039 INFO L226 Difference]: Without dead ends: 19405 [2025-03-03 17:36:24,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03-03 17:36:24,046 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 499 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 1562 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-03-03 17:36:24,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 1562 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:36:24,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19405 states. [2025-03-03 17:36:24,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19405 to 19405. [2025-03-03 17:36:24,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19405 states, 19404 states have (on average 1.4484126984126984) internal successors, (28105), 19404 states have internal predecessors, (28105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19405 states to 19405 states and 28105 transitions. [2025-03-03 17:36:24,187 INFO L78 Accepts]: Start accepts. Automaton has 19405 states and 28105 transitions. Word has length 274 [2025-03-03 17:36:24,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:24,188 INFO L471 AbstractCegarLoop]: Abstraction has 19405 states and 28105 transitions. [2025-03-03 17:36:24,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-03-03 17:36:24,188 INFO L276 IsEmpty]: Start isEmpty. Operand 19405 states and 28105 transitions. [2025-03-03 17:36:24,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-03 17:36:24,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:24,200 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-03-03 17:36:24,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-03 17:36:24,200 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:24,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:24,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1987696285, now seen corresponding path program 1 times [2025-03-03 17:36:24,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:24,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737940291] [2025-03-03 17:36:24,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:24,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:24,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 17:36:24,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 17:36:24,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:24,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:24,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:24,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737940291] [2025-03-03 17:36:24,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737940291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:24,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:24,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:24,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906115283] [2025-03-03 17:36:24,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:24,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:24,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:24,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:24,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:24,489 INFO L87 Difference]: Start difference. First operand 19405 states and 28105 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-03-03 17:36:24,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:24,677 INFO L93 Difference]: Finished difference Result 26724 states and 38654 transitions. [2025-03-03 17:36:24,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:24,677 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-03-03 17:36:24,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:24,694 INFO L225 Difference]: With dead ends: 26724 [2025-03-03 17:36:24,694 INFO L226 Difference]: Without dead ends: 19765 [2025-03-03 17:36:24,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:24,702 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 4 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2359 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.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:24,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2359 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19765 states. [2025-03-03 17:36:24,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19765 to 19765. [2025-03-03 17:36:24,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19765 states, 19764 states have (on average 1.4438878769479861) internal successors, (28537), 19764 states have internal predecessors, (28537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:24,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19765 states to 19765 states and 28537 transitions. [2025-03-03 17:36:24,843 INFO L78 Accepts]: Start accepts. Automaton has 19765 states and 28537 transitions. Word has length 274 [2025-03-03 17:36:24,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:24,843 INFO L471 AbstractCegarLoop]: Abstraction has 19765 states and 28537 transitions. [2025-03-03 17:36:24,843 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-03-03 17:36:24,843 INFO L276 IsEmpty]: Start isEmpty. Operand 19765 states and 28537 transitions. [2025-03-03 17:36:24,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-03 17:36:24,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:24,856 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-03-03 17:36:24,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-03 17:36:24,856 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:24,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:24,856 INFO L85 PathProgramCache]: Analyzing trace with hash -532927061, now seen corresponding path program 1 times [2025-03-03 17:36:24,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:24,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440323100] [2025-03-03 17:36:24,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:24,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:24,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 17:36:24,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 17:36:24,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:24,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:25,138 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:25,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:25,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440323100] [2025-03-03 17:36:25,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440323100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:25,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:25,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:36:25,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145617272] [2025-03-03 17:36:25,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:25,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:36:25,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:25,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:36:25,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:25,139 INFO L87 Difference]: Start difference. First operand 19765 states and 28537 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-03-03 17:36:25,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:25,389 INFO L93 Difference]: Finished difference Result 38500 states and 55722 transitions. [2025-03-03 17:36:25,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:25,390 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-03-03 17:36:25,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:25,412 INFO L225 Difference]: With dead ends: 38500 [2025-03-03 17:36:25,412 INFO L226 Difference]: Without dead ends: 22877 [2025-03-03 17:36:25,425 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-03-03 17:36:25,426 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 55 mSDsluCounter, 2353 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 2945 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.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:25,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 2945 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:36:25,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22877 states. [2025-03-03 17:36:25,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22877 to 22877. [2025-03-03 17:36:25,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22877 states, 22876 states have (on average 1.4424287462843155) internal successors, (32997), 22876 states have internal predecessors, (32997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:25,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22877 states to 22877 states and 32997 transitions. [2025-03-03 17:36:25,611 INFO L78 Accepts]: Start accepts. Automaton has 22877 states and 32997 transitions. Word has length 274 [2025-03-03 17:36:25,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:25,611 INFO L471 AbstractCegarLoop]: Abstraction has 22877 states and 32997 transitions. [2025-03-03 17:36:25,612 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-03-03 17:36:25,612 INFO L276 IsEmpty]: Start isEmpty. Operand 22877 states and 32997 transitions. [2025-03-03 17:36:25,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-03 17:36:25,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:25,627 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-03-03 17:36:25,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-03 17:36:25,627 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:25,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:25,627 INFO L85 PathProgramCache]: Analyzing trace with hash -2099115618, now seen corresponding path program 1 times [2025-03-03 17:36:25,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:25,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697248191] [2025-03-03 17:36:25,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:25,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:25,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 17:36:25,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 17:36:25,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:25,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:25,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:25,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697248191] [2025-03-03 17:36:25,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697248191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:25,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:25,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:25,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23571945] [2025-03-03 17:36:25,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:25,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:25,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:25,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:25,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:25,995 INFO L87 Difference]: Start difference. First operand 22877 states and 32997 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-03-03 17:36:26,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:26,242 INFO L93 Difference]: Finished difference Result 36604 states and 52798 transitions. [2025-03-03 17:36:26,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:36:26,242 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-03-03 17:36:26,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:26,264 INFO L225 Difference]: With dead ends: 36604 [2025-03-03 17:36:26,264 INFO L226 Difference]: Without dead ends: 23037 [2025-03-03 17:36:26,277 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-03-03 17:36:26,277 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 0 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2287 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.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:26,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2287 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:36:26,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23037 states. [2025-03-03 17:36:26,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23037 to 23037. [2025-03-03 17:36:26,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23037 states, 23036 states have (on average 1.4393557909359265) internal successors, (33157), 23036 states have internal predecessors, (33157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:26,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23037 states to 23037 states and 33157 transitions. [2025-03-03 17:36:26,451 INFO L78 Accepts]: Start accepts. Automaton has 23037 states and 33157 transitions. Word has length 274 [2025-03-03 17:36:26,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:26,452 INFO L471 AbstractCegarLoop]: Abstraction has 23037 states and 33157 transitions. [2025-03-03 17:36:26,452 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-03-03 17:36:26,452 INFO L276 IsEmpty]: Start isEmpty. Operand 23037 states and 33157 transitions. [2025-03-03 17:36:26,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-03 17:36:26,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:26,466 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-03-03 17:36:26,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-03 17:36:26,466 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:26,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:26,467 INFO L85 PathProgramCache]: Analyzing trace with hash -531954735, now seen corresponding path program 1 times [2025-03-03 17:36:26,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:26,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656864578] [2025-03-03 17:36:26,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:26,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:26,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 17:36:26,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 17:36:26,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:26,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:26,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:26,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656864578] [2025-03-03 17:36:26,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656864578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:26,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:26,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:36:26,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628478108] [2025-03-03 17:36:26,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:26,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:36:26,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:27,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:36:27,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:36:27,000 INFO L87 Difference]: Start difference. First operand 23037 states and 33157 transitions. Second operand has 9 states, 9 states have (on average 30.444444444444443) internal successors, (274), 9 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-03-03 17:36:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:27,378 INFO L93 Difference]: Finished difference Result 42188 states and 60958 transitions. [2025-03-03 17:36:27,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:36:27,378 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 30.444444444444443) internal successors, (274), 9 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-03-03 17:36:27,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:27,404 INFO L225 Difference]: With dead ends: 42188 [2025-03-03 17:36:27,404 INFO L226 Difference]: Without dead ends: 26733 [2025-03-03 17:36:27,421 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-03-03 17:36:27,421 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 45 mSDsluCounter, 4058 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4641 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-03-03 17:36:27,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4641 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:36:27,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26733 states. [2025-03-03 17:36:27,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26733 to 26493. [2025-03-03 17:36:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26493 states, 26492 states have (on average 1.4382077608334591) internal successors, (38101), 26492 states have internal predecessors, (38101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:27,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26493 states to 26493 states and 38101 transitions. [2025-03-03 17:36:27,756 INFO L78 Accepts]: Start accepts. Automaton has 26493 states and 38101 transitions. Word has length 274 [2025-03-03 17:36:27,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:27,756 INFO L471 AbstractCegarLoop]: Abstraction has 26493 states and 38101 transitions. [2025-03-03 17:36:27,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.444444444444443) internal successors, (274), 9 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-03-03 17:36:27,756 INFO L276 IsEmpty]: Start isEmpty. Operand 26493 states and 38101 transitions. [2025-03-03 17:36:27,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-03 17:36:27,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:27,779 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-03-03 17:36:27,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-03 17:36:27,780 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:27,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:27,780 INFO L85 PathProgramCache]: Analyzing trace with hash 805705113, now seen corresponding path program 1 times [2025-03-03 17:36:27,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:27,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751054627] [2025-03-03 17:36:27,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:27,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:27,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 17:36:28,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 17:36:28,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:28,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:28,467 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:28,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:28,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751054627] [2025-03-03 17:36:28,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751054627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:28,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:28,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:36:28,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381706226] [2025-03-03 17:36:28,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:28,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:36:28,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:28,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:36:28,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:28,468 INFO L87 Difference]: Start difference. First operand 26493 states and 38101 transitions. Second operand has 7 states, 7 states have (on average 39.285714285714285) internal successors, (275), 7 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-03-03 17:36:28,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:28,853 INFO L93 Difference]: Finished difference Result 49036 states and 70518 transitions. [2025-03-03 17:36:28,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:36:28,853 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.285714285714285) internal successors, (275), 7 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-03-03 17:36:28,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:28,879 INFO L225 Difference]: With dead ends: 49036 [2025-03-03 17:36:28,879 INFO L226 Difference]: Without dead ends: 26733 [2025-03-03 17:36:28,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:28,898 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 600 mSDsluCounter, 2065 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 2585 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:28,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 2585 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:36:28,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26733 states. [2025-03-03 17:36:29,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26733 to 26733. [2025-03-03 17:36:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26733 states, 26732 states have (on average 1.434273529851863) internal successors, (38341), 26732 states have internal predecessors, (38341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:29,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26733 states to 26733 states and 38341 transitions. [2025-03-03 17:36:29,110 INFO L78 Accepts]: Start accepts. Automaton has 26733 states and 38341 transitions. Word has length 275 [2025-03-03 17:36:29,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:29,110 INFO L471 AbstractCegarLoop]: Abstraction has 26733 states and 38341 transitions. [2025-03-03 17:36:29,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.285714285714285) internal successors, (275), 7 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-03-03 17:36:29,110 INFO L276 IsEmpty]: Start isEmpty. Operand 26733 states and 38341 transitions. [2025-03-03 17:36:29,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-03 17:36:29,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:29,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, 1, 1, 1, 1] [2025-03-03 17:36:29,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-03 17:36:29,127 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:29,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:29,127 INFO L85 PathProgramCache]: Analyzing trace with hash 848498247, now seen corresponding path program 1 times [2025-03-03 17:36:29,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:29,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089554824] [2025-03-03 17:36:29,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:29,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:29,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 17:36:29,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 17:36:29,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:29,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:29,729 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:29,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:29,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089554824] [2025-03-03 17:36:29,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089554824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:29,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:29,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:36:29,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783962675] [2025-03-03 17:36:29,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:29,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:36:29,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:29,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:36:29,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:36:29,731 INFO L87 Difference]: Start difference. First operand 26733 states and 38341 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-03-03 17:36:30,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:30,058 INFO L93 Difference]: Finished difference Result 34214 states and 49076 transitions. [2025-03-03 17:36:30,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:36:30,058 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-03-03 17:36:30,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:30,084 INFO L225 Difference]: With dead ends: 34214 [2025-03-03 17:36:30,084 INFO L226 Difference]: Without dead ends: 26781 [2025-03-03 17:36:30,095 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-03-03 17:36:30,096 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 2 mSDsluCounter, 3494 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4079 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.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:30,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4079 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:36:30,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26781 states. [2025-03-03 17:36:30,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26781 to 26781. [2025-03-03 17:36:30,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26781 states, 26780 states have (on average 1.4339432412247946) internal successors, (38401), 26780 states have internal predecessors, (38401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26781 states to 26781 states and 38401 transitions. [2025-03-03 17:36:30,319 INFO L78 Accepts]: Start accepts. Automaton has 26781 states and 38401 transitions. Word has length 275 [2025-03-03 17:36:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:30,319 INFO L471 AbstractCegarLoop]: Abstraction has 26781 states and 38401 transitions. [2025-03-03 17:36:30,319 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-03-03 17:36:30,319 INFO L276 IsEmpty]: Start isEmpty. Operand 26781 states and 38401 transitions. [2025-03-03 17:36:30,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-03 17:36:30,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:30,336 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-03-03 17:36:30,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-03 17:36:30,336 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:30,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:30,336 INFO L85 PathProgramCache]: Analyzing trace with hash 2134071722, now seen corresponding path program 1 times [2025-03-03 17:36:30,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:30,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224815717] [2025-03-03 17:36:30,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:30,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:30,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 17:36:30,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 17:36:30,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:30,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:30,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:30,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224815717] [2025-03-03 17:36:30,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224815717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:30,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:30,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:36:30,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650133627] [2025-03-03 17:36:30,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:30,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:36:30,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:30,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:36:30,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:30,827 INFO L87 Difference]: Start difference. First operand 26781 states and 38401 transitions. Second operand has 7 states, 7 states have (on average 39.285714285714285) internal successors, (275), 7 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-03-03 17:36:31,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:31,136 INFO L93 Difference]: Finished difference Result 34086 states and 48893 transitions. [2025-03-03 17:36:31,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:36:31,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.285714285714285) internal successors, (275), 7 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-03-03 17:36:31,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:31,164 INFO L225 Difference]: With dead ends: 34086 [2025-03-03 17:36:31,164 INFO L226 Difference]: Without dead ends: 26827 [2025-03-03 17:36:31,177 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-03-03 17:36:31,177 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 35 mSDsluCounter, 2949 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3543 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.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:31,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3543 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:36:31,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26827 states. [2025-03-03 17:36:31,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26827 to 26827. [2025-03-03 17:36:31,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26827 states, 26826 states have (on average 1.4337955714605233) internal successors, (38463), 26826 states have internal predecessors, (38463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:31,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26827 states to 26827 states and 38463 transitions. [2025-03-03 17:36:31,415 INFO L78 Accepts]: Start accepts. Automaton has 26827 states and 38463 transitions. Word has length 275 [2025-03-03 17:36:31,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:31,415 INFO L471 AbstractCegarLoop]: Abstraction has 26827 states and 38463 transitions. [2025-03-03 17:36:31,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.285714285714285) internal successors, (275), 7 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-03-03 17:36:31,415 INFO L276 IsEmpty]: Start isEmpty. Operand 26827 states and 38463 transitions. [2025-03-03 17:36:31,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-03 17:36:31,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:31,432 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-03-03 17:36:31,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-03 17:36:31,432 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:31,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:31,433 INFO L85 PathProgramCache]: Analyzing trace with hash 353204638, now seen corresponding path program 1 times [2025-03-03 17:36:31,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:31,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468829143] [2025-03-03 17:36:31,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:31,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:31,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 17:36:31,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 17:36:31,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:31,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:31,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:31,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468829143] [2025-03-03 17:36:31,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468829143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:31,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:31,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:36:31,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282443172] [2025-03-03 17:36:31,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:31,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:36:31,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:31,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:36:31,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:31,797 INFO L87 Difference]: Start difference. First operand 26827 states and 38463 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-03-03 17:36:32,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:32,011 INFO L93 Difference]: Finished difference Result 42376 states and 60994 transitions. [2025-03-03 17:36:32,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:32,011 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-03-03 17:36:32,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:32,043 INFO L225 Difference]: With dead ends: 42376 [2025-03-03 17:36:32,043 INFO L226 Difference]: Without dead ends: 33323 [2025-03-03 17:36:32,058 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-03-03 17:36:32,058 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 46 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 2358 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.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:32,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 2358 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:32,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33323 states. [2025-03-03 17:36:32,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33323 to 33323. [2025-03-03 17:36:32,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33323 states, 33322 states have (on average 1.4385391032951202) internal successors, (47935), 33322 states have internal predecessors, (47935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:32,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33323 states to 33323 states and 47935 transitions. [2025-03-03 17:36:32,337 INFO L78 Accepts]: Start accepts. Automaton has 33323 states and 47935 transitions. Word has length 275 [2025-03-03 17:36:32,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:32,337 INFO L471 AbstractCegarLoop]: Abstraction has 33323 states and 47935 transitions. [2025-03-03 17:36:32,337 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-03-03 17:36:32,337 INFO L276 IsEmpty]: Start isEmpty. Operand 33323 states and 47935 transitions. [2025-03-03 17:36:32,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-03 17:36:32,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:32,360 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-03-03 17:36:32,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-03 17:36:32,360 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:32,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:32,360 INFO L85 PathProgramCache]: Analyzing trace with hash -684734428, now seen corresponding path program 1 times [2025-03-03 17:36:32,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:32,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170101252] [2025-03-03 17:36:32,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:32,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:32,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 17:36:32,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 17:36:32,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:32,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:32,633 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:32,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:32,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170101252] [2025-03-03 17:36:32,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170101252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:32,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:32,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:32,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324535555] [2025-03-03 17:36:32,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:32,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:32,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:32,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:32,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:32,634 INFO L87 Difference]: Start difference. First operand 33323 states and 47935 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-03-03 17:36:32,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:32,885 INFO L93 Difference]: Finished difference Result 55736 states and 80162 transitions. [2025-03-03 17:36:32,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:32,886 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-03-03 17:36:32,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:32,923 INFO L225 Difference]: With dead ends: 55736 [2025-03-03 17:36:32,924 INFO L226 Difference]: Without dead ends: 36683 [2025-03-03 17:36:32,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:32,945 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 16 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2358 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.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:32,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2358 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:32,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36683 states. [2025-03-03 17:36:33,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36683 to 36683. [2025-03-03 17:36:33,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36683 states, 36682 states have (on average 1.4310833651382149) internal successors, (52495), 36682 states have internal predecessors, (52495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36683 states to 36683 states and 52495 transitions. [2025-03-03 17:36:33,238 INFO L78 Accepts]: Start accepts. Automaton has 36683 states and 52495 transitions. Word has length 275 [2025-03-03 17:36:33,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:33,238 INFO L471 AbstractCegarLoop]: Abstraction has 36683 states and 52495 transitions. [2025-03-03 17:36:33,238 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-03-03 17:36:33,238 INFO L276 IsEmpty]: Start isEmpty. Operand 36683 states and 52495 transitions. [2025-03-03 17:36:33,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-03 17:36:33,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:33,263 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-03-03 17:36:33,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-03 17:36:33,263 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:33,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:33,264 INFO L85 PathProgramCache]: Analyzing trace with hash 711854330, now seen corresponding path program 1 times [2025-03-03 17:36:33,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:33,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485293776] [2025-03-03 17:36:33,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:33,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:33,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 17:36:33,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 17:36:33,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:33,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:33,642 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:33,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:33,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485293776] [2025-03-03 17:36:33,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485293776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:33,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:33,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:33,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713402192] [2025-03-03 17:36:33,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:33,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:33,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:33,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:33,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:33,643 INFO L87 Difference]: Start difference. First operand 36683 states and 52495 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-03-03 17:36:33,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:33,883 INFO L93 Difference]: Finished difference Result 71736 states and 102658 transitions. [2025-03-03 17:36:33,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:36:33,883 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-03-03 17:36:33,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:33,923 INFO L225 Difference]: With dead ends: 71736 [2025-03-03 17:36:33,924 INFO L226 Difference]: Without dead ends: 36779 [2025-03-03 17:36:33,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:33,955 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 0 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1771 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.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:33,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1771 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:33,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36779 states. [2025-03-03 17:36:34,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36779 to 36779. [2025-03-03 17:36:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36779 states, 36778 states have (on average 1.4299581271412258) internal successors, (52591), 36778 states have internal predecessors, (52591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:34,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36779 states to 36779 states and 52591 transitions. [2025-03-03 17:36:34,284 INFO L78 Accepts]: Start accepts. Automaton has 36779 states and 52591 transitions. Word has length 275 [2025-03-03 17:36:34,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:34,284 INFO L471 AbstractCegarLoop]: Abstraction has 36779 states and 52591 transitions. [2025-03-03 17:36:34,284 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-03-03 17:36:34,284 INFO L276 IsEmpty]: Start isEmpty. Operand 36779 states and 52591 transitions. [2025-03-03 17:36:34,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-03 17:36:34,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:34,309 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-03-03 17:36:34,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-03 17:36:34,309 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:34,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:34,310 INFO L85 PathProgramCache]: Analyzing trace with hash 463547398, now seen corresponding path program 1 times [2025-03-03 17:36:34,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:34,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460363234] [2025-03-03 17:36:34,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:34,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:34,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 17:36:34,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 17:36:34,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:34,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:35,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:35,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460363234] [2025-03-03 17:36:35,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460363234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:35,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:35,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:36:35,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438928016] [2025-03-03 17:36:35,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:35,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:36:35,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:35,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:36:35,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:35,712 INFO L87 Difference]: Start difference. First operand 36779 states and 52591 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-03-03 17:36:36,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:36,074 INFO L93 Difference]: Finished difference Result 67048 states and 96026 transitions. [2025-03-03 17:36:36,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:36:36,075 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-03-03 17:36:36,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:36,111 INFO L225 Difference]: With dead ends: 67048 [2025-03-03 17:36:36,111 INFO L226 Difference]: Without dead ends: 36779 [2025-03-03 17:36:36,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:36,135 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 146 mSDsluCounter, 2322 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 2906 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:36,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 2906 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:36:36,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36779 states. [2025-03-03 17:36:36,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36779 to 36779. [2025-03-03 17:36:36,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36779 states, 36778 states have (on average 1.4295230844526619) internal successors, (52575), 36778 states have internal predecessors, (52575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:36,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36779 states to 36779 states and 52575 transitions. [2025-03-03 17:36:36,508 INFO L78 Accepts]: Start accepts. Automaton has 36779 states and 52575 transitions. Word has length 275 [2025-03-03 17:36:36,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:36,508 INFO L471 AbstractCegarLoop]: Abstraction has 36779 states and 52575 transitions. [2025-03-03 17:36:36,508 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-03-03 17:36:36,509 INFO L276 IsEmpty]: Start isEmpty. Operand 36779 states and 52575 transitions. [2025-03-03 17:36:36,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-03 17:36:36,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:36,533 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-03-03 17:36:36,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-03 17:36:36,533 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:36,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:36,534 INFO L85 PathProgramCache]: Analyzing trace with hash -612554777, now seen corresponding path program 1 times [2025-03-03 17:36:36,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:36,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742469029] [2025-03-03 17:36:36,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:36,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:36,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 17:36:36,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 17:36:36,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:36,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:37,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:37,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742469029] [2025-03-03 17:36:37,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742469029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:37,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:37,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:37,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270914068] [2025-03-03 17:36:37,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:37,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:37,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:37,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:37,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:37,125 INFO L87 Difference]: Start difference. First operand 36779 states and 52575 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-03-03 17:36:37,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:37,493 INFO L93 Difference]: Finished difference Result 72844 states and 104128 transitions. [2025-03-03 17:36:37,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:37,493 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-03-03 17:36:37,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:37,529 INFO L225 Difference]: With dead ends: 72844 [2025-03-03 17:36:37,529 INFO L226 Difference]: Without dead ends: 36779 [2025-03-03 17:36:37,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:37,556 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 17 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2126 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-03-03 17:36:37,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2126 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:36:37,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36779 states. [2025-03-03 17:36:37,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36779 to 36779. [2025-03-03 17:36:37,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36779 states, 36778 states have (on average 1.4294958942846268) internal successors, (52574), 36778 states have internal predecessors, (52574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:37,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36779 states to 36779 states and 52574 transitions. [2025-03-03 17:36:37,858 INFO L78 Accepts]: Start accepts. Automaton has 36779 states and 52574 transitions. Word has length 275 [2025-03-03 17:36:37,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:37,858 INFO L471 AbstractCegarLoop]: Abstraction has 36779 states and 52574 transitions. [2025-03-03 17:36:37,858 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-03-03 17:36:37,858 INFO L276 IsEmpty]: Start isEmpty. Operand 36779 states and 52574 transitions. [2025-03-03 17:36:37,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-03 17:36:37,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:37,883 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, 1] [2025-03-03 17:36:37,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-03 17:36:37,883 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:37,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:37,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1756211398, now seen corresponding path program 1 times [2025-03-03 17:36:37,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:37,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092994036] [2025-03-03 17:36:37,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:37,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:37,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-03 17:36:38,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-03 17:36:38,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:38,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat