./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FourbyFour.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FourbyFour.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 76759b02095285d07c750df63dcdc9c02e70d9a0344831d30f8bf2a90bed45af --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:53:39,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:53:39,427 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 21:53:39,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:53:39,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:53:39,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:53:39,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:53:39,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:53:39,452 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:53:39,452 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:53:39,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:53:39,452 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:53:39,452 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:53:39,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:53:39,453 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:53:39,453 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:53:39,453 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:53:39,453 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 21:53:39,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:53:39,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:53:39,453 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:53:39,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:53:39,453 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:53:39,453 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:53:39,453 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:53:39,454 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:53:39,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:53:39,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:53:39,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:53:39,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:53:39,454 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:53:39,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:53:39,454 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:53:39,454 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:53:39,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 21:53:39,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 21:53:39,455 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:53:39,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:53:39,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:53:39,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:53:39,455 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 -> 76759b02095285d07c750df63dcdc9c02e70d9a0344831d30f8bf2a90bed45af [2025-03-16 21:53:39,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:53:39,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:53:39,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:53:39,680 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:53:39,680 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:53:39,681 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_FourbyFour.c [2025-03-16 21:53:40,799 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/023a27e5d/74370920c08848459235b3ecf6ae9ee1/FLAG21b722d30 [2025-03-16 21:53:41,095 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:53:41,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FourbyFour.c [2025-03-16 21:53:41,112 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/023a27e5d/74370920c08848459235b3ecf6ae9ee1/FLAG21b722d30 [2025-03-16 21:53:41,368 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/023a27e5d/74370920c08848459235b3ecf6ae9ee1 [2025-03-16 21:53:41,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:53:41,371 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:53:41,372 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:53:41,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:53:41,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:53:41,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:53:41" (1/1) ... [2025-03-16 21:53:41,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e64344f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:53:41, skipping insertion in model container [2025-03-16 21:53:41,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:53:41" (1/1) ... [2025-03-16 21:53:41,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:53:41,556 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_FourbyFour.c[1252,1265] [2025-03-16 21:53:41,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:53:41,855 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:53:41,863 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_FourbyFour.c[1252,1265] [2025-03-16 21:53:41,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:53:42,002 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:53:42,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:53:42 WrapperNode [2025-03-16 21:53:42,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:53:42,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:53:42,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:53:42,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:53:42,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:53:42" (1/1) ... [2025-03-16 21:53:42,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:53:42" (1/1) ... [2025-03-16 21:53:42,331 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4219 [2025-03-16 21:53:42,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:53:42,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:53:42,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:53:42,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:53:42,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:53:42" (1/1) ... [2025-03-16 21:53:42,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:53:42" (1/1) ... [2025-03-16 21:53:42,390 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:53:42" (1/1) ... [2025-03-16 21:53:42,561 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 21:53:42,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:53:42" (1/1) ... [2025-03-16 21:53:42,564 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:53:42" (1/1) ... [2025-03-16 21:53:42,673 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:53:42" (1/1) ... [2025-03-16 21:53:42,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:53:42" (1/1) ... [2025-03-16 21:53:42,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:53:42" (1/1) ... [2025-03-16 21:53:42,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:53:42" (1/1) ... [2025-03-16 21:53:42,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:53:42,825 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:53:42,828 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:53:42,828 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:53:42,829 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:53:42" (1/1) ... [2025-03-16 21:53:42,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:53:42,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:53:42,875 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 21:53:42,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 21:53:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:53:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 21:53:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:53:42,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:53:43,193 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:53:43,195 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:53:45,892 INFO L? ?]: Removed 2710 outVars from TransFormulas that were not future-live. [2025-03-16 21:53:45,892 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:53:45,992 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:53:45,993 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:53:45,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:53:45 BoogieIcfgContainer [2025-03-16 21:53:45,993 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:53:45,995 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:53:45,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:53:46,002 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:53:46,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:53:41" (1/3) ... [2025-03-16 21:53:46,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e9737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:53:46, skipping insertion in model container [2025-03-16 21:53:46,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:53:42" (2/3) ... [2025-03-16 21:53:46,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e9737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:53:46, skipping insertion in model container [2025-03-16 21:53:46,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:53:45" (3/3) ... [2025-03-16 21:53:46,003 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_FourbyFour.c [2025-03-16 21:53:46,014 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:53:46,015 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_FourbyFour.c that has 1 procedures, 1127 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:53:46,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:53:46,082 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;@43dfc577, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:53:46,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:53:46,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 1127 states, 1125 states have (on average 1.503111111111111) internal successors, (1691), 1126 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:53:46,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-16 21:53:46,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:53:46,105 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:53:46,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:53:46,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:53:46,110 INFO L85 PathProgramCache]: Analyzing trace with hash -2042024062, now seen corresponding path program 1 times [2025-03-16 21:53:46,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:53:46,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769310679] [2025-03-16 21:53:46,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:53:46,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:53:46,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-16 21:53:46,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-16 21:53:46,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:53:46,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:53:47,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:53:47,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:53:47,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769310679] [2025-03-16 21:53:47,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769310679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:53:47,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:53:47,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:53:47,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756464333] [2025-03-16 21:53:47,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:53:47,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:53:47,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:53:47,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:53:47,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:53:47,647 INFO L87 Difference]: Start difference. First operand has 1127 states, 1125 states have (on average 1.503111111111111) internal successors, (1691), 1126 states have internal predecessors, (1691), 0 states have call successors, (0), 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 54.5) internal successors, (218), 4 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:53:48,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:53:48,230 INFO L93 Difference]: Finished difference Result 2213 states and 3323 transitions. [2025-03-16 21:53:48,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:53:48,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 0 states have call successors, (0), 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 218 [2025-03-16 21:53:48,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:53:48,250 INFO L225 Difference]: With dead ends: 2213 [2025-03-16 21:53:48,251 INFO L226 Difference]: Without dead ends: 1127 [2025-03-16 21:53:48,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:53:48,260 INFO L435 NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 2811 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4219 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:53:48,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4219 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:53:48,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2025-03-16 21:53:48,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1127. [2025-03-16 21:53:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 1126 states have (on average 1.5008880994671403) internal successors, (1690), 1126 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:53:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1690 transitions. [2025-03-16 21:53:48,339 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1690 transitions. Word has length 218 [2025-03-16 21:53:48,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:53:48,341 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1690 transitions. [2025-03-16 21:53:48,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:53:48,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1690 transitions. [2025-03-16 21:53:48,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-16 21:53:48,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:53:48,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:53:48,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 21:53:48,348 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:53:48,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:53:48,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1126443858, now seen corresponding path program 1 times [2025-03-16 21:53:48,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:53:48,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194584386] [2025-03-16 21:53:48,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:53:48,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:53:48,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-16 21:53:48,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-16 21:53:48,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:53:48,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:53:48,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:53:48,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:53:48,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194584386] [2025-03-16 21:53:48,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194584386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:53:48,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:53:48,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:53:48,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650462126] [2025-03-16 21:53:48,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:53:48,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:53:48,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:53:48,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:53:48,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:53:48,939 INFO L87 Difference]: Start difference. First operand 1127 states and 1690 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:53:49,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:53:49,408 INFO L93 Difference]: Finished difference Result 2215 states and 3322 transitions. [2025-03-16 21:53:49,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:53:49,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 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 219 [2025-03-16 21:53:49,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:53:49,412 INFO L225 Difference]: With dead ends: 2215 [2025-03-16 21:53:49,412 INFO L226 Difference]: Without dead ends: 1129 [2025-03-16 21:53:49,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:53:49,414 INFO L435 NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4216 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:53:49,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4216 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:53:49,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2025-03-16 21:53:49,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129. [2025-03-16 21:53:49,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 1128 states have (on average 1.5) internal successors, (1692), 1128 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:53:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1692 transitions. [2025-03-16 21:53:49,443 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1692 transitions. Word has length 219 [2025-03-16 21:53:49,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:53:49,443 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1692 transitions. [2025-03-16 21:53:49,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:53:49,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1692 transitions. [2025-03-16 21:53:49,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-16 21:53:49,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:53:49,448 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:53:49,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 21:53:49,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:53:49,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:53:49,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1803435651, now seen corresponding path program 1 times [2025-03-16 21:53:49,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:53:49,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607895012] [2025-03-16 21:53:49,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:53:49,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:53:49,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-16 21:53:49,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-16 21:53:49,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:53:49,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:53:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:53:50,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:53:50,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607895012] [2025-03-16 21:53:50,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607895012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:53:50,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:53:50,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:53:50,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977895634] [2025-03-16 21:53:50,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:53:50,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:53:50,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:53:50,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:53:50,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:53:50,681 INFO L87 Difference]: Start difference. First operand 1129 states and 1692 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:53:51,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:53:51,184 INFO L93 Difference]: Finished difference Result 2217 states and 3323 transitions. [2025-03-16 21:53:51,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:53:51,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 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 220 [2025-03-16 21:53:51,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:53:51,189 INFO L225 Difference]: With dead ends: 2217 [2025-03-16 21:53:51,189 INFO L226 Difference]: Without dead ends: 1129 [2025-03-16 21:53:51,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:53:51,194 INFO L435 NwaCegarLoop]: 1405 mSDtfsCounter, 272 mSDsluCounter, 2472 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 3877 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:53:51,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 3877 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:53:51,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2025-03-16 21:53:51,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129. [2025-03-16 21:53:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 1128 states have (on average 1.499113475177305) internal successors, (1691), 1128 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:53:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1691 transitions. [2025-03-16 21:53:51,225 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1691 transitions. Word has length 220 [2025-03-16 21:53:51,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:53:51,225 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1691 transitions. [2025-03-16 21:53:51,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:53:51,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1691 transitions. [2025-03-16 21:53:51,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-16 21:53:51,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:53:51,228 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:53:51,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 21:53:51,228 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:53:51,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:53:51,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1816433367, now seen corresponding path program 1 times [2025-03-16 21:53:51,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:53:51,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680902703] [2025-03-16 21:53:51,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:53:51,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:53:51,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-16 21:53:51,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-16 21:53:51,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:53:51,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:53:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:53:52,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:53:52,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680902703] [2025-03-16 21:53:52,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680902703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:53:52,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:53:52,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:53:52,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805350238] [2025-03-16 21:53:52,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:53:52,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:53:52,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:53:52,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:53:52,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:53:52,600 INFO L87 Difference]: Start difference. First operand 1129 states and 1691 transitions. Second operand has 8 states, 8 states have (on average 27.625) internal successors, (221), 7 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:53:53,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:53:53,552 INFO L93 Difference]: Finished difference Result 2486 states and 3727 transitions. [2025-03-16 21:53:53,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:53:53,553 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 27.625) internal successors, (221), 7 states have internal predecessors, (221), 0 states have call successors, (0), 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 221 [2025-03-16 21:53:53,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:53:53,557 INFO L225 Difference]: With dead ends: 2486 [2025-03-16 21:53:53,557 INFO L226 Difference]: Without dead ends: 1398 [2025-03-16 21:53:53,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-16 21:53:53,559 INFO L435 NwaCegarLoop]: 1398 mSDtfsCounter, 2282 mSDsluCounter, 6977 mSDsCounter, 0 mSdLazyCounter, 1746 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2282 SdHoareTripleChecker+Valid, 8375 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 21:53:53,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2282 Valid, 8375 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1746 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 21:53:53,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2025-03-16 21:53:53,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1397. [2025-03-16 21:53:53,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 1396 states have (on average 1.5007163323782235) internal successors, (2095), 1396 states have internal predecessors, (2095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:53:53,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 2095 transitions. [2025-03-16 21:53:53,588 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 2095 transitions. Word has length 221 [2025-03-16 21:53:53,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:53:53,589 INFO L471 AbstractCegarLoop]: Abstraction has 1397 states and 2095 transitions. [2025-03-16 21:53:53,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.625) internal successors, (221), 7 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:53:53,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2095 transitions. [2025-03-16 21:53:53,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-16 21:53:53,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:53:53,592 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:53:53,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 21:53:53,592 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:53:53,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:53:53,593 INFO L85 PathProgramCache]: Analyzing trace with hash 81074646, now seen corresponding path program 1 times [2025-03-16 21:53:53,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:53:53,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969624622] [2025-03-16 21:53:53,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:53:53,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:53:53,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-16 21:53:53,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-16 21:53:53,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:53:53,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:53:55,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:53:55,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:53:55,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969624622] [2025-03-16 21:53:55,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969624622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:53:55,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:53:55,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 21:53:55,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405492299] [2025-03-16 21:53:55,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:53:55,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 21:53:55,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:53:55,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 21:53:55,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:53:55,400 INFO L87 Difference]: Start difference. First operand 1397 states and 2095 transitions. Second operand has 9 states, 9 states have (on average 24.666666666666668) internal successors, (222), 8 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:53:56,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:53:56,371 INFO L93 Difference]: Finished difference Result 2758 states and 4136 transitions. [2025-03-16 21:53:56,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:53:56,372 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 24.666666666666668) internal successors, (222), 8 states have internal predecessors, (222), 0 states have call successors, (0), 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 222 [2025-03-16 21:53:56,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:53:56,377 INFO L225 Difference]: With dead ends: 2758 [2025-03-16 21:53:56,377 INFO L226 Difference]: Without dead ends: 1402 [2025-03-16 21:53:56,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-16 21:53:56,380 INFO L435 NwaCegarLoop]: 1395 mSDtfsCounter, 2286 mSDsluCounter, 6964 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2286 SdHoareTripleChecker+Valid, 8359 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 21:53:56,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2286 Valid, 8359 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 21:53:56,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2025-03-16 21:53:56,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1401. [2025-03-16 21:53:56,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1400 states have (on average 1.5) internal successors, (2100), 1400 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:53:56,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2100 transitions. [2025-03-16 21:53:56,426 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2100 transitions. Word has length 222 [2025-03-16 21:53:56,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:53:56,427 INFO L471 AbstractCegarLoop]: Abstraction has 1401 states and 2100 transitions. [2025-03-16 21:53:56,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.666666666666668) internal successors, (222), 8 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:53:56,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2100 transitions. [2025-03-16 21:53:56,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-16 21:53:56,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:53:56,429 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:53:56,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 21:53:56,429 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:53:56,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:53:56,431 INFO L85 PathProgramCache]: Analyzing trace with hash -279598742, now seen corresponding path program 1 times [2025-03-16 21:53:56,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:53:56,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164052712] [2025-03-16 21:53:56,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:53:56,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:53:56,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-16 21:53:56,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-16 21:53:56,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:53:56,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:53:56,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:53:56,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:53:56,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164052712] [2025-03-16 21:53:56,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164052712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:53:56,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:53:56,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:53:56,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564532217] [2025-03-16 21:53:56,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:53:56,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:53:56,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:53:56,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:53:56,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:53:56,819 INFO L87 Difference]: Start difference. First operand 1401 states and 2100 transitions. Second operand has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:53:57,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:53:57,245 INFO L93 Difference]: Finished difference Result 2763 states and 4142 transitions. [2025-03-16 21:53:57,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:53:57,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 0 states have call successors, (0), 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 222 [2025-03-16 21:53:57,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:53:57,250 INFO L225 Difference]: With dead ends: 2763 [2025-03-16 21:53:57,250 INFO L226 Difference]: Without dead ends: 1403 [2025-03-16 21:53:57,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:53:57,253 INFO L435 NwaCegarLoop]: 1407 mSDtfsCounter, 0 mSDsluCounter, 2806 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4213 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:53:57,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4213 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:53:57,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2025-03-16 21:53:57,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1403. [2025-03-16 21:53:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1403 states, 1402 states have (on average 1.4992867332382311) internal successors, (2102), 1402 states have internal predecessors, (2102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:53:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 2102 transitions. [2025-03-16 21:53:57,276 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 2102 transitions. Word has length 222 [2025-03-16 21:53:57,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:53:57,277 INFO L471 AbstractCegarLoop]: Abstraction has 1403 states and 2102 transitions. [2025-03-16 21:53:57,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:53:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 2102 transitions. [2025-03-16 21:53:57,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-16 21:53:57,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:53:57,279 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:53:57,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 21:53:57,280 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:53:57,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:53:57,280 INFO L85 PathProgramCache]: Analyzing trace with hash 437176220, now seen corresponding path program 1 times [2025-03-16 21:53:57,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:53:57,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315067532] [2025-03-16 21:53:57,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:53:57,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:53:57,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-16 21:53:57,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-16 21:53:57,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:53:57,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:53:57,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:53:57,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:53:57,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315067532] [2025-03-16 21:53:57,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315067532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:53:57,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:53:57,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:53:57,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222577024] [2025-03-16 21:53:57,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:53:57,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:53:57,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:53:57,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:53:57,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:53:57,708 INFO L87 Difference]: Start difference. First operand 1403 states and 2102 transitions. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:53:58,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:53:58,266 INFO L93 Difference]: Finished difference Result 2767 states and 4146 transitions. [2025-03-16 21:53:58,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:53:58,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 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 223 [2025-03-16 21:53:58,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:53:58,271 INFO L225 Difference]: With dead ends: 2767 [2025-03-16 21:53:58,271 INFO L226 Difference]: Without dead ends: 1405 [2025-03-16 21:53:58,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:53:58,273 INFO L435 NwaCegarLoop]: 1407 mSDtfsCounter, 0 mSDsluCounter, 4208 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5615 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:53:58,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5615 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:53:58,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2025-03-16 21:53:58,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1405. [2025-03-16 21:53:58,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1404 states have (on average 1.4985754985754987) internal successors, (2104), 1404 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:53:58,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 2104 transitions. [2025-03-16 21:53:58,297 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 2104 transitions. Word has length 223 [2025-03-16 21:53:58,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:53:58,297 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 2104 transitions. [2025-03-16 21:53:58,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:53:58,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 2104 transitions. [2025-03-16 21:53:58,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-16 21:53:58,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:53:58,300 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:53:58,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 21:53:58,300 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:53:58,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:53:58,301 INFO L85 PathProgramCache]: Analyzing trace with hash -369966312, now seen corresponding path program 1 times [2025-03-16 21:53:58,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:53:58,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114915919] [2025-03-16 21:53:58,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:53:58,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:53:58,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-16 21:53:58,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-16 21:53:58,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:53:58,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:53:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:53:59,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:53:59,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114915919] [2025-03-16 21:53:59,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114915919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:53:59,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:53:59,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:53:59,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124411023] [2025-03-16 21:53:59,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:53:59,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:53:59,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:53:59,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:53:59,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:53:59,590 INFO L87 Difference]: Start difference. First operand 1405 states and 2104 transitions. Second operand has 7 states, 7 states have (on average 31.857142857142858) internal successors, (223), 6 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:00,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:00,372 INFO L93 Difference]: Finished difference Result 2803 states and 4197 transitions. [2025-03-16 21:54:00,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:54:00,373 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 31.857142857142858) internal successors, (223), 6 states have internal predecessors, (223), 0 states have call successors, (0), 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 223 [2025-03-16 21:54:00,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:00,377 INFO L225 Difference]: With dead ends: 2803 [2025-03-16 21:54:00,377 INFO L226 Difference]: Without dead ends: 1439 [2025-03-16 21:54:00,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:54:00,379 INFO L435 NwaCegarLoop]: 1380 mSDtfsCounter, 1591 mSDsluCounter, 5508 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1591 SdHoareTripleChecker+Valid, 6888 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:00,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1591 Valid, 6888 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 21:54:00,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2025-03-16 21:54:00,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1429. [2025-03-16 21:54:00,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1429 states, 1428 states have (on average 1.4971988795518207) internal successors, (2138), 1428 states have internal predecessors, (2138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 2138 transitions. [2025-03-16 21:54:00,399 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 2138 transitions. Word has length 223 [2025-03-16 21:54:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:00,399 INFO L471 AbstractCegarLoop]: Abstraction has 1429 states and 2138 transitions. [2025-03-16 21:54:00,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 31.857142857142858) internal successors, (223), 6 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:00,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 2138 transitions. [2025-03-16 21:54:00,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-16 21:54:00,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:00,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:00,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 21:54:00,402 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:00,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:00,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1461542193, now seen corresponding path program 1 times [2025-03-16 21:54:00,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:00,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084983607] [2025-03-16 21:54:00,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:00,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:00,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-16 21:54:00,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-16 21:54:00,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:00,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:00,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:00,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:00,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084983607] [2025-03-16 21:54:00,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084983607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:00,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:00,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:00,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356765458] [2025-03-16 21:54:00,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:00,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:00,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:00,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:00,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:00,727 INFO L87 Difference]: Start difference. First operand 1429 states and 2138 transitions. Second operand has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:01,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:01,283 INFO L93 Difference]: Finished difference Result 2821 states and 4221 transitions. [2025-03-16 21:54:01,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:01,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 0 states have call successors, (0), 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 224 [2025-03-16 21:54:01,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:01,287 INFO L225 Difference]: With dead ends: 2821 [2025-03-16 21:54:01,288 INFO L226 Difference]: Without dead ends: 1433 [2025-03-16 21:54:01,289 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-16 21:54:01,290 INFO L435 NwaCegarLoop]: 1407 mSDtfsCounter, 0 mSDsluCounter, 4148 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5555 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:01,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5555 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:54:01,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2025-03-16 21:54:01,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1433. [2025-03-16 21:54:01,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1432 states have (on average 1.4958100558659218) internal successors, (2142), 1432 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:01,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2142 transitions. [2025-03-16 21:54:01,311 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2142 transitions. Word has length 224 [2025-03-16 21:54:01,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:01,311 INFO L471 AbstractCegarLoop]: Abstraction has 1433 states and 2142 transitions. [2025-03-16 21:54:01,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:01,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2142 transitions. [2025-03-16 21:54:01,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-16 21:54:01,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:01,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:01,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 21:54:01,314 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:01,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:01,314 INFO L85 PathProgramCache]: Analyzing trace with hash -545686843, now seen corresponding path program 1 times [2025-03-16 21:54:01,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:01,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676170945] [2025-03-16 21:54:01,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:01,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:01,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-16 21:54:01,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-16 21:54:01,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:01,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:01,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:01,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:01,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676170945] [2025-03-16 21:54:01,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676170945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:01,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:01,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 21:54:01,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947124793] [2025-03-16 21:54:01,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:01,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:54:01,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:01,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:54:01,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:54:01,812 INFO L87 Difference]: Start difference. First operand 1433 states and 2142 transitions. Second operand has 8 states, 8 states have (on average 28.0) internal successors, (224), 8 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:02,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:02,671 INFO L93 Difference]: Finished difference Result 2895 states and 4329 transitions. [2025-03-16 21:54:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:54:02,671 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 28.0) internal successors, (224), 8 states have internal predecessors, (224), 0 states have call successors, (0), 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 224 [2025-03-16 21:54:02,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:02,675 INFO L225 Difference]: With dead ends: 2895 [2025-03-16 21:54:02,675 INFO L226 Difference]: Without dead ends: 1503 [2025-03-16 21:54:02,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-16 21:54:02,678 INFO L435 NwaCegarLoop]: 1397 mSDtfsCounter, 35 mSDsluCounter, 8363 mSDsCounter, 0 mSdLazyCounter, 2043 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 9760 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:02,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 9760 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2043 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 21:54:02,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2025-03-16 21:54:02,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1499. [2025-03-16 21:54:02,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 1498 states have (on average 1.493991989319092) internal successors, (2238), 1498 states have internal predecessors, (2238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:02,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 2238 transitions. [2025-03-16 21:54:02,699 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 2238 transitions. Word has length 224 [2025-03-16 21:54:02,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:02,699 INFO L471 AbstractCegarLoop]: Abstraction has 1499 states and 2238 transitions. [2025-03-16 21:54:02,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.0) internal successors, (224), 8 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:02,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 2238 transitions. [2025-03-16 21:54:02,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-16 21:54:02,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:02,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:02,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 21:54:02,702 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:02,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:02,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1274816384, now seen corresponding path program 1 times [2025-03-16 21:54:02,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:02,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018946121] [2025-03-16 21:54:02,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:02,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:02,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-16 21:54:02,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-16 21:54:02,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:02,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:03,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:03,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:03,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018946121] [2025-03-16 21:54:03,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018946121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:03,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:03,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:03,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702939381] [2025-03-16 21:54:03,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:03,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:03,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:03,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:03,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:03,044 INFO L87 Difference]: Start difference. First operand 1499 states and 2238 transitions. Second operand has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:03,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:03,431 INFO L93 Difference]: Finished difference Result 2965 states and 4427 transitions. [2025-03-16 21:54:03,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:03,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 0 states have call successors, (0), 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 224 [2025-03-16 21:54:03,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:03,435 INFO L225 Difference]: With dead ends: 2965 [2025-03-16 21:54:03,435 INFO L226 Difference]: Without dead ends: 1507 [2025-03-16 21:54:03,436 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-16 21:54:03,437 INFO L435 NwaCegarLoop]: 1407 mSDtfsCounter, 0 mSDsluCounter, 2806 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4213 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:03,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4213 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:54:03,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2025-03-16 21:54:03,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2025-03-16 21:54:03,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1506 states have (on average 1.4913678618857902) internal successors, (2246), 1506 states have internal predecessors, (2246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:03,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 2246 transitions. [2025-03-16 21:54:03,455 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 2246 transitions. Word has length 224 [2025-03-16 21:54:03,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:03,455 INFO L471 AbstractCegarLoop]: Abstraction has 1507 states and 2246 transitions. [2025-03-16 21:54:03,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:03,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2246 transitions. [2025-03-16 21:54:03,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-16 21:54:03,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:03,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:03,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 21:54:03,457 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:03,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:03,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1511905923, now seen corresponding path program 1 times [2025-03-16 21:54:03,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:03,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256046891] [2025-03-16 21:54:03,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:03,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:03,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-16 21:54:03,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-16 21:54:03,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:03,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:03,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:03,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256046891] [2025-03-16 21:54:03,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256046891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:03,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:03,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:03,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464656042] [2025-03-16 21:54:03,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:03,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:03,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:03,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:03,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:03,956 INFO L87 Difference]: Start difference. First operand 1507 states and 2246 transitions. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:04,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:04,425 INFO L93 Difference]: Finished difference Result 2989 states and 4455 transitions. [2025-03-16 21:54:04,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:04,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2025-03-16 21:54:04,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:04,429 INFO L225 Difference]: With dead ends: 2989 [2025-03-16 21:54:04,429 INFO L226 Difference]: Without dead ends: 1523 [2025-03-16 21:54:04,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:04,431 INFO L435 NwaCegarLoop]: 1386 mSDtfsCounter, 1558 mSDsluCounter, 2766 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 4152 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:04,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 4152 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:54:04,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2025-03-16 21:54:04,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1519. [2025-03-16 21:54:04,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1518 states have (on average 1.4901185770750989) internal successors, (2262), 1518 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 2262 transitions. [2025-03-16 21:54:04,447 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 2262 transitions. Word has length 225 [2025-03-16 21:54:04,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:04,447 INFO L471 AbstractCegarLoop]: Abstraction has 1519 states and 2262 transitions. [2025-03-16 21:54:04,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:04,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 2262 transitions. [2025-03-16 21:54:04,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-16 21:54:04,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:04,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:04,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 21:54:04,450 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:04,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:04,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1142118873, now seen corresponding path program 1 times [2025-03-16 21:54:04,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:04,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749145174] [2025-03-16 21:54:04,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:04,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:04,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-16 21:54:04,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-16 21:54:04,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:04,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:04,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:04,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:04,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749145174] [2025-03-16 21:54:04,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749145174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:04,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:04,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:54:04,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503785100] [2025-03-16 21:54:04,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:04,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:54:04,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:04,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:54:04,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:04,718 INFO L87 Difference]: Start difference. First operand 1519 states and 2262 transitions. Second operand has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:05,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:05,178 INFO L93 Difference]: Finished difference Result 3063 states and 4563 transitions. [2025-03-16 21:54:05,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:05,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2025-03-16 21:54:05,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:05,182 INFO L225 Difference]: With dead ends: 3063 [2025-03-16 21:54:05,182 INFO L226 Difference]: Without dead ends: 1585 [2025-03-16 21:54:05,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:05,184 INFO L435 NwaCegarLoop]: 1400 mSDtfsCounter, 33 mSDsluCounter, 5587 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 6987 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:05,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 6987 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:54:05,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2025-03-16 21:54:05,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1579. [2025-03-16 21:54:05,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1578 states have (on average 1.4892268694550064) internal successors, (2350), 1578 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:05,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2350 transitions. [2025-03-16 21:54:05,199 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2350 transitions. Word has length 225 [2025-03-16 21:54:05,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:05,200 INFO L471 AbstractCegarLoop]: Abstraction has 1579 states and 2350 transitions. [2025-03-16 21:54:05,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:05,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2350 transitions. [2025-03-16 21:54:05,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-16 21:54:05,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:05,202 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:05,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 21:54:05,203 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:05,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:05,203 INFO L85 PathProgramCache]: Analyzing trace with hash 492026946, now seen corresponding path program 1 times [2025-03-16 21:54:05,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:05,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612638785] [2025-03-16 21:54:05,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:05,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:05,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-16 21:54:05,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-16 21:54:05,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:05,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:05,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:05,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:05,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612638785] [2025-03-16 21:54:05,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612638785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:05,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:05,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:05,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333038516] [2025-03-16 21:54:05,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:05,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:05,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:05,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:05,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:05,748 INFO L87 Difference]: Start difference. First operand 1579 states and 2350 transitions. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:06,191 INFO L93 Difference]: Finished difference Result 3123 states and 4649 transitions. [2025-03-16 21:54:06,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:06,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2025-03-16 21:54:06,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:06,194 INFO L225 Difference]: With dead ends: 3123 [2025-03-16 21:54:06,194 INFO L226 Difference]: Without dead ends: 1585 [2025-03-16 21:54:06,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:06,196 INFO L435 NwaCegarLoop]: 1386 mSDtfsCounter, 1552 mSDsluCounter, 2766 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 4152 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:06,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1552 Valid, 4152 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:54:06,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2025-03-16 21:54:06,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1585. [2025-03-16 21:54:06,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1584 states have (on average 1.4886363636363635) internal successors, (2358), 1584 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:06,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2358 transitions. [2025-03-16 21:54:06,218 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2358 transitions. Word has length 225 [2025-03-16 21:54:06,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:06,218 INFO L471 AbstractCegarLoop]: Abstraction has 1585 states and 2358 transitions. [2025-03-16 21:54:06,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:06,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2358 transitions. [2025-03-16 21:54:06,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-16 21:54:06,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:06,220 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:06,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 21:54:06,220 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:06,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:06,220 INFO L85 PathProgramCache]: Analyzing trace with hash -559252515, now seen corresponding path program 1 times [2025-03-16 21:54:06,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:06,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290293580] [2025-03-16 21:54:06,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:06,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:06,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-16 21:54:06,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-16 21:54:06,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:06,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:06,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:06,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290293580] [2025-03-16 21:54:06,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290293580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:06,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:06,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:06,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010618863] [2025-03-16 21:54:06,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:06,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:06,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:06,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:06,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:06,639 INFO L87 Difference]: Start difference. First operand 1585 states and 2358 transitions. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:07,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:07,086 INFO L93 Difference]: Finished difference Result 3137 states and 4667 transitions. [2025-03-16 21:54:07,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:07,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2025-03-16 21:54:07,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:07,090 INFO L225 Difference]: With dead ends: 3137 [2025-03-16 21:54:07,090 INFO L226 Difference]: Without dead ends: 1593 [2025-03-16 21:54:07,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:07,091 INFO L435 NwaCegarLoop]: 1386 mSDtfsCounter, 1564 mSDsluCounter, 2766 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 4152 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:07,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1564 Valid, 4152 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:54:07,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2025-03-16 21:54:07,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1591. [2025-03-16 21:54:07,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1590 states have (on average 1.4880503144654087) internal successors, (2366), 1590 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:07,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2366 transitions. [2025-03-16 21:54:07,114 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2366 transitions. Word has length 225 [2025-03-16 21:54:07,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:07,115 INFO L471 AbstractCegarLoop]: Abstraction has 1591 states and 2366 transitions. [2025-03-16 21:54:07,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:07,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2366 transitions. [2025-03-16 21:54:07,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-16 21:54:07,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:07,117 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:07,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 21:54:07,117 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:07,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:07,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1146593004, now seen corresponding path program 1 times [2025-03-16 21:54:07,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:07,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438598651] [2025-03-16 21:54:07,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:07,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:07,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 21:54:07,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 21:54:07,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:07,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:07,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:07,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438598651] [2025-03-16 21:54:07,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438598651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:07,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:07,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:07,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115443310] [2025-03-16 21:54:07,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:07,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:07,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:07,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:07,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:07,409 INFO L87 Difference]: Start difference. First operand 1591 states and 2366 transitions. Second operand has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:07,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:07,954 INFO L93 Difference]: Finished difference Result 4430 states and 6583 transitions. [2025-03-16 21:54:07,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:07,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 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 226 [2025-03-16 21:54:07,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:07,960 INFO L225 Difference]: With dead ends: 4430 [2025-03-16 21:54:07,960 INFO L226 Difference]: Without dead ends: 2880 [2025-03-16 21:54:07,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:07,962 INFO L435 NwaCegarLoop]: 1393 mSDtfsCounter, 1124 mSDsluCounter, 4170 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 5563 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:07,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1124 Valid, 5563 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:54:07,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2025-03-16 21:54:07,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 1932. [2025-03-16 21:54:07,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1932 states, 1931 states have (on average 1.488865872604868) internal successors, (2875), 1931 states have internal predecessors, (2875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:07,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 2875 transitions. [2025-03-16 21:54:07,982 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 2875 transitions. Word has length 226 [2025-03-16 21:54:07,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:07,983 INFO L471 AbstractCegarLoop]: Abstraction has 1932 states and 2875 transitions. [2025-03-16 21:54:07,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:07,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2875 transitions. [2025-03-16 21:54:07,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-16 21:54:07,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:07,985 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:07,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 21:54:07,985 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:07,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:07,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1859407263, now seen corresponding path program 1 times [2025-03-16 21:54:07,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:07,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519902597] [2025-03-16 21:54:07,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:07,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:08,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 21:54:08,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 21:54:08,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:08,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:08,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:08,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:08,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519902597] [2025-03-16 21:54:08,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519902597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:08,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:08,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:08,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253724931] [2025-03-16 21:54:08,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:08,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:54:08,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:08,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:54:08,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:08,378 INFO L87 Difference]: Start difference. First operand 1932 states and 2875 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:08,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:08,730 INFO L93 Difference]: Finished difference Result 3478 states and 5176 transitions. [2025-03-16 21:54:08,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:08,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 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 226 [2025-03-16 21:54:08,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:08,734 INFO L225 Difference]: With dead ends: 3478 [2025-03-16 21:54:08,734 INFO L226 Difference]: Without dead ends: 1928 [2025-03-16 21:54:08,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:08,736 INFO L435 NwaCegarLoop]: 1407 mSDtfsCounter, 0 mSDsluCounter, 2806 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4213 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:08,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4213 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:54:08,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2025-03-16 21:54:08,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928. [2025-03-16 21:54:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1928 states, 1927 states have (on average 1.4878048780487805) internal successors, (2867), 1927 states have internal predecessors, (2867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:08,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2867 transitions. [2025-03-16 21:54:08,750 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2867 transitions. Word has length 226 [2025-03-16 21:54:08,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:08,750 INFO L471 AbstractCegarLoop]: Abstraction has 1928 states and 2867 transitions. [2025-03-16 21:54:08,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:08,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2867 transitions. [2025-03-16 21:54:08,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-16 21:54:08,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:08,752 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:08,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 21:54:08,752 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:08,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:08,753 INFO L85 PathProgramCache]: Analyzing trace with hash -415281464, now seen corresponding path program 1 times [2025-03-16 21:54:08,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:08,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518248574] [2025-03-16 21:54:08,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:08,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:08,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 21:54:08,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 21:54:08,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:08,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:09,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:09,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:09,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518248574] [2025-03-16 21:54:09,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518248574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:09,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:09,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 21:54:09,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189919756] [2025-03-16 21:54:09,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:09,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:54:09,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:09,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:54:09,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:54:09,812 INFO L87 Difference]: Start difference. First operand 1928 states and 2867 transitions. Second operand has 10 states, 10 states have (on average 22.6) internal successors, (226), 9 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:10,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:10,643 INFO L93 Difference]: Finished difference Result 3544 states and 5266 transitions. [2025-03-16 21:54:10,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 21:54:10,643 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 22.6) internal successors, (226), 9 states have internal predecessors, (226), 0 states have call successors, (0), 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 226 [2025-03-16 21:54:10,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:10,649 INFO L225 Difference]: With dead ends: 3544 [2025-03-16 21:54:10,649 INFO L226 Difference]: Without dead ends: 1998 [2025-03-16 21:54:10,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-16 21:54:10,651 INFO L435 NwaCegarLoop]: 1394 mSDtfsCounter, 1575 mSDsluCounter, 9732 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1575 SdHoareTripleChecker+Valid, 11126 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:10,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1575 Valid, 11126 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2369 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 21:54:10,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2025-03-16 21:54:10,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1986. [2025-03-16 21:54:10,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1986 states, 1985 states have (on average 1.4846347607052897) internal successors, (2947), 1985 states have internal predecessors, (2947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:10,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2947 transitions. [2025-03-16 21:54:10,668 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2947 transitions. Word has length 226 [2025-03-16 21:54:10,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:10,668 INFO L471 AbstractCegarLoop]: Abstraction has 1986 states and 2947 transitions. [2025-03-16 21:54:10,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.6) internal successors, (226), 9 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:10,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2947 transitions. [2025-03-16 21:54:10,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-16 21:54:10,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:10,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:10,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 21:54:10,670 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:10,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:10,671 INFO L85 PathProgramCache]: Analyzing trace with hash -2111207441, now seen corresponding path program 1 times [2025-03-16 21:54:10,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:10,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396661653] [2025-03-16 21:54:10,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:10,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:10,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 21:54:10,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 21:54:10,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:10,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:10,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:10,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:10,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396661653] [2025-03-16 21:54:10,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396661653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:10,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:10,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:54:10,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559689979] [2025-03-16 21:54:10,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:10,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:54:10,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:10,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:54:10,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:10,951 INFO L87 Difference]: Start difference. First operand 1986 states and 2947 transitions. Second operand has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:11,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:11,447 INFO L93 Difference]: Finished difference Result 3656 states and 5424 transitions. [2025-03-16 21:54:11,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:11,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 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 226 [2025-03-16 21:54:11,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:11,450 INFO L225 Difference]: With dead ends: 3656 [2025-03-16 21:54:11,450 INFO L226 Difference]: Without dead ends: 2052 [2025-03-16 21:54:11,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:11,452 INFO L435 NwaCegarLoop]: 1400 mSDtfsCounter, 33 mSDsluCounter, 5587 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 6987 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:11,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 6987 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:54:11,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2025-03-16 21:54:11,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 2046. [2025-03-16 21:54:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2046 states, 2045 states have (on average 1.4841075794621026) internal successors, (3035), 2045 states have internal predecessors, (3035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:11,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 3035 transitions. [2025-03-16 21:54:11,467 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 3035 transitions. Word has length 226 [2025-03-16 21:54:11,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:11,468 INFO L471 AbstractCegarLoop]: Abstraction has 2046 states and 3035 transitions. [2025-03-16 21:54:11,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:11,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 3035 transitions. [2025-03-16 21:54:11,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-16 21:54:11,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:11,470 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:11,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 21:54:11,470 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:11,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:11,471 INFO L85 PathProgramCache]: Analyzing trace with hash 654560136, now seen corresponding path program 1 times [2025-03-16 21:54:11,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:11,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279084131] [2025-03-16 21:54:11,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:11,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:11,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 21:54:11,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 21:54:11,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:11,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:12,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:12,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279084131] [2025-03-16 21:54:12,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279084131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:12,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:12,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 21:54:12,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181579854] [2025-03-16 21:54:12,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:12,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 21:54:12,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:12,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 21:54:12,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-16 21:54:12,525 INFO L87 Difference]: Start difference. First operand 2046 states and 3035 transitions. Second operand has 14 states, 14 states have (on average 16.142857142857142) internal successors, (226), 13 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:13,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:13,725 INFO L93 Difference]: Finished difference Result 3878 states and 5736 transitions. [2025-03-16 21:54:13,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 21:54:13,725 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 16.142857142857142) internal successors, (226), 13 states have internal predecessors, (226), 0 states have call successors, (0), 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 226 [2025-03-16 21:54:13,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:13,729 INFO L225 Difference]: With dead ends: 3878 [2025-03-16 21:54:13,729 INFO L226 Difference]: Without dead ends: 2198 [2025-03-16 21:54:13,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2025-03-16 21:54:13,731 INFO L435 NwaCegarLoop]: 1389 mSDtfsCounter, 1673 mSDsluCounter, 13867 mSDsCounter, 0 mSdLazyCounter, 3301 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 15256 SdHoareTripleChecker+Invalid, 3304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:13,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 15256 Invalid, 3304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3301 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 21:54:13,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2025-03-16 21:54:13,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 2192. [2025-03-16 21:54:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2192 states, 2191 states have (on average 1.4755819260611593) internal successors, (3233), 2191 states have internal predecessors, (3233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:13,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 3233 transitions. [2025-03-16 21:54:13,746 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 3233 transitions. Word has length 226 [2025-03-16 21:54:13,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:13,746 INFO L471 AbstractCegarLoop]: Abstraction has 2192 states and 3233 transitions. [2025-03-16 21:54:13,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.142857142857142) internal successors, (226), 13 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:13,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 3233 transitions. [2025-03-16 21:54:13,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-16 21:54:13,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:13,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:13,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 21:54:13,748 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:13,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:13,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1606081435, now seen corresponding path program 1 times [2025-03-16 21:54:13,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:13,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603012906] [2025-03-16 21:54:13,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:13,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:13,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 21:54:13,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 21:54:13,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:13,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:14,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:14,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:14,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603012906] [2025-03-16 21:54:14,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603012906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:14,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:14,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:14,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10027073] [2025-03-16 21:54:14,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:14,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:14,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:14,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:14,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:14,006 INFO L87 Difference]: Start difference. First operand 2192 states and 3233 transitions. Second operand has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:14,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:14,468 INFO L93 Difference]: Finished difference Result 5066 states and 7447 transitions. [2025-03-16 21:54:14,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:14,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 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 226 [2025-03-16 21:54:14,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:14,472 INFO L225 Difference]: With dead ends: 5066 [2025-03-16 21:54:14,472 INFO L226 Difference]: Without dead ends: 3272 [2025-03-16 21:54:14,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:14,474 INFO L435 NwaCegarLoop]: 1393 mSDtfsCounter, 1104 mSDsluCounter, 4170 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1104 SdHoareTripleChecker+Valid, 5563 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:14,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1104 Valid, 5563 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:54:14,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3272 states. [2025-03-16 21:54:14,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3272 to 2248. [2025-03-16 21:54:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2248 states, 2247 states have (on average 1.4690698709390297) internal successors, (3301), 2247 states have internal predecessors, (3301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 3301 transitions. [2025-03-16 21:54:14,490 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 3301 transitions. Word has length 226 [2025-03-16 21:54:14,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:14,490 INFO L471 AbstractCegarLoop]: Abstraction has 2248 states and 3301 transitions. [2025-03-16 21:54:14,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:14,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 3301 transitions. [2025-03-16 21:54:14,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-16 21:54:14,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:14,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:14,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 21:54:14,492 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:14,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:14,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1328199504, now seen corresponding path program 1 times [2025-03-16 21:54:14,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:14,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94831935] [2025-03-16 21:54:14,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:14,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:14,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 21:54:14,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 21:54:14,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:14,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:14,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:14,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94831935] [2025-03-16 21:54:14,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94831935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:14,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:14,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:14,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542050506] [2025-03-16 21:54:14,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:14,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:54:14,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:14,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:54:14,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:14,851 INFO L87 Difference]: Start difference. First operand 2248 states and 3301 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:15,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:15,202 INFO L93 Difference]: Finished difference Result 4046 states and 5948 transitions. [2025-03-16 21:54:15,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:15,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 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 226 [2025-03-16 21:54:15,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:15,208 INFO L225 Difference]: With dead ends: 4046 [2025-03-16 21:54:15,208 INFO L226 Difference]: Without dead ends: 2212 [2025-03-16 21:54:15,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:15,210 INFO L435 NwaCegarLoop]: 1407 mSDtfsCounter, 0 mSDsluCounter, 2806 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4213 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:15,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4213 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:54:15,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2212 states. [2025-03-16 21:54:15,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2212 to 2212. [2025-03-16 21:54:15,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2212 states, 2211 states have (on average 1.469470827679783) internal successors, (3249), 2211 states have internal predecessors, (3249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:15,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 2212 states and 3249 transitions. [2025-03-16 21:54:15,225 INFO L78 Accepts]: Start accepts. Automaton has 2212 states and 3249 transitions. Word has length 226 [2025-03-16 21:54:15,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:15,225 INFO L471 AbstractCegarLoop]: Abstraction has 2212 states and 3249 transitions. [2025-03-16 21:54:15,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:15,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 3249 transitions. [2025-03-16 21:54:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-16 21:54:15,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:15,227 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:15,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 21:54:15,228 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:15,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:15,229 INFO L85 PathProgramCache]: Analyzing trace with hash 824805349, now seen corresponding path program 1 times [2025-03-16 21:54:15,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:15,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111218101] [2025-03-16 21:54:15,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:15,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:15,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-16 21:54:15,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-16 21:54:15,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:15,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:15,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:15,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:15,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111218101] [2025-03-16 21:54:15,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111218101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:15,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:15,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:15,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15086661] [2025-03-16 21:54:15,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:15,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:54:15,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:15,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:54:15,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:15,692 INFO L87 Difference]: Start difference. First operand 2212 states and 3249 transitions. Second operand has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:16,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:16,090 INFO L93 Difference]: Finished difference Result 4114 states and 6036 transitions. [2025-03-16 21:54:16,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:16,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2025-03-16 21:54:16,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:16,094 INFO L225 Difference]: With dead ends: 4114 [2025-03-16 21:54:16,094 INFO L226 Difference]: Without dead ends: 2276 [2025-03-16 21:54:16,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:54:16,096 INFO L435 NwaCegarLoop]: 1401 mSDtfsCounter, 1602 mSDsluCounter, 4194 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1602 SdHoareTripleChecker+Valid, 5595 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:16,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1602 Valid, 5595 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:54:16,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2025-03-16 21:54:16,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 2276. [2025-03-16 21:54:16,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2276 states, 2275 states have (on average 1.4668131868131868) internal successors, (3337), 2275 states have internal predecessors, (3337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:16,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 3337 transitions. [2025-03-16 21:54:16,111 INFO L78 Accepts]: Start accepts. Automaton has 2276 states and 3337 transitions. Word has length 227 [2025-03-16 21:54:16,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:16,111 INFO L471 AbstractCegarLoop]: Abstraction has 2276 states and 3337 transitions. [2025-03-16 21:54:16,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:16,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 3337 transitions. [2025-03-16 21:54:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-16 21:54:16,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:16,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:16,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 21:54:16,113 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:16,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:16,114 INFO L85 PathProgramCache]: Analyzing trace with hash -861770656, now seen corresponding path program 1 times [2025-03-16 21:54:16,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:16,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836799847] [2025-03-16 21:54:16,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:16,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:16,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-16 21:54:16,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-16 21:54:16,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:16,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:16,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:16,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836799847] [2025-03-16 21:54:16,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836799847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:16,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:16,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:16,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575472185] [2025-03-16 21:54:16,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:16,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:16,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:16,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:16,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:16,387 INFO L87 Difference]: Start difference. First operand 2276 states and 3337 transitions. Second operand has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:16,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:16,692 INFO L93 Difference]: Finished difference Result 4114 states and 6040 transitions. [2025-03-16 21:54:16,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:16,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2025-03-16 21:54:16,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:16,695 INFO L225 Difference]: With dead ends: 4114 [2025-03-16 21:54:16,696 INFO L226 Difference]: Without dead ends: 2292 [2025-03-16 21:54:16,697 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-16 21:54:16,698 INFO L435 NwaCegarLoop]: 1407 mSDtfsCounter, 0 mSDsluCounter, 2806 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4213 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:16,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4213 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:54:16,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2292 states. [2025-03-16 21:54:16,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2292 to 2292. [2025-03-16 21:54:16,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2292 states, 2291 states have (on average 1.4635530336097773) internal successors, (3353), 2291 states have internal predecessors, (3353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:16,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 2292 states and 3353 transitions. [2025-03-16 21:54:16,718 INFO L78 Accepts]: Start accepts. Automaton has 2292 states and 3353 transitions. Word has length 227 [2025-03-16 21:54:16,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:16,718 INFO L471 AbstractCegarLoop]: Abstraction has 2292 states and 3353 transitions. [2025-03-16 21:54:16,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:16,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 3353 transitions. [2025-03-16 21:54:16,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-16 21:54:16,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:16,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:16,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 21:54:16,721 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:16,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:16,721 INFO L85 PathProgramCache]: Analyzing trace with hash -428436463, now seen corresponding path program 1 times [2025-03-16 21:54:16,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:16,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115627380] [2025-03-16 21:54:16,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:16,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:16,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-16 21:54:16,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-16 21:54:16,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:16,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:17,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:17,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:17,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115627380] [2025-03-16 21:54:17,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115627380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:17,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:17,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:54:17,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998785087] [2025-03-16 21:54:17,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:17,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:54:17,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:17,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:54:17,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:17,002 INFO L87 Difference]: Start difference. First operand 2292 states and 3353 transitions. Second operand has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:17,472 INFO L93 Difference]: Finished difference Result 4196 states and 6148 transitions. [2025-03-16 21:54:17,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:17,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2025-03-16 21:54:17,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:17,476 INFO L225 Difference]: With dead ends: 4196 [2025-03-16 21:54:17,476 INFO L226 Difference]: Without dead ends: 2358 [2025-03-16 21:54:17,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:17,478 INFO L435 NwaCegarLoop]: 1400 mSDtfsCounter, 33 mSDsluCounter, 5587 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 6987 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:17,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 6987 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:54:17,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2358 states. [2025-03-16 21:54:17,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2358 to 2352. [2025-03-16 21:54:17,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2352 states, 2351 states have (on average 1.4636324968098682) internal successors, (3441), 2351 states have internal predecessors, (3441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 3441 transitions. [2025-03-16 21:54:17,497 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 3441 transitions. Word has length 227 [2025-03-16 21:54:17,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:17,497 INFO L471 AbstractCegarLoop]: Abstraction has 2352 states and 3441 transitions. [2025-03-16 21:54:17,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:17,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 3441 transitions. [2025-03-16 21:54:17,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-16 21:54:17,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:17,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:17,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 21:54:17,500 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:17,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:17,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1614861078, now seen corresponding path program 1 times [2025-03-16 21:54:17,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:17,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491720142] [2025-03-16 21:54:17,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:17,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:17,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-16 21:54:17,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-16 21:54:17,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:17,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:18,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:18,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:18,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491720142] [2025-03-16 21:54:18,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491720142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:18,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:18,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-16 21:54:18,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502177765] [2025-03-16 21:54:18,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:18,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 21:54:18,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:18,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 21:54:18,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-16 21:54:18,323 INFO L87 Difference]: Start difference. First operand 2352 states and 3441 transitions. Second operand has 15 states, 15 states have (on average 15.133333333333333) internal successors, (227), 14 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:19,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:19,656 INFO L93 Difference]: Finished difference Result 4270 states and 6254 transitions. [2025-03-16 21:54:19,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 21:54:19,656 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 15.133333333333333) internal successors, (227), 14 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2025-03-16 21:54:19,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:19,658 INFO L225 Difference]: With dead ends: 4270 [2025-03-16 21:54:19,658 INFO L226 Difference]: Without dead ends: 2372 [2025-03-16 21:54:19,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-16 21:54:19,660 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 1657 mSDsluCounter, 16374 mSDsCounter, 0 mSdLazyCounter, 4182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1657 SdHoareTripleChecker+Valid, 17741 SdHoareTripleChecker+Invalid, 4184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:19,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1657 Valid, 17741 Invalid, 4184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4182 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 21:54:19,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2025-03-16 21:54:19,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 2364. [2025-03-16 21:54:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2364 states, 2363 states have (on average 1.4629707998307238) internal successors, (3457), 2363 states have internal predecessors, (3457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:19,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 3457 transitions. [2025-03-16 21:54:19,674 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 3457 transitions. Word has length 227 [2025-03-16 21:54:19,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:19,674 INFO L471 AbstractCegarLoop]: Abstraction has 2364 states and 3457 transitions. [2025-03-16 21:54:19,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 15.133333333333333) internal successors, (227), 14 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:19,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 3457 transitions. [2025-03-16 21:54:19,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-16 21:54:19,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:19,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:19,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 21:54:19,677 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:19,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:19,678 INFO L85 PathProgramCache]: Analyzing trace with hash 273677265, now seen corresponding path program 1 times [2025-03-16 21:54:19,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:19,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761417579] [2025-03-16 21:54:19,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:19,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:19,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-16 21:54:19,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-16 21:54:19,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:19,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:19,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:19,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:19,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761417579] [2025-03-16 21:54:19,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761417579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:19,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:19,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:19,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437163430] [2025-03-16 21:54:19,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:19,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:19,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:19,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:19,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:19,987 INFO L87 Difference]: Start difference. First operand 2364 states and 3457 transitions. Second operand has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:20,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:20,450 INFO L93 Difference]: Finished difference Result 4282 states and 6268 transitions. [2025-03-16 21:54:20,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:20,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2025-03-16 21:54:20,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:20,453 INFO L225 Difference]: With dead ends: 4282 [2025-03-16 21:54:20,453 INFO L226 Difference]: Without dead ends: 2372 [2025-03-16 21:54:20,455 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-16 21:54:20,455 INFO L435 NwaCegarLoop]: 1407 mSDtfsCounter, 0 mSDsluCounter, 4148 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5555 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:20,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5555 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:54:20,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2025-03-16 21:54:20,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 2372. [2025-03-16 21:54:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2372 states, 2371 states have (on average 1.4614086883171657) internal successors, (3465), 2371 states have internal predecessors, (3465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 3465 transitions. [2025-03-16 21:54:20,471 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 3465 transitions. Word has length 227 [2025-03-16 21:54:20,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:20,471 INFO L471 AbstractCegarLoop]: Abstraction has 2372 states and 3465 transitions. [2025-03-16 21:54:20,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:20,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 3465 transitions. [2025-03-16 21:54:20,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-16 21:54:20,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:20,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:20,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 21:54:20,474 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:20,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:20,474 INFO L85 PathProgramCache]: Analyzing trace with hash 56064187, now seen corresponding path program 1 times [2025-03-16 21:54:20,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:20,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107067592] [2025-03-16 21:54:20,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:20,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:20,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-16 21:54:20,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-16 21:54:20,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:20,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:21,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:21,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107067592] [2025-03-16 21:54:21,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107067592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:21,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:21,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 21:54:21,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164132755] [2025-03-16 21:54:21,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:21,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:54:21,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:21,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:54:21,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:54:21,225 INFO L87 Difference]: Start difference. First operand 2372 states and 3465 transitions. Second operand has 10 states, 10 states have (on average 22.7) internal successors, (227), 9 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:22,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:22,008 INFO L93 Difference]: Finished difference Result 4292 states and 6276 transitions. [2025-03-16 21:54:22,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 21:54:22,008 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 22.7) internal successors, (227), 9 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2025-03-16 21:54:22,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:22,010 INFO L225 Difference]: With dead ends: 4292 [2025-03-16 21:54:22,010 INFO L226 Difference]: Without dead ends: 2374 [2025-03-16 21:54:22,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-16 21:54:22,012 INFO L435 NwaCegarLoop]: 1396 mSDtfsCounter, 1645 mSDsluCounter, 9750 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1645 SdHoareTripleChecker+Valid, 11146 SdHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:22,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1645 Valid, 11146 Invalid, 2349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 21:54:22,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2025-03-16 21:54:22,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 2374. [2025-03-16 21:54:22,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2374 states, 2373 states have (on average 1.4601769911504425) internal successors, (3465), 2373 states have internal predecessors, (3465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:22,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 3465 transitions. [2025-03-16 21:54:22,028 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 3465 transitions. Word has length 227 [2025-03-16 21:54:22,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:22,028 INFO L471 AbstractCegarLoop]: Abstraction has 2374 states and 3465 transitions. [2025-03-16 21:54:22,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.7) internal successors, (227), 9 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:22,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 3465 transitions. [2025-03-16 21:54:22,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-16 21:54:22,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:22,030 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:22,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 21:54:22,031 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:22,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:22,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1360099520, now seen corresponding path program 1 times [2025-03-16 21:54:22,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:22,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527632121] [2025-03-16 21:54:22,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:22,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:22,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-16 21:54:22,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-16 21:54:22,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:22,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:22,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:22,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:22,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527632121] [2025-03-16 21:54:22,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527632121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:22,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:22,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 21:54:22,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356002680] [2025-03-16 21:54:22,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:22,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:54:22,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:22,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:54:22,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:54:22,902 INFO L87 Difference]: Start difference. First operand 2374 states and 3465 transitions. Second operand has 10 states, 10 states have (on average 22.7) internal successors, (227), 9 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:23,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:23,698 INFO L93 Difference]: Finished difference Result 4676 states and 6818 transitions. [2025-03-16 21:54:23,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 21:54:23,698 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 22.7) internal successors, (227), 9 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2025-03-16 21:54:23,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:23,700 INFO L225 Difference]: With dead ends: 4676 [2025-03-16 21:54:23,700 INFO L226 Difference]: Without dead ends: 2602 [2025-03-16 21:54:23,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-16 21:54:23,702 INFO L435 NwaCegarLoop]: 1380 mSDtfsCounter, 1662 mSDsluCounter, 9638 mSDsCounter, 0 mSdLazyCounter, 2476 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1662 SdHoareTripleChecker+Valid, 11018 SdHoareTripleChecker+Invalid, 2479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:23,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1662 Valid, 11018 Invalid, 2479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2476 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 21:54:23,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2025-03-16 21:54:23,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2025-03-16 21:54:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2602 states, 2601 states have (on average 1.45520953479431) internal successors, (3785), 2601 states have internal predecessors, (3785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:23,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 3785 transitions. [2025-03-16 21:54:23,725 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 3785 transitions. Word has length 227 [2025-03-16 21:54:23,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:23,725 INFO L471 AbstractCegarLoop]: Abstraction has 2602 states and 3785 transitions. [2025-03-16 21:54:23,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.7) internal successors, (227), 9 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:23,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 3785 transitions. [2025-03-16 21:54:23,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-16 21:54:23,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:23,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:23,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 21:54:23,728 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:23,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:23,729 INFO L85 PathProgramCache]: Analyzing trace with hash 279376714, now seen corresponding path program 1 times [2025-03-16 21:54:23,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:23,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284087230] [2025-03-16 21:54:23,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:23,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:23,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-16 21:54:23,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-16 21:54:23,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:23,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:24,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:24,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:24,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284087230] [2025-03-16 21:54:24,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284087230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:24,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:24,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:24,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536710588] [2025-03-16 21:54:24,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:24,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:24,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:24,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:24,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:24,017 INFO L87 Difference]: Start difference. First operand 2602 states and 3785 transitions. Second operand has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:24,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:24,322 INFO L93 Difference]: Finished difference Result 4754 states and 6908 transitions. [2025-03-16 21:54:24,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:24,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2025-03-16 21:54:24,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:24,324 INFO L225 Difference]: With dead ends: 4754 [2025-03-16 21:54:24,324 INFO L226 Difference]: Without dead ends: 2634 [2025-03-16 21:54:24,327 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-16 21:54:24,327 INFO L435 NwaCegarLoop]: 1407 mSDtfsCounter, 0 mSDsluCounter, 2806 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4213 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:24,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4213 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:54:24,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2025-03-16 21:54:24,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2634. [2025-03-16 21:54:24,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 2633 states have (on average 1.449677174325864) internal successors, (3817), 2633 states have internal predecessors, (3817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 3817 transitions. [2025-03-16 21:54:24,346 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 3817 transitions. Word has length 227 [2025-03-16 21:54:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:24,346 INFO L471 AbstractCegarLoop]: Abstraction has 2634 states and 3817 transitions. [2025-03-16 21:54:24,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 3817 transitions. [2025-03-16 21:54:24,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-16 21:54:24,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:24,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:24,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 21:54:24,348 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:24,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:24,349 INFO L85 PathProgramCache]: Analyzing trace with hash 507127402, now seen corresponding path program 1 times [2025-03-16 21:54:24,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:24,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756712897] [2025-03-16 21:54:24,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:24,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:24,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-16 21:54:24,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-16 21:54:24,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:24,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:24,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:24,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:24,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756712897] [2025-03-16 21:54:24,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756712897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:24,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:24,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:54:24,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14713861] [2025-03-16 21:54:24,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:24,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:54:24,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:24,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:54:24,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:24,718 INFO L87 Difference]: Start difference. First operand 2634 states and 3817 transitions. Second operand has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:25,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:25,817 INFO L93 Difference]: Finished difference Result 6467 states and 9390 transitions. [2025-03-16 21:54:25,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:25,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2025-03-16 21:54:25,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:25,821 INFO L225 Difference]: With dead ends: 6467 [2025-03-16 21:54:25,821 INFO L226 Difference]: Without dead ends: 4417 [2025-03-16 21:54:25,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:25,823 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 2806 mSDsluCounter, 4305 mSDsCounter, 0 mSdLazyCounter, 2600 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2806 SdHoareTripleChecker+Valid, 5874 SdHoareTripleChecker+Invalid, 2601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:25,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2806 Valid, 5874 Invalid, 2601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2600 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 21:54:25,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4417 states. [2025-03-16 21:54:25,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4417 to 3225. [2025-03-16 21:54:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3225 states, 3224 states have (on average 1.446029776674938) internal successors, (4662), 3224 states have internal predecessors, (4662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:25,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3225 states to 3225 states and 4662 transitions. [2025-03-16 21:54:25,851 INFO L78 Accepts]: Start accepts. Automaton has 3225 states and 4662 transitions. Word has length 227 [2025-03-16 21:54:25,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:25,851 INFO L471 AbstractCegarLoop]: Abstraction has 3225 states and 4662 transitions. [2025-03-16 21:54:25,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3225 states and 4662 transitions. [2025-03-16 21:54:25,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-16 21:54:25,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:25,854 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:25,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 21:54:25,854 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:25,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:25,855 INFO L85 PathProgramCache]: Analyzing trace with hash 966615833, now seen corresponding path program 1 times [2025-03-16 21:54:25,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:25,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103006456] [2025-03-16 21:54:25,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:25,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:25,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-16 21:54:25,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-16 21:54:25,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:25,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:26,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:26,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:26,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103006456] [2025-03-16 21:54:26,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103006456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:26,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:26,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:54:26,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235012664] [2025-03-16 21:54:26,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:26,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:54:26,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:26,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:54:26,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:26,201 INFO L87 Difference]: Start difference. First operand 3225 states and 4662 transitions. Second operand has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:27,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:27,385 INFO L93 Difference]: Finished difference Result 6483 states and 9398 transitions. [2025-03-16 21:54:27,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:27,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2025-03-16 21:54:27,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:27,389 INFO L225 Difference]: With dead ends: 6483 [2025-03-16 21:54:27,389 INFO L226 Difference]: Without dead ends: 4409 [2025-03-16 21:54:27,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:27,391 INFO L435 NwaCegarLoop]: 2051 mSDtfsCounter, 2841 mSDsluCounter, 5269 mSDsCounter, 0 mSdLazyCounter, 3084 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2841 SdHoareTripleChecker+Valid, 7320 SdHoareTripleChecker+Invalid, 3085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:27,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2841 Valid, 7320 Invalid, 3085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3084 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 21:54:27,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2025-03-16 21:54:27,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 3217. [2025-03-16 21:54:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3217 states, 3216 states have (on average 1.4458955223880596) internal successors, (4650), 3216 states have internal predecessors, (4650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:27,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 4650 transitions. [2025-03-16 21:54:27,423 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 4650 transitions. Word has length 227 [2025-03-16 21:54:27,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:27,423 INFO L471 AbstractCegarLoop]: Abstraction has 3217 states and 4650 transitions. [2025-03-16 21:54:27,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:27,424 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 4650 transitions. [2025-03-16 21:54:27,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-16 21:54:27,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:27,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:27,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 21:54:27,427 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:27,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:27,427 INFO L85 PathProgramCache]: Analyzing trace with hash 2027572180, now seen corresponding path program 1 times [2025-03-16 21:54:27,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:27,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308609479] [2025-03-16 21:54:27,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:27,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:27,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-16 21:54:27,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-16 21:54:27,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:27,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:27,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:27,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308609479] [2025-03-16 21:54:27,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308609479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:27,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:27,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:27,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975690915] [2025-03-16 21:54:27,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:27,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:27,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:27,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:27,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:27,744 INFO L87 Difference]: Start difference. First operand 3217 states and 4650 transitions. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:28,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:28,159 INFO L93 Difference]: Finished difference Result 5883 states and 8483 transitions. [2025-03-16 21:54:28,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:28,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2025-03-16 21:54:28,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:28,162 INFO L225 Difference]: With dead ends: 5883 [2025-03-16 21:54:28,162 INFO L226 Difference]: Without dead ends: 3229 [2025-03-16 21:54:28,164 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-16 21:54:28,164 INFO L435 NwaCegarLoop]: 1407 mSDtfsCounter, 0 mSDsluCounter, 4148 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5555 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:28,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5555 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:54:28,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3229 states. [2025-03-16 21:54:28,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3229 to 3229. [2025-03-16 21:54:28,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3229 states, 3228 states have (on average 1.4442379182156133) internal successors, (4662), 3228 states have internal predecessors, (4662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:28,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 4662 transitions. [2025-03-16 21:54:28,185 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 4662 transitions. Word has length 228 [2025-03-16 21:54:28,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:28,185 INFO L471 AbstractCegarLoop]: Abstraction has 3229 states and 4662 transitions. [2025-03-16 21:54:28,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:28,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 4662 transitions. [2025-03-16 21:54:28,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-16 21:54:28,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:28,187 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:28,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 21:54:28,187 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:28,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:28,188 INFO L85 PathProgramCache]: Analyzing trace with hash -92642658, now seen corresponding path program 1 times [2025-03-16 21:54:28,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:28,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233448345] [2025-03-16 21:54:28,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:28,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:28,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-16 21:54:28,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-16 21:54:28,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:28,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:28,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:28,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233448345] [2025-03-16 21:54:28,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233448345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:28,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:28,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:54:28,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517402340] [2025-03-16 21:54:28,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:28,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:54:28,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:28,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:54:28,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:54:28,689 INFO L87 Difference]: Start difference. First operand 3229 states and 4662 transitions. Second operand has 8 states, 8 states have (on average 28.5) internal successors, (228), 7 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:29,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:29,269 INFO L93 Difference]: Finished difference Result 6251 states and 9011 transitions. [2025-03-16 21:54:29,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:54:29,270 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 28.5) internal successors, (228), 7 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2025-03-16 21:54:29,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:29,272 INFO L225 Difference]: With dead ends: 6251 [2025-03-16 21:54:29,273 INFO L226 Difference]: Without dead ends: 3469 [2025-03-16 21:54:29,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-16 21:54:29,275 INFO L435 NwaCegarLoop]: 1399 mSDtfsCounter, 1671 mSDsluCounter, 6980 mSDsCounter, 0 mSdLazyCounter, 1742 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1671 SdHoareTripleChecker+Valid, 8379 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:29,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1671 Valid, 8379 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1742 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:54:29,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3469 states. [2025-03-16 21:54:29,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3469 to 3469. [2025-03-16 21:54:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3469 states, 3468 states have (on average 1.4411764705882353) internal successors, (4998), 3468 states have internal predecessors, (4998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3469 states to 3469 states and 4998 transitions. [2025-03-16 21:54:29,299 INFO L78 Accepts]: Start accepts. Automaton has 3469 states and 4998 transitions. Word has length 228 [2025-03-16 21:54:29,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:29,299 INFO L471 AbstractCegarLoop]: Abstraction has 3469 states and 4998 transitions. [2025-03-16 21:54:29,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.5) internal successors, (228), 7 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:29,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3469 states and 4998 transitions. [2025-03-16 21:54:29,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-16 21:54:29,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:29,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:29,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 21:54:29,303 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:29,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:29,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1368855917, now seen corresponding path program 1 times [2025-03-16 21:54:29,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:29,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198381950] [2025-03-16 21:54:29,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:29,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:29,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-16 21:54:29,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-16 21:54:29,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:29,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:30,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:30,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:30,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198381950] [2025-03-16 21:54:30,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198381950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:30,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:30,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:54:30,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392817727] [2025-03-16 21:54:30,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:30,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:54:30,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:30,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:54:30,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:30,268 INFO L87 Difference]: Start difference. First operand 3469 states and 4998 transitions. Second operand has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:30,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:30,766 INFO L93 Difference]: Finished difference Result 6399 states and 9185 transitions. [2025-03-16 21:54:30,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:54:30,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2025-03-16 21:54:30,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:30,769 INFO L225 Difference]: With dead ends: 6399 [2025-03-16 21:54:30,769 INFO L226 Difference]: Without dead ends: 3685 [2025-03-16 21:54:30,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:54:30,771 INFO L435 NwaCegarLoop]: 1381 mSDtfsCounter, 1620 mSDsluCounter, 4145 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1620 SdHoareTripleChecker+Valid, 5526 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:30,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1620 Valid, 5526 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:54:30,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3685 states. [2025-03-16 21:54:30,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3685 to 3637. [2025-03-16 21:54:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3637 states, 3636 states have (on average 1.4372937293729373) internal successors, (5226), 3636 states have internal predecessors, (5226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:30,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3637 states to 3637 states and 5226 transitions. [2025-03-16 21:54:30,795 INFO L78 Accepts]: Start accepts. Automaton has 3637 states and 5226 transitions. Word has length 228 [2025-03-16 21:54:30,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:30,795 INFO L471 AbstractCegarLoop]: Abstraction has 3637 states and 5226 transitions. [2025-03-16 21:54:30,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:30,795 INFO L276 IsEmpty]: Start isEmpty. Operand 3637 states and 5226 transitions. [2025-03-16 21:54:30,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-16 21:54:30,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:30,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:30,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 21:54:30,799 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:30,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:30,799 INFO L85 PathProgramCache]: Analyzing trace with hash -2019155815, now seen corresponding path program 1 times [2025-03-16 21:54:30,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:30,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950812060] [2025-03-16 21:54:30,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:30,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:30,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-16 21:54:31,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-16 21:54:31,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:31,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:31,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:31,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:31,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950812060] [2025-03-16 21:54:31,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950812060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:31,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:31,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:54:31,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986343085] [2025-03-16 21:54:31,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:31,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:54:31,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:31,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:54:31,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:31,781 INFO L87 Difference]: Start difference. First operand 3637 states and 5226 transitions. Second operand has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:32,320 INFO L93 Difference]: Finished difference Result 5891 states and 8497 transitions. [2025-03-16 21:54:32,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:54:32,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2025-03-16 21:54:32,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:32,323 INFO L225 Difference]: With dead ends: 5891 [2025-03-16 21:54:32,324 INFO L226 Difference]: Without dead ends: 3701 [2025-03-16 21:54:32,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:54:32,326 INFO L435 NwaCegarLoop]: 1381 mSDtfsCounter, 1520 mSDsluCounter, 5511 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 6892 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:32,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 6892 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:54:32,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3701 states. [2025-03-16 21:54:32,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3701 to 3689. [2025-03-16 21:54:32,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3689 states, 3688 states have (on average 1.4365509761388287) internal successors, (5298), 3688 states have internal predecessors, (5298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:32,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3689 states to 3689 states and 5298 transitions. [2025-03-16 21:54:32,350 INFO L78 Accepts]: Start accepts. Automaton has 3689 states and 5298 transitions. Word has length 228 [2025-03-16 21:54:32,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:32,350 INFO L471 AbstractCegarLoop]: Abstraction has 3689 states and 5298 transitions. [2025-03-16 21:54:32,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:32,350 INFO L276 IsEmpty]: Start isEmpty. Operand 3689 states and 5298 transitions. [2025-03-16 21:54:32,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-16 21:54:32,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:32,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:32,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 21:54:32,353 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:32,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:32,353 INFO L85 PathProgramCache]: Analyzing trace with hash -2010394356, now seen corresponding path program 1 times [2025-03-16 21:54:32,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:32,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399379698] [2025-03-16 21:54:32,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:32,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:32,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-16 21:54:32,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-16 21:54:32,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:32,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:32,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:32,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399379698] [2025-03-16 21:54:32,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399379698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:32,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:32,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 21:54:32,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949608270] [2025-03-16 21:54:32,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:32,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:54:32,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:32,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:54:32,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:54:32,934 INFO L87 Difference]: Start difference. First operand 3689 states and 5298 transitions. Second operand has 10 states, 10 states have (on average 22.9) internal successors, (229), 10 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:34,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:34,312 INFO L93 Difference]: Finished difference Result 7406 states and 10695 transitions. [2025-03-16 21:54:34,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 21:54:34,312 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 22.9) internal successors, (229), 10 states have internal predecessors, (229), 0 states have call successors, (0), 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 229 [2025-03-16 21:54:34,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:34,315 INFO L225 Difference]: With dead ends: 7406 [2025-03-16 21:54:34,315 INFO L226 Difference]: Without dead ends: 3707 [2025-03-16 21:54:34,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-03-16 21:54:34,317 INFO L435 NwaCegarLoop]: 1819 mSDtfsCounter, 1465 mSDsluCounter, 13905 mSDsCounter, 0 mSdLazyCounter, 3969 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 15724 SdHoareTripleChecker+Invalid, 4015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 3969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:34,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 15724 Invalid, 4015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 3969 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 21:54:34,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2025-03-16 21:54:34,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 3703. [2025-03-16 21:54:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3703 states, 3702 states have (on average 1.435440302539168) internal successors, (5314), 3702 states have internal predecessors, (5314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3703 states to 3703 states and 5314 transitions. [2025-03-16 21:54:34,336 INFO L78 Accepts]: Start accepts. Automaton has 3703 states and 5314 transitions. Word has length 229 [2025-03-16 21:54:34,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:34,336 INFO L471 AbstractCegarLoop]: Abstraction has 3703 states and 5314 transitions. [2025-03-16 21:54:34,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.9) internal successors, (229), 10 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:34,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3703 states and 5314 transitions. [2025-03-16 21:54:34,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-16 21:54:34,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:34,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:34,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 21:54:34,339 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:34,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:34,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1542575559, now seen corresponding path program 1 times [2025-03-16 21:54:34,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:34,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285689807] [2025-03-16 21:54:34,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:34,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:34,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-16 21:54:34,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-16 21:54:34,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:34,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:34,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:34,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:34,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285689807] [2025-03-16 21:54:34,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285689807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:34,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:34,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:34,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230153831] [2025-03-16 21:54:34,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:34,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:34,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:34,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:34,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:34,594 INFO L87 Difference]: Start difference. First operand 3703 states and 5314 transitions. Second operand has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:35,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:35,054 INFO L93 Difference]: Finished difference Result 5975 states and 8601 transitions. [2025-03-16 21:54:35,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:35,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 0 states have call successors, (0), 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 229 [2025-03-16 21:54:35,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:35,057 INFO L225 Difference]: With dead ends: 5975 [2025-03-16 21:54:35,057 INFO L226 Difference]: Without dead ends: 3719 [2025-03-16 21:54:35,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:35,059 INFO L435 NwaCegarLoop]: 1407 mSDtfsCounter, 0 mSDsluCounter, 4148 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5555 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:35,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5555 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:54:35,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2025-03-16 21:54:35,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3719. [2025-03-16 21:54:35,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3719 states, 3718 states have (on average 1.4335664335664335) internal successors, (5330), 3718 states have internal predecessors, (5330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:35,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3719 states to 3719 states and 5330 transitions. [2025-03-16 21:54:35,084 INFO L78 Accepts]: Start accepts. Automaton has 3719 states and 5330 transitions. Word has length 229 [2025-03-16 21:54:35,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:35,084 INFO L471 AbstractCegarLoop]: Abstraction has 3719 states and 5330 transitions. [2025-03-16 21:54:35,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:35,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3719 states and 5330 transitions. [2025-03-16 21:54:35,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-16 21:54:35,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:35,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:35,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 21:54:35,087 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:35,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:35,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1105652872, now seen corresponding path program 1 times [2025-03-16 21:54:35,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:35,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195159013] [2025-03-16 21:54:35,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:35,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:35,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-16 21:54:35,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-16 21:54:35,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:35,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:35,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:35,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195159013] [2025-03-16 21:54:35,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195159013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:35,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:35,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:35,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64076396] [2025-03-16 21:54:35,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:35,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:35,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:35,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:35,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:35,354 INFO L87 Difference]: Start difference. First operand 3719 states and 5330 transitions. Second operand has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:35,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:35,656 INFO L93 Difference]: Finished difference Result 5999 states and 8621 transitions. [2025-03-16 21:54:35,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:35,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 0 states have call successors, (0), 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 229 [2025-03-16 21:54:35,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:35,660 INFO L225 Difference]: With dead ends: 5999 [2025-03-16 21:54:35,660 INFO L226 Difference]: Without dead ends: 3727 [2025-03-16 21:54:35,662 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-16 21:54:35,662 INFO L435 NwaCegarLoop]: 1407 mSDtfsCounter, 0 mSDsluCounter, 2806 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4213 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:35,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4213 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:54:35,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3727 states. [2025-03-16 21:54:35,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 3727. [2025-03-16 21:54:35,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3727 states, 3726 states have (on average 1.4326355340848094) internal successors, (5338), 3726 states have internal predecessors, (5338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:35,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3727 states to 3727 states and 5338 transitions. [2025-03-16 21:54:35,688 INFO L78 Accepts]: Start accepts. Automaton has 3727 states and 5338 transitions. Word has length 229 [2025-03-16 21:54:35,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:35,688 INFO L471 AbstractCegarLoop]: Abstraction has 3727 states and 5338 transitions. [2025-03-16 21:54:35,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 3727 states and 5338 transitions. [2025-03-16 21:54:35,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-16 21:54:35,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:35,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:35,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 21:54:35,692 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:35,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:35,692 INFO L85 PathProgramCache]: Analyzing trace with hash -127362530, now seen corresponding path program 1 times [2025-03-16 21:54:35,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:35,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432347831] [2025-03-16 21:54:35,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:35,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:35,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-16 21:54:35,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-16 21:54:35,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:35,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:36,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:36,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432347831] [2025-03-16 21:54:36,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432347831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:36,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:36,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:36,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165853852] [2025-03-16 21:54:36,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:36,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:36,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:36,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:36,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:36,093 INFO L87 Difference]: Start difference. First operand 3727 states and 5338 transitions. Second operand has 5 states, 5 states have (on average 46.0) internal successors, (230), 4 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:36,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:36,477 INFO L93 Difference]: Finished difference Result 6023 states and 8649 transitions. [2025-03-16 21:54:36,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:36,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 4 states have internal predecessors, (230), 0 states have call successors, (0), 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 230 [2025-03-16 21:54:36,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:36,481 INFO L225 Difference]: With dead ends: 6023 [2025-03-16 21:54:36,481 INFO L226 Difference]: Without dead ends: 3743 [2025-03-16 21:54:36,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:36,482 INFO L435 NwaCegarLoop]: 1386 mSDtfsCounter, 1495 mSDsluCounter, 2766 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 4152 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:36,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 4152 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:54:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3743 states. [2025-03-16 21:54:36,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3743 to 3739. [2025-03-16 21:54:36,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3739 states, 3738 states have (on average 1.4323167469234885) internal successors, (5354), 3738 states have internal predecessors, (5354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:36,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5354 transitions. [2025-03-16 21:54:36,507 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5354 transitions. Word has length 230 [2025-03-16 21:54:36,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:36,507 INFO L471 AbstractCegarLoop]: Abstraction has 3739 states and 5354 transitions. [2025-03-16 21:54:36,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 4 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:36,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5354 transitions. [2025-03-16 21:54:36,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-16 21:54:36,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:36,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:36,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-16 21:54:36,510 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:36,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:36,511 INFO L85 PathProgramCache]: Analyzing trace with hash 2045696261, now seen corresponding path program 1 times [2025-03-16 21:54:36,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:36,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441546235] [2025-03-16 21:54:36,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:36,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:36,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-16 21:54:36,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-16 21:54:36,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:36,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:37,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:37,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441546235] [2025-03-16 21:54:37,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441546235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:37,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:37,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 21:54:37,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347631538] [2025-03-16 21:54:37,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:37,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 21:54:37,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:37,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 21:54:37,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-16 21:54:37,442 INFO L87 Difference]: Start difference. First operand 3739 states and 5354 transitions. Second operand has 11 states, 11 states have (on average 20.90909090909091) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:38,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:38,282 INFO L93 Difference]: Finished difference Result 6041 states and 8671 transitions. [2025-03-16 21:54:38,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 21:54:38,282 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.90909090909091) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 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 230 [2025-03-16 21:54:38,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:38,285 INFO L225 Difference]: With dead ends: 6041 [2025-03-16 21:54:38,285 INFO L226 Difference]: Without dead ends: 3749 [2025-03-16 21:54:38,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-16 21:54:38,288 INFO L435 NwaCegarLoop]: 1391 mSDtfsCounter, 1754 mSDsluCounter, 9707 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1754 SdHoareTripleChecker+Valid, 11098 SdHoareTripleChecker+Invalid, 2393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:38,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1754 Valid, 11098 Invalid, 2393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2392 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 21:54:38,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3749 states. [2025-03-16 21:54:38,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3749 to 3745. [2025-03-16 21:54:38,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3745 states, 3744 states have (on average 1.4316239316239316) internal successors, (5360), 3744 states have internal predecessors, (5360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:38,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3745 states to 3745 states and 5360 transitions. [2025-03-16 21:54:38,312 INFO L78 Accepts]: Start accepts. Automaton has 3745 states and 5360 transitions. Word has length 230 [2025-03-16 21:54:38,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:38,313 INFO L471 AbstractCegarLoop]: Abstraction has 3745 states and 5360 transitions. [2025-03-16 21:54:38,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.90909090909091) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:38,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3745 states and 5360 transitions. [2025-03-16 21:54:38,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-16 21:54:38,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:38,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:38,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-16 21:54:38,315 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:38,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:38,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1639793598, now seen corresponding path program 1 times [2025-03-16 21:54:38,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:38,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703213432] [2025-03-16 21:54:38,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:38,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:38,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-16 21:54:38,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-16 21:54:38,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:38,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:38,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:38,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:38,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703213432] [2025-03-16 21:54:38,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703213432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:38,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:38,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:38,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804782824] [2025-03-16 21:54:38,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:38,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:38,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:38,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:38,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:38,716 INFO L87 Difference]: Start difference. First operand 3745 states and 5360 transitions. Second operand has 5 states, 5 states have (on average 46.0) internal successors, (230), 4 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:39,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:39,114 INFO L93 Difference]: Finished difference Result 6075 states and 8717 transitions. [2025-03-16 21:54:39,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:39,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 4 states have internal predecessors, (230), 0 states have call successors, (0), 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 230 [2025-03-16 21:54:39,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:39,117 INFO L225 Difference]: With dead ends: 6075 [2025-03-16 21:54:39,117 INFO L226 Difference]: Without dead ends: 3777 [2025-03-16 21:54:39,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:39,119 INFO L435 NwaCegarLoop]: 1386 mSDtfsCounter, 1489 mSDsluCounter, 2766 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 4152 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:39,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1489 Valid, 4152 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:54:39,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3777 states. [2025-03-16 21:54:39,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3777 to 3769. [2025-03-16 21:54:39,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3769 states, 3768 states have (on average 1.4309978768577494) internal successors, (5392), 3768 states have internal predecessors, (5392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3769 states to 3769 states and 5392 transitions. [2025-03-16 21:54:39,139 INFO L78 Accepts]: Start accepts. Automaton has 3769 states and 5392 transitions. Word has length 230 [2025-03-16 21:54:39,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:39,139 INFO L471 AbstractCegarLoop]: Abstraction has 3769 states and 5392 transitions. [2025-03-16 21:54:39,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 4 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:39,139 INFO L276 IsEmpty]: Start isEmpty. Operand 3769 states and 5392 transitions. [2025-03-16 21:54:39,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-16 21:54:39,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:39,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:39,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-16 21:54:39,142 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:39,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:39,142 INFO L85 PathProgramCache]: Analyzing trace with hash -364237154, now seen corresponding path program 1 times [2025-03-16 21:54:39,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:39,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577772626] [2025-03-16 21:54:39,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:39,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:39,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-16 21:54:39,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-16 21:54:39,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:39,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:39,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:39,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:39,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577772626] [2025-03-16 21:54:39,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577772626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:39,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:39,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 21:54:39,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413410298] [2025-03-16 21:54:39,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:39,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:54:39,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:39,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:54:39,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:54:39,547 INFO L87 Difference]: Start difference. First operand 3769 states and 5392 transitions. Second operand has 8 states, 8 states have (on average 28.875) internal successors, (231), 8 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:40,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:40,179 INFO L93 Difference]: Finished difference Result 6803 states and 9721 transitions. [2025-03-16 21:54:40,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:54:40,180 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 28.875) internal successors, (231), 8 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2025-03-16 21:54:40,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:40,183 INFO L225 Difference]: With dead ends: 6803 [2025-03-16 21:54:40,183 INFO L226 Difference]: Without dead ends: 4141 [2025-03-16 21:54:40,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-16 21:54:40,185 INFO L435 NwaCegarLoop]: 1397 mSDtfsCounter, 35 mSDsluCounter, 8363 mSDsCounter, 0 mSdLazyCounter, 2043 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 9760 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:40,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 9760 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2043 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 21:54:40,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2025-03-16 21:54:40,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 4129. [2025-03-16 21:54:40,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4129 states, 4128 states have (on average 1.425387596899225) internal successors, (5884), 4128 states have internal predecessors, (5884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:40,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 5884 transitions. [2025-03-16 21:54:40,210 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 5884 transitions. Word has length 231 [2025-03-16 21:54:40,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:40,210 INFO L471 AbstractCegarLoop]: Abstraction has 4129 states and 5884 transitions. [2025-03-16 21:54:40,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.875) internal successors, (231), 8 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:40,210 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 5884 transitions. [2025-03-16 21:54:40,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-16 21:54:40,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:40,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:40,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-16 21:54:40,213 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:40,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:40,213 INFO L85 PathProgramCache]: Analyzing trace with hash 722311405, now seen corresponding path program 1 times [2025-03-16 21:54:40,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:40,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143603223] [2025-03-16 21:54:40,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:40,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:40,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-16 21:54:40,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-16 21:54:40,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:40,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:40,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:40,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:40,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143603223] [2025-03-16 21:54:40,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143603223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:40,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:40,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:40,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928164735] [2025-03-16 21:54:40,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:40,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:54:40,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:40,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:54:40,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:40,594 INFO L87 Difference]: Start difference. First operand 4129 states and 5884 transitions. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:40,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:40,917 INFO L93 Difference]: Finished difference Result 6567 states and 9385 transitions. [2025-03-16 21:54:40,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:40,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2025-03-16 21:54:40,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:40,921 INFO L225 Difference]: With dead ends: 6567 [2025-03-16 21:54:40,921 INFO L226 Difference]: Without dead ends: 4125 [2025-03-16 21:54:40,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:40,923 INFO L435 NwaCegarLoop]: 1407 mSDtfsCounter, 0 mSDsluCounter, 2806 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4213 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:40,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4213 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:54:40,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4125 states. [2025-03-16 21:54:40,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4125 to 4125. [2025-03-16 21:54:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4125 states, 4124 states have (on average 1.4248302618816684) internal successors, (5876), 4124 states have internal predecessors, (5876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:40,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 5876 transitions. [2025-03-16 21:54:40,950 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 5876 transitions. Word has length 231 [2025-03-16 21:54:40,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:40,950 INFO L471 AbstractCegarLoop]: Abstraction has 4125 states and 5876 transitions. [2025-03-16 21:54:40,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:40,950 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 5876 transitions. [2025-03-16 21:54:40,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-16 21:54:40,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:40,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:40,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-16 21:54:40,953 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:40,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:40,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1178607326, now seen corresponding path program 1 times [2025-03-16 21:54:40,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:40,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295916328] [2025-03-16 21:54:40,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:40,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:40,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-16 21:54:41,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-16 21:54:41,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:41,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:41,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:41,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:41,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295916328] [2025-03-16 21:54:41,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295916328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:41,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:41,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:41,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211354291] [2025-03-16 21:54:41,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:41,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:41,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:41,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:41,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:41,202 INFO L87 Difference]: Start difference. First operand 4125 states and 5876 transitions. Second operand has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:41,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:41,659 INFO L93 Difference]: Finished difference Result 10580 states and 15083 transitions. [2025-03-16 21:54:41,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:41,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2025-03-16 21:54:41,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:41,666 INFO L225 Difference]: With dead ends: 10580 [2025-03-16 21:54:41,666 INFO L226 Difference]: Without dead ends: 8142 [2025-03-16 21:54:41,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:41,669 INFO L435 NwaCegarLoop]: 1393 mSDtfsCounter, 1441 mSDsluCounter, 4170 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1441 SdHoareTripleChecker+Valid, 5563 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:41,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1441 Valid, 5563 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:54:41,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8142 states. [2025-03-16 21:54:41,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8142 to 7290. [2025-03-16 21:54:41,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7290 states, 7289 states have (on average 1.4184387433118397) internal successors, (10339), 7289 states have internal predecessors, (10339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7290 states to 7290 states and 10339 transitions. [2025-03-16 21:54:41,727 INFO L78 Accepts]: Start accepts. Automaton has 7290 states and 10339 transitions. Word has length 231 [2025-03-16 21:54:41,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:41,727 INFO L471 AbstractCegarLoop]: Abstraction has 7290 states and 10339 transitions. [2025-03-16 21:54:41,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:41,727 INFO L276 IsEmpty]: Start isEmpty. Operand 7290 states and 10339 transitions. [2025-03-16 21:54:41,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-16 21:54:41,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:41,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:41,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-16 21:54:41,733 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:41,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:41,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1674131866, now seen corresponding path program 1 times [2025-03-16 21:54:41,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:41,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926684032] [2025-03-16 21:54:41,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:41,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:41,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-16 21:54:41,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-16 21:54:41,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:41,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:42,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:42,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926684032] [2025-03-16 21:54:42,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926684032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:42,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:42,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 21:54:42,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628735617] [2025-03-16 21:54:42,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:42,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:54:42,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:42,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:54:42,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:54:42,526 INFO L87 Difference]: Start difference. First operand 7290 states and 10339 transitions. Second operand has 10 states, 10 states have (on average 23.1) internal successors, (231), 9 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:43,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:43,538 INFO L93 Difference]: Finished difference Result 9738 states and 13852 transitions. [2025-03-16 21:54:43,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 21:54:43,538 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 23.1) internal successors, (231), 9 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2025-03-16 21:54:43,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:43,543 INFO L225 Difference]: With dead ends: 9738 [2025-03-16 21:54:43,543 INFO L226 Difference]: Without dead ends: 7300 [2025-03-16 21:54:43,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:54:43,546 INFO L435 NwaCegarLoop]: 1223 mSDtfsCounter, 1496 mSDsluCounter, 7310 mSDsCounter, 0 mSdLazyCounter, 3254 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 8533 SdHoareTripleChecker+Invalid, 3256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:43,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 8533 Invalid, 3256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3254 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 21:54:43,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7300 states. [2025-03-16 21:54:43,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7300 to 7296. [2025-03-16 21:54:43,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7296 states, 7295 states have (on average 1.418368745716244) internal successors, (10347), 7295 states have internal predecessors, (10347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:43,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7296 states to 7296 states and 10347 transitions. [2025-03-16 21:54:43,588 INFO L78 Accepts]: Start accepts. Automaton has 7296 states and 10347 transitions. Word has length 231 [2025-03-16 21:54:43,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:43,588 INFO L471 AbstractCegarLoop]: Abstraction has 7296 states and 10347 transitions. [2025-03-16 21:54:43,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.1) internal successors, (231), 9 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:43,588 INFO L276 IsEmpty]: Start isEmpty. Operand 7296 states and 10347 transitions. [2025-03-16 21:54:43,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-16 21:54:43,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:43,593 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:43,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-16 21:54:43,593 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:43,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:43,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1459701489, now seen corresponding path program 1 times [2025-03-16 21:54:43,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:43,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131978312] [2025-03-16 21:54:43,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:43,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:43,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-16 21:54:43,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-16 21:54:43,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:43,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:44,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:44,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:44,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131978312] [2025-03-16 21:54:44,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131978312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:44,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:44,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 21:54:44,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115727684] [2025-03-16 21:54:44,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:44,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 21:54:44,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:44,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 21:54:44,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-16 21:54:44,485 INFO L87 Difference]: Start difference. First operand 7296 states and 10347 transitions. Second operand has 13 states, 13 states have (on average 17.76923076923077) internal successors, (231), 12 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:45,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:45,555 INFO L93 Difference]: Finished difference Result 10042 states and 14266 transitions. [2025-03-16 21:54:45,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 21:54:45,555 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 17.76923076923077) internal successors, (231), 12 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2025-03-16 21:54:45,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:45,561 INFO L225 Difference]: With dead ends: 10042 [2025-03-16 21:54:45,561 INFO L226 Difference]: Without dead ends: 7500 [2025-03-16 21:54:45,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-03-16 21:54:45,564 INFO L435 NwaCegarLoop]: 1392 mSDtfsCounter, 1584 mSDsluCounter, 13888 mSDsCounter, 0 mSdLazyCounter, 3275 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 15280 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:45,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1584 Valid, 15280 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3275 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 21:54:45,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7500 states. [2025-03-16 21:54:45,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7500 to 7496. [2025-03-16 21:54:45,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7496 states, 7495 states have (on average 1.4162775183455638) internal successors, (10615), 7495 states have internal predecessors, (10615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7496 states to 7496 states and 10615 transitions. [2025-03-16 21:54:45,604 INFO L78 Accepts]: Start accepts. Automaton has 7496 states and 10615 transitions. Word has length 231 [2025-03-16 21:54:45,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:45,604 INFO L471 AbstractCegarLoop]: Abstraction has 7496 states and 10615 transitions. [2025-03-16 21:54:45,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.76923076923077) internal successors, (231), 12 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:45,604 INFO L276 IsEmpty]: Start isEmpty. Operand 7496 states and 10615 transitions. [2025-03-16 21:54:45,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-16 21:54:45,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:45,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:45,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-16 21:54:45,609 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:45,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:45,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1656198521, now seen corresponding path program 1 times [2025-03-16 21:54:45,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:45,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284679420] [2025-03-16 21:54:45,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:45,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:45,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-16 21:54:45,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-16 21:54:45,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:45,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:45,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:45,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:45,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284679420] [2025-03-16 21:54:45,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284679420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:45,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:45,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:45,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899299439] [2025-03-16 21:54:45,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:45,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:54:45,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:45,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:54:45,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:45,975 INFO L87 Difference]: Start difference. First operand 7496 states and 10615 transitions. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:46,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:46,298 INFO L93 Difference]: Finished difference Result 10066 states and 14296 transitions. [2025-03-16 21:54:46,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:46,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2025-03-16 21:54:46,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:46,304 INFO L225 Difference]: With dead ends: 10066 [2025-03-16 21:54:46,304 INFO L226 Difference]: Without dead ends: 7484 [2025-03-16 21:54:46,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:46,306 INFO L435 NwaCegarLoop]: 1407 mSDtfsCounter, 0 mSDsluCounter, 2806 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4213 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:46,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4213 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:54:46,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7484 states. [2025-03-16 21:54:46,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7484 to 7484. [2025-03-16 21:54:46,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7484 states, 7483 states have (on average 1.4153414405986904) internal successors, (10591), 7483 states have internal predecessors, (10591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:46,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7484 states to 7484 states and 10591 transitions. [2025-03-16 21:54:46,350 INFO L78 Accepts]: Start accepts. Automaton has 7484 states and 10591 transitions. Word has length 231 [2025-03-16 21:54:46,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:46,350 INFO L471 AbstractCegarLoop]: Abstraction has 7484 states and 10591 transitions. [2025-03-16 21:54:46,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:46,350 INFO L276 IsEmpty]: Start isEmpty. Operand 7484 states and 10591 transitions. [2025-03-16 21:54:46,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-16 21:54:46,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:46,355 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:46,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-16 21:54:46,355 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:46,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:46,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1465930637, now seen corresponding path program 1 times [2025-03-16 21:54:46,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:46,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496562916] [2025-03-16 21:54:46,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:46,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:46,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-16 21:54:46,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-16 21:54:46,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:46,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:46,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:46,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:46,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496562916] [2025-03-16 21:54:46,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496562916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:46,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:46,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:46,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873990552] [2025-03-16 21:54:46,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:46,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:46,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:46,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:46,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:46,584 INFO L87 Difference]: Start difference. First operand 7484 states and 10591 transitions. Second operand has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:47,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:47,037 INFO L93 Difference]: Finished difference Result 10876 states and 15441 transitions. [2025-03-16 21:54:47,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:47,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2025-03-16 21:54:47,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:47,043 INFO L225 Difference]: With dead ends: 10876 [2025-03-16 21:54:47,043 INFO L226 Difference]: Without dead ends: 8210 [2025-03-16 21:54:47,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:47,046 INFO L435 NwaCegarLoop]: 1393 mSDtfsCounter, 1424 mSDsluCounter, 4170 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1424 SdHoareTripleChecker+Valid, 5563 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:47,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1424 Valid, 5563 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:54:47,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8210 states. [2025-03-16 21:54:47,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8210 to 7412. [2025-03-16 21:54:47,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7412 states, 7411 states have (on average 1.414518958305222) internal successors, (10483), 7411 states have internal predecessors, (10483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:47,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7412 states to 7412 states and 10483 transitions. [2025-03-16 21:54:47,091 INFO L78 Accepts]: Start accepts. Automaton has 7412 states and 10483 transitions. Word has length 231 [2025-03-16 21:54:47,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:47,091 INFO L471 AbstractCegarLoop]: Abstraction has 7412 states and 10483 transitions. [2025-03-16 21:54:47,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 7412 states and 10483 transitions. [2025-03-16 21:54:47,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-16 21:54:47,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:47,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:47,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-16 21:54:47,097 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:47,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:47,097 INFO L85 PathProgramCache]: Analyzing trace with hash 546155186, now seen corresponding path program 1 times [2025-03-16 21:54:47,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:47,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691138617] [2025-03-16 21:54:47,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:47,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:47,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-16 21:54:47,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-16 21:54:47,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:47,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:47,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:47,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:47,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691138617] [2025-03-16 21:54:47,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691138617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:47,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:47,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:47,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919559186] [2025-03-16 21:54:47,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:47,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:47,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:47,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:47,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:47,338 INFO L87 Difference]: Start difference. First operand 7412 states and 10483 transitions. Second operand has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:47,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:47,776 INFO L93 Difference]: Finished difference Result 13344 states and 18804 transitions. [2025-03-16 21:54:47,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:47,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2025-03-16 21:54:47,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:47,782 INFO L225 Difference]: With dead ends: 13344 [2025-03-16 21:54:47,782 INFO L226 Difference]: Without dead ends: 7460 [2025-03-16 21:54:47,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-16 21:54:47,785 INFO L435 NwaCegarLoop]: 1407 mSDtfsCounter, 0 mSDsluCounter, 4148 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5555 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:47,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5555 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:54:47,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7460 states. [2025-03-16 21:54:47,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7460 to 7460. [2025-03-16 21:54:47,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7460 states, 7459 states have (on average 1.4118514546185816) internal successors, (10531), 7459 states have internal predecessors, (10531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7460 states to 7460 states and 10531 transitions. [2025-03-16 21:54:47,828 INFO L78 Accepts]: Start accepts. Automaton has 7460 states and 10531 transitions. Word has length 231 [2025-03-16 21:54:47,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:47,828 INFO L471 AbstractCegarLoop]: Abstraction has 7460 states and 10531 transitions. [2025-03-16 21:54:47,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:47,828 INFO L276 IsEmpty]: Start isEmpty. Operand 7460 states and 10531 transitions. [2025-03-16 21:54:47,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-16 21:54:47,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:47,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:47,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-16 21:54:47,833 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:47,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:47,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1144670198, now seen corresponding path program 1 times [2025-03-16 21:54:47,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:47,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189194780] [2025-03-16 21:54:47,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:47,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:47,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-16 21:54:47,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-16 21:54:47,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:47,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:48,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:48,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:48,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189194780] [2025-03-16 21:54:48,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189194780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:48,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:48,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:48,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48983217] [2025-03-16 21:54:48,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:48,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:54:48,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:48,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:54:48,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:48,044 INFO L87 Difference]: Start difference. First operand 7460 states and 10531 transitions. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:48,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:48,345 INFO L93 Difference]: Finished difference Result 14254 states and 20071 transitions. [2025-03-16 21:54:48,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:48,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2025-03-16 21:54:48,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:48,351 INFO L225 Difference]: With dead ends: 14254 [2025-03-16 21:54:48,351 INFO L226 Difference]: Without dead ends: 7472 [2025-03-16 21:54:48,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:48,355 INFO L435 NwaCegarLoop]: 1407 mSDtfsCounter, 0 mSDsluCounter, 2806 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4213 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:48,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4213 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:54:48,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7472 states. [2025-03-16 21:54:48,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7472 to 7472. [2025-03-16 21:54:48,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7472 states, 7471 states have (on average 1.4111899344130638) internal successors, (10543), 7471 states have internal predecessors, (10543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 10543 transitions. [2025-03-16 21:54:48,399 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 10543 transitions. Word has length 231 [2025-03-16 21:54:48,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:48,399 INFO L471 AbstractCegarLoop]: Abstraction has 7472 states and 10543 transitions. [2025-03-16 21:54:48,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:48,399 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 10543 transitions. [2025-03-16 21:54:48,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-16 21:54:48,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:48,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:48,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-16 21:54:48,403 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:48,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:48,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1258358842, now seen corresponding path program 1 times [2025-03-16 21:54:48,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:48,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308827020] [2025-03-16 21:54:48,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:48,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:48,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-16 21:54:48,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-16 21:54:48,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:48,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:48,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:48,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308827020] [2025-03-16 21:54:48,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308827020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:48,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:48,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:48,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077367666] [2025-03-16 21:54:48,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:48,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:48,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:48,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:48,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:48,635 INFO L87 Difference]: Start difference. First operand 7472 states and 10543 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:48,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:48,939 INFO L93 Difference]: Finished difference Result 14298 states and 20125 transitions. [2025-03-16 21:54:48,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:48,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2025-03-16 21:54:48,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:48,945 INFO L225 Difference]: With dead ends: 14298 [2025-03-16 21:54:48,945 INFO L226 Difference]: Without dead ends: 7484 [2025-03-16 21:54:48,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:48,950 INFO L435 NwaCegarLoop]: 1407 mSDtfsCounter, 0 mSDsluCounter, 2806 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4213 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:48,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4213 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:54:48,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7484 states. [2025-03-16 21:54:48,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7484 to 7484. [2025-03-16 21:54:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7484 states, 7483 states have (on average 1.410530535881331) internal successors, (10555), 7483 states have internal predecessors, (10555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:48,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7484 states to 7484 states and 10555 transitions. [2025-03-16 21:54:48,994 INFO L78 Accepts]: Start accepts. Automaton has 7484 states and 10555 transitions. Word has length 232 [2025-03-16 21:54:48,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:48,994 INFO L471 AbstractCegarLoop]: Abstraction has 7484 states and 10555 transitions. [2025-03-16 21:54:48,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:48,994 INFO L276 IsEmpty]: Start isEmpty. Operand 7484 states and 10555 transitions. [2025-03-16 21:54:48,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-16 21:54:48,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:48,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:48,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-16 21:54:48,999 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:48,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:48,999 INFO L85 PathProgramCache]: Analyzing trace with hash 990598952, now seen corresponding path program 1 times [2025-03-16 21:54:48,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:48,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611202261] [2025-03-16 21:54:48,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:48,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:49,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-16 21:54:49,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-16 21:54:49,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:49,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:49,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:49,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611202261] [2025-03-16 21:54:49,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611202261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:49,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:49,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:54:49,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821130854] [2025-03-16 21:54:49,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:49,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:54:49,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:49,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:54:49,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:49,252 INFO L87 Difference]: Start difference. First operand 7484 states and 10555 transitions. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:49,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:49,714 INFO L93 Difference]: Finished difference Result 10964 states and 15468 transitions. [2025-03-16 21:54:49,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:49,714 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2025-03-16 21:54:49,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:49,720 INFO L225 Difference]: With dead ends: 10964 [2025-03-16 21:54:49,720 INFO L226 Difference]: Without dead ends: 7840 [2025-03-16 21:54:49,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:49,722 INFO L435 NwaCegarLoop]: 1400 mSDtfsCounter, 32 mSDsluCounter, 5587 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6987 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:49,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6987 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:54:49,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7840 states. [2025-03-16 21:54:49,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7840 to 7824. [2025-03-16 21:54:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7824 states, 7823 states have (on average 1.405471046912949) internal successors, (10995), 7823 states have internal predecessors, (10995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7824 states to 7824 states and 10995 transitions. [2025-03-16 21:54:49,764 INFO L78 Accepts]: Start accepts. Automaton has 7824 states and 10995 transitions. Word has length 232 [2025-03-16 21:54:49,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:49,764 INFO L471 AbstractCegarLoop]: Abstraction has 7824 states and 10995 transitions. [2025-03-16 21:54:49,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:49,764 INFO L276 IsEmpty]: Start isEmpty. Operand 7824 states and 10995 transitions. [2025-03-16 21:54:49,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-16 21:54:49,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:49,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:49,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-16 21:54:49,769 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:49,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:49,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1686624703, now seen corresponding path program 1 times [2025-03-16 21:54:49,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:49,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321218657] [2025-03-16 21:54:49,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:49,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:49,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-16 21:54:49,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-16 21:54:49,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:49,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:50,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:50,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:50,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321218657] [2025-03-16 21:54:50,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321218657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:50,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:50,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 21:54:50,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174814289] [2025-03-16 21:54:50,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:50,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:54:50,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:50,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:54:50,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:54:50,371 INFO L87 Difference]: Start difference. First operand 7824 states and 10995 transitions. Second operand has 10 states, 10 states have (on average 23.2) internal successors, (232), 9 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:51,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:51,162 INFO L93 Difference]: Finished difference Result 10904 states and 15376 transitions. [2025-03-16 21:54:51,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 21:54:51,163 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 23.2) internal successors, (232), 9 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2025-03-16 21:54:51,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:51,169 INFO L225 Difference]: With dead ends: 10904 [2025-03-16 21:54:51,169 INFO L226 Difference]: Without dead ends: 7988 [2025-03-16 21:54:51,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-16 21:54:51,171 INFO L435 NwaCegarLoop]: 1380 mSDtfsCounter, 1593 mSDsluCounter, 9638 mSDsCounter, 0 mSdLazyCounter, 2476 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1593 SdHoareTripleChecker+Valid, 11018 SdHoareTripleChecker+Invalid, 2479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:51,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1593 Valid, 11018 Invalid, 2479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2476 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 21:54:51,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7988 states. [2025-03-16 21:54:51,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7988 to 7984. [2025-03-16 21:54:51,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7984 states, 7983 states have (on average 1.4053613929600401) internal successors, (11219), 7983 states have internal predecessors, (11219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:51,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7984 states to 7984 states and 11219 transitions. [2025-03-16 21:54:51,219 INFO L78 Accepts]: Start accepts. Automaton has 7984 states and 11219 transitions. Word has length 232 [2025-03-16 21:54:51,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:51,219 INFO L471 AbstractCegarLoop]: Abstraction has 7984 states and 11219 transitions. [2025-03-16 21:54:51,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.2) internal successors, (232), 9 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:51,219 INFO L276 IsEmpty]: Start isEmpty. Operand 7984 states and 11219 transitions. [2025-03-16 21:54:51,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-16 21:54:51,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:51,224 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:51,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-16 21:54:51,224 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:51,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:51,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1558726839, now seen corresponding path program 1 times [2025-03-16 21:54:51,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:51,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573715706] [2025-03-16 21:54:51,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:51,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:51,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-16 21:54:51,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-16 21:54:51,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:51,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:51,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:51,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:51,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573715706] [2025-03-16 21:54:51,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573715706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:51,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:51,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 21:54:51,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124408396] [2025-03-16 21:54:51,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:51,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:54:51,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:51,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:54:51,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:54:51,977 INFO L87 Difference]: Start difference. First operand 7984 states and 11219 transitions. Second operand has 10 states, 10 states have (on average 23.2) internal successors, (232), 9 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:52,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:52,738 INFO L93 Difference]: Finished difference Result 10766 states and 15174 transitions. [2025-03-16 21:54:52,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 21:54:52,738 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 23.2) internal successors, (232), 9 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2025-03-16 21:54:52,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:52,745 INFO L225 Difference]: With dead ends: 10766 [2025-03-16 21:54:52,745 INFO L226 Difference]: Without dead ends: 7986 [2025-03-16 21:54:52,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-16 21:54:52,749 INFO L435 NwaCegarLoop]: 1396 mSDtfsCounter, 1576 mSDsluCounter, 9750 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1576 SdHoareTripleChecker+Valid, 11146 SdHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:52,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1576 Valid, 11146 Invalid, 2349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 21:54:52,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7986 states. [2025-03-16 21:54:52,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7986 to 7986. [2025-03-16 21:54:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7986 states, 7985 states have (on average 1.405009392611146) internal successors, (11219), 7985 states have internal predecessors, (11219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:52,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7986 states to 7986 states and 11219 transitions. [2025-03-16 21:54:52,807 INFO L78 Accepts]: Start accepts. Automaton has 7986 states and 11219 transitions. Word has length 232 [2025-03-16 21:54:52,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:52,807 INFO L471 AbstractCegarLoop]: Abstraction has 7986 states and 11219 transitions. [2025-03-16 21:54:52,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.2) internal successors, (232), 9 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand 7986 states and 11219 transitions. [2025-03-16 21:54:52,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-16 21:54:52,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:52,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:52,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-16 21:54:52,813 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:52,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:52,814 INFO L85 PathProgramCache]: Analyzing trace with hash -360001818, now seen corresponding path program 1 times [2025-03-16 21:54:52,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:52,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932682513] [2025-03-16 21:54:52,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:52,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:52,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-16 21:54:52,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-16 21:54:52,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:52,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:53,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:53,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932682513] [2025-03-16 21:54:53,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932682513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:53,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:53,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:53,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973455579] [2025-03-16 21:54:53,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:53,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:54:53,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:53,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:54:53,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:53,298 INFO L87 Difference]: Start difference. First operand 7986 states and 11219 transitions. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:53,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:53,720 INFO L93 Difference]: Finished difference Result 11044 states and 15554 transitions. [2025-03-16 21:54:53,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:53,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2025-03-16 21:54:53,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:53,727 INFO L225 Difference]: With dead ends: 11044 [2025-03-16 21:54:53,727 INFO L226 Difference]: Without dead ends: 8178 [2025-03-16 21:54:53,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:54:53,729 INFO L435 NwaCegarLoop]: 1401 mSDtfsCounter, 1533 mSDsluCounter, 4194 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 5595 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:53,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1533 Valid, 5595 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:54:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8178 states. [2025-03-16 21:54:53,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8178 to 8178. [2025-03-16 21:54:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8178 states, 8177 states have (on average 1.4043047572459337) internal successors, (11483), 8177 states have internal predecessors, (11483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8178 states to 8178 states and 11483 transitions. [2025-03-16 21:54:53,780 INFO L78 Accepts]: Start accepts. Automaton has 8178 states and 11483 transitions. Word has length 232 [2025-03-16 21:54:53,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:53,780 INFO L471 AbstractCegarLoop]: Abstraction has 8178 states and 11483 transitions. [2025-03-16 21:54:53,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:53,780 INFO L276 IsEmpty]: Start isEmpty. Operand 8178 states and 11483 transitions. [2025-03-16 21:54:53,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-16 21:54:53,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:53,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:53,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-16 21:54:53,785 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:53,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:53,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1080696245, now seen corresponding path program 1 times [2025-03-16 21:54:53,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:53,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037484053] [2025-03-16 21:54:53,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:53,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:53,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-16 21:54:53,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-16 21:54:53,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:53,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:54,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:54,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037484053] [2025-03-16 21:54:54,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037484053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:54,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:54,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:54,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716619011] [2025-03-16 21:54:54,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:54,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:54,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:54,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:54,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:54,044 INFO L87 Difference]: Start difference. First operand 8178 states and 11483 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:54,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:54,345 INFO L93 Difference]: Finished difference Result 11230 states and 15794 transitions. [2025-03-16 21:54:54,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:54,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2025-03-16 21:54:54,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:54,351 INFO L225 Difference]: With dead ends: 11230 [2025-03-16 21:54:54,351 INFO L226 Difference]: Without dead ends: 8226 [2025-03-16 21:54:54,354 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-16 21:54:54,354 INFO L435 NwaCegarLoop]: 1407 mSDtfsCounter, 0 mSDsluCounter, 2806 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4213 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:54,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4213 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:54:54,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8226 states. [2025-03-16 21:54:54,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8226 to 8226. [2025-03-16 21:54:54,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8226 states, 8225 states have (on average 1.4019452887537993) internal successors, (11531), 8225 states have internal predecessors, (11531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:54,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8226 states to 8226 states and 11531 transitions. [2025-03-16 21:54:54,406 INFO L78 Accepts]: Start accepts. Automaton has 8226 states and 11531 transitions. Word has length 232 [2025-03-16 21:54:54,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:54,407 INFO L471 AbstractCegarLoop]: Abstraction has 8226 states and 11531 transitions. [2025-03-16 21:54:54,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:54,407 INFO L276 IsEmpty]: Start isEmpty. Operand 8226 states and 11531 transitions. [2025-03-16 21:54:54,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-16 21:54:54,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:54,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-16 21:54:54,413 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:54,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:54,413 INFO L85 PathProgramCache]: Analyzing trace with hash -704388334, now seen corresponding path program 1 times [2025-03-16 21:54:54,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:54,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268890632] [2025-03-16 21:54:54,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:54,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:54,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-16 21:54:54,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-16 21:54:54,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:54,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:54,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:54,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268890632] [2025-03-16 21:54:54,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268890632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:54,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:54,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:54,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741568366] [2025-03-16 21:54:54,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:54,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:54,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:54,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:54,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:54,789 INFO L87 Difference]: Start difference. First operand 8226 states and 11531 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:55,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:55,206 INFO L93 Difference]: Finished difference Result 14896 states and 20816 transitions. [2025-03-16 21:54:55,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:55,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2025-03-16 21:54:55,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:55,214 INFO L225 Difference]: With dead ends: 14896 [2025-03-16 21:54:55,214 INFO L226 Difference]: Without dead ends: 8418 [2025-03-16 21:54:55,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:55,218 INFO L435 NwaCegarLoop]: 1386 mSDtfsCounter, 1590 mSDsluCounter, 2766 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 4152 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:55,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 4152 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:54:55,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8418 states. [2025-03-16 21:54:55,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8418 to 8370. [2025-03-16 21:54:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8370 states, 8369 states have (on average 1.4007647269685746) internal successors, (11723), 8369 states have internal predecessors, (11723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:55,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8370 states to 8370 states and 11723 transitions. [2025-03-16 21:54:55,274 INFO L78 Accepts]: Start accepts. Automaton has 8370 states and 11723 transitions. Word has length 232 [2025-03-16 21:54:55,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:55,275 INFO L471 AbstractCegarLoop]: Abstraction has 8370 states and 11723 transitions. [2025-03-16 21:54:55,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:55,275 INFO L276 IsEmpty]: Start isEmpty. Operand 8370 states and 11723 transitions. [2025-03-16 21:54:55,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-16 21:54:55,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:55,280 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:55,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-16 21:54:55,280 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:55,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:55,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2040454990, now seen corresponding path program 1 times [2025-03-16 21:54:55,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:55,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134469918] [2025-03-16 21:54:55,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:55,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:55,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-16 21:54:55,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-16 21:54:55,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:55,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:55,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:55,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134469918] [2025-03-16 21:54:55,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134469918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:55,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:55,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:55,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546793224] [2025-03-16 21:54:55,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:55,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:55,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:55,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:55,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:55,610 INFO L87 Difference]: Start difference. First operand 8370 states and 11723 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:55,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:55,997 INFO L93 Difference]: Finished difference Result 15568 states and 21736 transitions. [2025-03-16 21:54:55,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:55,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2025-03-16 21:54:55,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:56,005 INFO L225 Difference]: With dead ends: 15568 [2025-03-16 21:54:56,005 INFO L226 Difference]: Without dead ends: 8466 [2025-03-16 21:54:56,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:56,009 INFO L435 NwaCegarLoop]: 1386 mSDtfsCounter, 1596 mSDsluCounter, 2766 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1596 SdHoareTripleChecker+Valid, 4152 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:56,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1596 Valid, 4152 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:54:56,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8466 states. [2025-03-16 21:54:56,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8466 to 8442. [2025-03-16 21:54:56,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8442 states, 8441 states have (on average 1.4001895510010662) internal successors, (11819), 8441 states have internal predecessors, (11819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:56,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8442 states to 8442 states and 11819 transitions. [2025-03-16 21:54:56,065 INFO L78 Accepts]: Start accepts. Automaton has 8442 states and 11819 transitions. Word has length 232 [2025-03-16 21:54:56,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:56,065 INFO L471 AbstractCegarLoop]: Abstraction has 8442 states and 11819 transitions. [2025-03-16 21:54:56,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:56,066 INFO L276 IsEmpty]: Start isEmpty. Operand 8442 states and 11819 transitions. [2025-03-16 21:54:56,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-16 21:54:56,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:56,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:56,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-16 21:54:56,071 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:56,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:56,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1052563280, now seen corresponding path program 1 times [2025-03-16 21:54:56,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:56,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843194778] [2025-03-16 21:54:56,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:56,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:56,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-16 21:54:56,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-16 21:54:56,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:56,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat