./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash bfa28daccead4025689d4acb7ee77b26ba990cc9e83b74a1022dddbf4091a59b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:34:44,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:34:44,313 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:34:44,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:34:44,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:34:44,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:34:44,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:34:44,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:34:44,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:34:44,341 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:34:44,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:34:44,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:34:44,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:34:44,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:34:44,343 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:34:44,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:34:44,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:34:44,343 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:34:44,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:34:44,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:34:44,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:34:44,344 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:34:44,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:34:44,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:34:44,344 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:34:44,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:34:44,344 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:34:44,344 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:34:44,344 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:34:44,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:34:44,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:34:44,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:34:44,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:34:44,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:34:44,345 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:34:44,345 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:34:44,345 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:34:44,345 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:34:44,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:34:44,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:34:44,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:34:44,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:34:44,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:34:44,346 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bfa28daccead4025689d4acb7ee77b26ba990cc9e83b74a1022dddbf4091a59b [2025-03-03 22:34:44,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:34:44,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:34:44,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:34:44,574 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:34:44,574 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:34:44,575 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i [2025-03-03 22:34:45,744 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e76abdcb8/009d240343184fb888f6663ae2462326/FLAG714a29275 [2025-03-03 22:34:45,979 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:34:45,980 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i [2025-03-03 22:34:45,988 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e76abdcb8/009d240343184fb888f6663ae2462326/FLAG714a29275 [2025-03-03 22:34:46,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e76abdcb8/009d240343184fb888f6663ae2462326 [2025-03-03 22:34:46,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:34:46,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:34:46,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:34:46,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:34:46,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:34:46,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:34:46" (1/1) ... [2025-03-03 22:34:46,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e4d841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:46, skipping insertion in model container [2025-03-03 22:34:46,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:34:46" (1/1) ... [2025-03-03 22:34:46,027 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:34:46,135 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i[916,929] [2025-03-03 22:34:46,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:34:46,180 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:34:46,188 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i[916,929] [2025-03-03 22:34:46,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:34:46,224 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:34:46,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:46 WrapperNode [2025-03-03 22:34:46,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:34:46,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:34:46,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:34:46,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:34:46,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:46" (1/1) ... [2025-03-03 22:34:46,242 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:46" (1/1) ... [2025-03-03 22:34:46,271 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2025-03-03 22:34:46,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:34:46,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:34:46,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:34:46,277 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:34:46,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:46" (1/1) ... [2025-03-03 22:34:46,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:46" (1/1) ... [2025-03-03 22:34:46,286 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:46" (1/1) ... [2025-03-03 22:34:46,306 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:34:46,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:46" (1/1) ... [2025-03-03 22:34:46,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:46" (1/1) ... [2025-03-03 22:34:46,316 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:46" (1/1) ... [2025-03-03 22:34:46,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:46" (1/1) ... [2025-03-03 22:34:46,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:46" (1/1) ... [2025-03-03 22:34:46,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:46" (1/1) ... [2025-03-03 22:34:46,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:34:46,329 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:34:46,329 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:34:46,329 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:34:46,330 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:46" (1/1) ... [2025-03-03 22:34:46,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:34:46,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:34:46,358 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:34:46,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:34:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:34:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:34:46,378 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:34:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:34:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:34:46,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:34:46,433 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:34:46,435 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:34:46,663 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L87: havoc property_#t~bitwise13#1;havoc property_#t~bitwise14#1;havoc property_#t~bitwise15#1;havoc property_#t~short16#1; [2025-03-03 22:34:46,684 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-03 22:34:46,684 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:34:46,707 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:34:46,709 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:34:46,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:34:46 BoogieIcfgContainer [2025-03-03 22:34:46,709 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:34:46,711 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:34:46,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:34:46,714 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:34:46,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:34:46" (1/3) ... [2025-03-03 22:34:46,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc708e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:34:46, skipping insertion in model container [2025-03-03 22:34:46,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:46" (2/3) ... [2025-03-03 22:34:46,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc708e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:34:46, skipping insertion in model container [2025-03-03 22:34:46,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:34:46" (3/3) ... [2025-03-03 22:34:46,717 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-33.i [2025-03-03 22:34:46,726 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:34:46,728 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-33.i that has 2 procedures, 68 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:34:46,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:34:46,779 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;@20ead883, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:34:46,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:34:46,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 54 states have internal predecessors, (77), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 22:34:46,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 22:34:46,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:46,791 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:46,791 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:46,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:46,794 INFO L85 PathProgramCache]: Analyzing trace with hash -634190247, now seen corresponding path program 1 times [2025-03-03 22:34:46,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:46,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245062088] [2025-03-03 22:34:46,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:46,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:46,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 22:34:46,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 22:34:46,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:46,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:47,185 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:47,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:47,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245062088] [2025-03-03 22:34:47,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245062088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:47,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:47,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:34:47,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520138878] [2025-03-03 22:34:47,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:47,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:34:47,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:47,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:34:47,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:34:47,209 INFO L87 Difference]: Start difference. First operand has 68 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 54 states have internal predecessors, (77), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:47,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:47,255 INFO L93 Difference]: Finished difference Result 131 states and 211 transitions. [2025-03-03 22:34:47,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:34:47,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2025-03-03 22:34:47,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:47,262 INFO L225 Difference]: With dead ends: 131 [2025-03-03 22:34:47,265 INFO L226 Difference]: Without dead ends: 66 [2025-03-03 22:34:47,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:34:47,269 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:47,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:34:47,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-03 22:34:47,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-03 22:34:47,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 22:34:47,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2025-03-03 22:34:47,299 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 89 [2025-03-03 22:34:47,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:47,302 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2025-03-03 22:34:47,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:47,303 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2025-03-03 22:34:47,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 22:34:47,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:47,305 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:47,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 22:34:47,305 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:47,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:47,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1853322586, now seen corresponding path program 1 times [2025-03-03 22:34:47,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:47,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964466869] [2025-03-03 22:34:47,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:47,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:47,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 22:34:47,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 22:34:47,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:47,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:47,479 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:47,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:47,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964466869] [2025-03-03 22:34:47,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964466869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:47,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:47,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:34:47,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318971375] [2025-03-03 22:34:47,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:47,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:34:47,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:47,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:34:47,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:34:47,484 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:47,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:47,669 INFO L93 Difference]: Finished difference Result 157 states and 232 transitions. [2025-03-03 22:34:47,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:34:47,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2025-03-03 22:34:47,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:47,671 INFO L225 Difference]: With dead ends: 157 [2025-03-03 22:34:47,671 INFO L226 Difference]: Without dead ends: 94 [2025-03-03 22:34:47,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:34:47,672 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 91 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:47,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 305 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:34:47,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-03 22:34:47,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2025-03-03 22:34:47,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 22:34:47,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 99 transitions. [2025-03-03 22:34:47,678 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 99 transitions. Word has length 89 [2025-03-03 22:34:47,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:47,679 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 99 transitions. [2025-03-03 22:34:47,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:47,679 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 99 transitions. [2025-03-03 22:34:47,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 22:34:47,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:47,680 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:47,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:34:47,680 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:47,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:47,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1982405305, now seen corresponding path program 1 times [2025-03-03 22:34:47,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:47,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833089318] [2025-03-03 22:34:47,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:47,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:47,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 22:34:47,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 22:34:47,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:47,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:48,673 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:48,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:48,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833089318] [2025-03-03 22:34:48,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833089318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:48,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:48,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 22:34:48,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003947670] [2025-03-03 22:34:48,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:48,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 22:34:48,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:48,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 22:34:48,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:34:48,674 INFO L87 Difference]: Start difference. First operand 68 states and 99 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:49,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:49,018 INFO L93 Difference]: Finished difference Result 205 states and 300 transitions. [2025-03-03 22:34:49,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 22:34:49,020 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2025-03-03 22:34:49,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:49,021 INFO L225 Difference]: With dead ends: 205 [2025-03-03 22:34:49,021 INFO L226 Difference]: Without dead ends: 140 [2025-03-03 22:34:49,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:34:49,022 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 213 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:49,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 278 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:34:49,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-03 22:34:49,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 92. [2025-03-03 22:34:49,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 78 states have internal predecessors, (111), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 22:34:49,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2025-03-03 22:34:49,033 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 89 [2025-03-03 22:34:49,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:49,033 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2025-03-03 22:34:49,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:49,033 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2025-03-03 22:34:49,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 22:34:49,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:49,035 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:49,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:34:49,036 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:49,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:49,037 INFO L85 PathProgramCache]: Analyzing trace with hash 985332952, now seen corresponding path program 1 times [2025-03-03 22:34:49,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:49,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026201441] [2025-03-03 22:34:49,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:49,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:49,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 22:34:49,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 22:34:49,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:49,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:49,498 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:49,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:49,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026201441] [2025-03-03 22:34:49,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026201441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:49,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:49,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 22:34:49,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847650163] [2025-03-03 22:34:49,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:49,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:34:49,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:49,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:34:49,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:34:49,499 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:49,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:49,744 INFO L93 Difference]: Finished difference Result 213 states and 313 transitions. [2025-03-03 22:34:49,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 22:34:49,745 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2025-03-03 22:34:49,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:49,746 INFO L225 Difference]: With dead ends: 213 [2025-03-03 22:34:49,746 INFO L226 Difference]: Without dead ends: 124 [2025-03-03 22:34:49,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:34:49,748 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 128 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:49,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 218 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:34:49,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-03 22:34:49,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 80. [2025-03-03 22:34:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 66 states have internal predecessors, (93), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 22:34:49,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 117 transitions. [2025-03-03 22:34:49,761 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 117 transitions. Word has length 89 [2025-03-03 22:34:49,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:49,763 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 117 transitions. [2025-03-03 22:34:49,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:49,763 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 117 transitions. [2025-03-03 22:34:49,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 22:34:49,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:49,764 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:49,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:34:49,764 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:49,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:49,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1837593868, now seen corresponding path program 1 times [2025-03-03 22:34:49,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:49,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741508310] [2025-03-03 22:34:49,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:49,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:49,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 22:34:49,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 22:34:49,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:49,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:49,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:49,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741508310] [2025-03-03 22:34:49,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741508310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:49,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:49,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:34:49,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037135587] [2025-03-03 22:34:49,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:49,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:34:49,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:49,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:34:49,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:34:49,811 INFO L87 Difference]: Start difference. First operand 80 states and 117 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:49,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:49,864 INFO L93 Difference]: Finished difference Result 205 states and 301 transitions. [2025-03-03 22:34:49,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:34:49,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2025-03-03 22:34:49,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:49,866 INFO L225 Difference]: With dead ends: 205 [2025-03-03 22:34:49,866 INFO L226 Difference]: Without dead ends: 128 [2025-03-03 22:34:49,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:34:49,868 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 60 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:49,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 193 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:34:49,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-03 22:34:49,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 93. [2025-03-03 22:34:49,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 22:34:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2025-03-03 22:34:49,879 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 90 [2025-03-03 22:34:49,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:49,880 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2025-03-03 22:34:49,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:49,880 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2025-03-03 22:34:49,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 22:34:49,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:49,882 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:49,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 22:34:49,882 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:49,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:49,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1257611783, now seen corresponding path program 1 times [2025-03-03 22:34:49,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:49,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818345198] [2025-03-03 22:34:49,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:49,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:49,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 22:34:49,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 22:34:49,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:49,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:49,925 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:49,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:49,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818345198] [2025-03-03 22:34:49,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818345198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:49,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:49,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:34:49,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988491986] [2025-03-03 22:34:49,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:49,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:34:49,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:49,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:34:49,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:34:49,927 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:49,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:49,965 INFO L93 Difference]: Finished difference Result 216 states and 313 transitions. [2025-03-03 22:34:49,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:34:49,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2025-03-03 22:34:49,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:49,967 INFO L225 Difference]: With dead ends: 216 [2025-03-03 22:34:49,967 INFO L226 Difference]: Without dead ends: 126 [2025-03-03 22:34:49,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:34:49,968 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 81 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:49,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 149 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:34:49,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-03 22:34:49,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 81. [2025-03-03 22:34:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 22:34:49,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2025-03-03 22:34:49,973 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 90 [2025-03-03 22:34:49,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:49,974 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2025-03-03 22:34:49,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:49,974 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2025-03-03 22:34:49,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 22:34:49,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:49,974 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:49,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 22:34:49,975 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:49,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:49,975 INFO L85 PathProgramCache]: Analyzing trace with hash 801091508, now seen corresponding path program 1 times [2025-03-03 22:34:49,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:49,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563608471] [2025-03-03 22:34:49,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:49,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:49,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 22:34:49,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 22:34:49,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:49,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:50,068 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:50,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:50,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563608471] [2025-03-03 22:34:50,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563608471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:50,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:50,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:34:50,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71606140] [2025-03-03 22:34:50,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:50,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:34:50,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:50,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:34:50,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:34:50,071 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:50,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:50,281 INFO L93 Difference]: Finished difference Result 250 states and 351 transitions. [2025-03-03 22:34:50,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 22:34:50,281 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 91 [2025-03-03 22:34:50,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:50,282 INFO L225 Difference]: With dead ends: 250 [2025-03-03 22:34:50,282 INFO L226 Difference]: Without dead ends: 172 [2025-03-03 22:34:50,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:34:50,285 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 207 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:50,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 356 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:34:50,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-03 22:34:50,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 166. [2025-03-03 22:34:50,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 137 states have internal predecessors, (180), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 22:34:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 232 transitions. [2025-03-03 22:34:50,308 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 232 transitions. Word has length 91 [2025-03-03 22:34:50,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:50,308 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 232 transitions. [2025-03-03 22:34:50,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:50,308 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 232 transitions. [2025-03-03 22:34:50,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 22:34:50,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:50,309 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:50,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 22:34:50,309 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:50,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:50,312 INFO L85 PathProgramCache]: Analyzing trace with hash 507688501, now seen corresponding path program 1 times [2025-03-03 22:34:50,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:50,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510943404] [2025-03-03 22:34:50,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:50,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:50,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 22:34:50,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 22:34:50,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:50,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:50,916 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:50,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:50,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510943404] [2025-03-03 22:34:50,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510943404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:50,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:50,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 22:34:50,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924561213] [2025-03-03 22:34:50,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:50,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 22:34:50,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:50,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 22:34:50,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:34:50,919 INFO L87 Difference]: Start difference. First operand 166 states and 232 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:51,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:51,578 INFO L93 Difference]: Finished difference Result 479 states and 669 transitions. [2025-03-03 22:34:51,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:34:51,580 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 91 [2025-03-03 22:34:51,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:51,582 INFO L225 Difference]: With dead ends: 479 [2025-03-03 22:34:51,582 INFO L226 Difference]: Without dead ends: 320 [2025-03-03 22:34:51,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-03-03 22:34:51,584 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 246 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:51,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 424 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 22:34:51,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-03 22:34:51,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 186. [2025-03-03 22:34:51,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 155 states have (on average 1.3483870967741935) internal successors, (209), 157 states have internal predecessors, (209), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 22:34:51,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 261 transitions. [2025-03-03 22:34:51,603 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 261 transitions. Word has length 91 [2025-03-03 22:34:51,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:51,603 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 261 transitions. [2025-03-03 22:34:51,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:51,605 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 261 transitions. [2025-03-03 22:34:51,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 22:34:51,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:51,606 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:51,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 22:34:51,607 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:51,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:51,607 INFO L85 PathProgramCache]: Analyzing trace with hash 98864276, now seen corresponding path program 1 times [2025-03-03 22:34:51,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:51,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109922888] [2025-03-03 22:34:51,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:51,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:51,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 22:34:51,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 22:34:51,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:51,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:51,666 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:51,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:51,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109922888] [2025-03-03 22:34:51,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109922888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:51,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:51,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:34:51,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607698768] [2025-03-03 22:34:51,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:51,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:34:51,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:51,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:34:51,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:34:51,668 INFO L87 Difference]: Start difference. First operand 186 states and 261 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:51,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:51,745 INFO L93 Difference]: Finished difference Result 522 states and 734 transitions. [2025-03-03 22:34:51,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:34:51,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 91 [2025-03-03 22:34:51,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:51,747 INFO L225 Difference]: With dead ends: 522 [2025-03-03 22:34:51,747 INFO L226 Difference]: Without dead ends: 343 [2025-03-03 22:34:51,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:34:51,748 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 64 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:51,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 176 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:34:51,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-03 22:34:51,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 269. [2025-03-03 22:34:51,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 224 states have (on average 1.3348214285714286) internal successors, (299), 226 states have internal predecessors, (299), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 22:34:51,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 375 transitions. [2025-03-03 22:34:51,768 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 375 transitions. Word has length 91 [2025-03-03 22:34:51,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:51,770 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 375 transitions. [2025-03-03 22:34:51,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:51,770 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 375 transitions. [2025-03-03 22:34:51,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 22:34:51,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:51,771 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:51,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 22:34:51,771 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:51,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:51,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1047719725, now seen corresponding path program 1 times [2025-03-03 22:34:51,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:51,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28669499] [2025-03-03 22:34:51,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:51,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:51,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 22:34:51,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 22:34:51,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:51,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:52,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:52,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28669499] [2025-03-03 22:34:52,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28669499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:52,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:52,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 22:34:52,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373405375] [2025-03-03 22:34:52,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:52,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 22:34:52,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:52,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 22:34:52,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:34:52,121 INFO L87 Difference]: Start difference. First operand 269 states and 375 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:52,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:52,389 INFO L93 Difference]: Finished difference Result 583 states and 807 transitions. [2025-03-03 22:34:52,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:34:52,389 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 92 [2025-03-03 22:34:52,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:52,391 INFO L225 Difference]: With dead ends: 583 [2025-03-03 22:34:52,391 INFO L226 Difference]: Without dead ends: 321 [2025-03-03 22:34:52,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:34:52,392 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 163 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:52,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 366 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:34:52,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-03 22:34:52,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 266. [2025-03-03 22:34:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 224 states have (on average 1.25) internal successors, (280), 225 states have internal predecessors, (280), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 22:34:52,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 352 transitions. [2025-03-03 22:34:52,412 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 352 transitions. Word has length 92 [2025-03-03 22:34:52,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:52,412 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 352 transitions. [2025-03-03 22:34:52,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:52,412 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 352 transitions. [2025-03-03 22:34:52,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 22:34:52,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:52,414 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:52,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 22:34:52,414 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:52,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:52,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1387675771, now seen corresponding path program 1 times [2025-03-03 22:34:52,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:52,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459093450] [2025-03-03 22:34:52,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:52,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:52,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 22:34:52,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 22:34:52,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:52,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:52,450 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:52,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:52,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459093450] [2025-03-03 22:34:52,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459093450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:52,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:52,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:34:52,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038422678] [2025-03-03 22:34:52,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:52,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:34:52,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:52,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:34:52,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:34:52,452 INFO L87 Difference]: Start difference. First operand 266 states and 352 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:52,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:52,509 INFO L93 Difference]: Finished difference Result 498 states and 658 transitions. [2025-03-03 22:34:52,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:34:52,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 92 [2025-03-03 22:34:52,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:52,512 INFO L225 Difference]: With dead ends: 498 [2025-03-03 22:34:52,512 INFO L226 Difference]: Without dead ends: 367 [2025-03-03 22:34:52,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:34:52,513 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 68 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:52,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 193 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:34:52,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-03 22:34:52,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365. [2025-03-03 22:34:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 309 states have (on average 1.2362459546925566) internal successors, (382), 310 states have internal predecessors, (382), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 22:34:52,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 478 transitions. [2025-03-03 22:34:52,540 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 478 transitions. Word has length 92 [2025-03-03 22:34:52,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:52,541 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 478 transitions. [2025-03-03 22:34:52,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:52,541 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 478 transitions. [2025-03-03 22:34:52,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 22:34:52,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:52,542 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:52,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 22:34:52,542 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:52,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:52,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1275946218, now seen corresponding path program 1 times [2025-03-03 22:34:52,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:52,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802668830] [2025-03-03 22:34:52,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:52,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:52,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 22:34:52,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 22:34:52,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:52,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:52,569 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:52,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:52,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802668830] [2025-03-03 22:34:52,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802668830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:52,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:52,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:34:52,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74158350] [2025-03-03 22:34:52,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:52,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:34:52,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:52,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:34:52,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:34:52,571 INFO L87 Difference]: Start difference. First operand 365 states and 478 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:52,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:52,626 INFO L93 Difference]: Finished difference Result 666 states and 866 transitions. [2025-03-03 22:34:52,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:34:52,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 92 [2025-03-03 22:34:52,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:52,629 INFO L225 Difference]: With dead ends: 666 [2025-03-03 22:34:52,629 INFO L226 Difference]: Without dead ends: 436 [2025-03-03 22:34:52,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:34:52,630 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 75 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:52,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 160 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:34:52,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-03 22:34:52,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2025-03-03 22:34:52,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 364 states have (on average 1.2115384615384615) internal successors, (441), 365 states have internal predecessors, (441), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 22:34:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 561 transitions. [2025-03-03 22:34:52,655 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 561 transitions. Word has length 92 [2025-03-03 22:34:52,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:52,655 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 561 transitions. [2025-03-03 22:34:52,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:52,655 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 561 transitions. [2025-03-03 22:34:52,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 22:34:52,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:52,656 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:52,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 22:34:52,656 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:52,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:52,661 INFO L85 PathProgramCache]: Analyzing trace with hash 2121651766, now seen corresponding path program 1 times [2025-03-03 22:34:52,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:52,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105343958] [2025-03-03 22:34:52,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:52,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:52,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 22:34:52,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 22:34:52,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:52,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:52,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:52,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105343958] [2025-03-03 22:34:52,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105343958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:52,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:52,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:34:52,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345464745] [2025-03-03 22:34:52,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:52,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:34:52,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:52,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:34:52,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:34:52,729 INFO L87 Difference]: Start difference. First operand 434 states and 561 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:52,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:52,992 INFO L93 Difference]: Finished difference Result 1020 states and 1321 transitions. [2025-03-03 22:34:52,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:34:52,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 92 [2025-03-03 22:34:52,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:52,996 INFO L225 Difference]: With dead ends: 1020 [2025-03-03 22:34:52,996 INFO L226 Difference]: Without dead ends: 721 [2025-03-03 22:34:52,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:34:52,998 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 147 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:52,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 466 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:34:52,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-03-03 22:34:53,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 442. [2025-03-03 22:34:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 372 states have (on average 1.2150537634408602) internal successors, (452), 373 states have internal predecessors, (452), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 22:34:53,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 572 transitions. [2025-03-03 22:34:53,029 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 572 transitions. Word has length 92 [2025-03-03 22:34:53,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:53,030 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 572 transitions. [2025-03-03 22:34:53,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:53,030 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 572 transitions. [2025-03-03 22:34:53,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 22:34:53,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:53,031 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:53,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 22:34:53,032 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:53,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:53,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1828248759, now seen corresponding path program 1 times [2025-03-03 22:34:53,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:53,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932641546] [2025-03-03 22:34:53,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:53,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:53,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 22:34:53,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 22:34:53,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:53,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:53,115 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:53,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:53,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932641546] [2025-03-03 22:34:53,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932641546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:53,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:53,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:34:53,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188541898] [2025-03-03 22:34:53,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:53,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:34:53,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:53,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:34:53,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:34:53,117 INFO L87 Difference]: Start difference. First operand 442 states and 572 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:53,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:53,306 INFO L93 Difference]: Finished difference Result 1065 states and 1392 transitions. [2025-03-03 22:34:53,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:34:53,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 92 [2025-03-03 22:34:53,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:53,312 INFO L225 Difference]: With dead ends: 1065 [2025-03-03 22:34:53,312 INFO L226 Difference]: Without dead ends: 757 [2025-03-03 22:34:53,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:34:53,314 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 153 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:53,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 231 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:34:53,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2025-03-03 22:34:53,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 530. [2025-03-03 22:34:53,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 446 states have (on average 1.2309417040358743) internal successors, (549), 447 states have internal predecessors, (549), 72 states have call successors, (72), 11 states have call predecessors, (72), 11 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:34:53,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 693 transitions. [2025-03-03 22:34:53,364 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 693 transitions. Word has length 92 [2025-03-03 22:34:53,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:53,364 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 693 transitions. [2025-03-03 22:34:53,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:53,365 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 693 transitions. [2025-03-03 22:34:53,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 22:34:53,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:53,366 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:53,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 22:34:53,366 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:53,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:53,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1124579413, now seen corresponding path program 1 times [2025-03-03 22:34:53,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:53,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514262446] [2025-03-03 22:34:53,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:53,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:53,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 22:34:53,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 22:34:53,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:53,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:53,422 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:53,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:53,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514262446] [2025-03-03 22:34:53,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514262446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:53,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:53,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:34:53,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126435147] [2025-03-03 22:34:53,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:53,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:34:53,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:53,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:34:53,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:34:53,424 INFO L87 Difference]: Start difference. First operand 530 states and 693 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:53,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:53,561 INFO L93 Difference]: Finished difference Result 1044 states and 1363 transitions. [2025-03-03 22:34:53,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:34:53,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 92 [2025-03-03 22:34:53,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:53,564 INFO L225 Difference]: With dead ends: 1044 [2025-03-03 22:34:53,564 INFO L226 Difference]: Without dead ends: 540 [2025-03-03 22:34:53,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:34:53,567 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 117 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:53,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 332 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:34:53,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-03 22:34:53,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 536. [2025-03-03 22:34:53,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 452 states have (on average 1.2234513274336283) internal successors, (553), 453 states have internal predecessors, (553), 72 states have call successors, (72), 11 states have call predecessors, (72), 11 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:34:53,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 697 transitions. [2025-03-03 22:34:53,600 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 697 transitions. Word has length 92 [2025-03-03 22:34:53,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:53,600 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 697 transitions. [2025-03-03 22:34:53,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:53,600 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 697 transitions. [2025-03-03 22:34:53,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 22:34:53,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:53,601 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:53,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 22:34:53,601 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:53,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:53,602 INFO L85 PathProgramCache]: Analyzing trace with hash 831176406, now seen corresponding path program 1 times [2025-03-03 22:34:53,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:53,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808050042] [2025-03-03 22:34:53,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:53,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:53,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 22:34:53,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 22:34:53,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:53,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:53,671 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:53,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:53,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808050042] [2025-03-03 22:34:53,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808050042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:53,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:53,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:34:53,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445645547] [2025-03-03 22:34:53,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:53,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:34:53,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:53,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:34:53,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:34:53,673 INFO L87 Difference]: Start difference. First operand 536 states and 697 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:53,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:53,950 INFO L93 Difference]: Finished difference Result 1156 states and 1509 transitions. [2025-03-03 22:34:53,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:34:53,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 92 [2025-03-03 22:34:53,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:53,954 INFO L225 Difference]: With dead ends: 1156 [2025-03-03 22:34:53,954 INFO L226 Difference]: Without dead ends: 758 [2025-03-03 22:34:53,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:34:53,955 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 202 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:53,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 303 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:34:53,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-03-03 22:34:53,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 489. [2025-03-03 22:34:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 405 states have (on average 1.202469135802469) internal successors, (487), 406 states have internal predecessors, (487), 72 states have call successors, (72), 11 states have call predecessors, (72), 11 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:34:54,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 631 transitions. [2025-03-03 22:34:54,001 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 631 transitions. Word has length 92 [2025-03-03 22:34:54,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:54,001 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 631 transitions. [2025-03-03 22:34:54,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:54,001 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 631 transitions. [2025-03-03 22:34:54,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 22:34:54,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:54,002 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:54,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 22:34:54,002 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:54,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:54,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1424015705, now seen corresponding path program 1 times [2025-03-03 22:34:54,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:54,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753672536] [2025-03-03 22:34:54,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:54,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:54,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 22:34:54,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 22:34:54,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:54,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:54,087 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:54,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:54,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753672536] [2025-03-03 22:34:54,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753672536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:54,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:54,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:34:54,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997102346] [2025-03-03 22:34:54,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:54,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:34:54,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:54,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:34:54,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:34:54,088 INFO L87 Difference]: Start difference. First operand 489 states and 631 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:54,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:54,392 INFO L93 Difference]: Finished difference Result 1083 states and 1398 transitions. [2025-03-03 22:34:54,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:34:54,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 93 [2025-03-03 22:34:54,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:54,396 INFO L225 Difference]: With dead ends: 1083 [2025-03-03 22:34:54,396 INFO L226 Difference]: Without dead ends: 620 [2025-03-03 22:34:54,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:34:54,397 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 230 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:54,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 349 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:34:54,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2025-03-03 22:34:54,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 507. [2025-03-03 22:34:54,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 409 states have (on average 1.176039119804401) internal successors, (481), 410 states have internal predecessors, (481), 84 states have call successors, (84), 13 states have call predecessors, (84), 13 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 22:34:54,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 649 transitions. [2025-03-03 22:34:54,434 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 649 transitions. Word has length 93 [2025-03-03 22:34:54,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:54,435 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 649 transitions. [2025-03-03 22:34:54,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:54,435 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 649 transitions. [2025-03-03 22:34:54,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 22:34:54,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:54,436 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:54,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 22:34:54,436 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:54,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:54,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1234942609, now seen corresponding path program 1 times [2025-03-03 22:34:54,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:54,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760269421] [2025-03-03 22:34:54,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:54,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:54,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 22:34:54,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 22:34:54,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:54,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:54,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:54,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760269421] [2025-03-03 22:34:54,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760269421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:54,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:54,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:34:54,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725392216] [2025-03-03 22:34:54,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:54,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:34:54,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:54,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:34:54,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:34:54,490 INFO L87 Difference]: Start difference. First operand 507 states and 649 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:54,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:54,558 INFO L93 Difference]: Finished difference Result 834 states and 1064 transitions. [2025-03-03 22:34:54,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:34:54,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 93 [2025-03-03 22:34:54,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:54,561 INFO L225 Difference]: With dead ends: 834 [2025-03-03 22:34:54,561 INFO L226 Difference]: Without dead ends: 507 [2025-03-03 22:34:54,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:34:54,562 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 20 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:54,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 130 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:34:54,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-03 22:34:54,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 353. [2025-03-03 22:34:54,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 283 states have (on average 1.1590106007067138) internal successors, (328), 284 states have internal predecessors, (328), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 22:34:54,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 448 transitions. [2025-03-03 22:34:54,591 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 448 transitions. Word has length 93 [2025-03-03 22:34:54,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:54,591 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 448 transitions. [2025-03-03 22:34:54,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:54,592 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 448 transitions. [2025-03-03 22:34:54,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 22:34:54,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:54,592 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:54,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 22:34:54,593 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:54,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:54,593 INFO L85 PathProgramCache]: Analyzing trace with hash 390470738, now seen corresponding path program 1 times [2025-03-03 22:34:54,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:54,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694284363] [2025-03-03 22:34:54,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:54,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:54,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 22:34:54,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 22:34:54,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:54,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:54,889 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:54,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:54,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694284363] [2025-03-03 22:34:54,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694284363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:54,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:54,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:34:54,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577456445] [2025-03-03 22:34:54,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:54,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:34:54,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:54,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:34:54,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:34:54,892 INFO L87 Difference]: Start difference. First operand 353 states and 448 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:55,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:55,302 INFO L93 Difference]: Finished difference Result 815 states and 1025 transitions. [2025-03-03 22:34:55,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 22:34:55,302 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 93 [2025-03-03 22:34:55,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:55,304 INFO L225 Difference]: With dead ends: 815 [2025-03-03 22:34:55,304 INFO L226 Difference]: Without dead ends: 488 [2025-03-03 22:34:55,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-03-03 22:34:55,306 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 199 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:55,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 517 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 22:34:55,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-03 22:34:55,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 478. [2025-03-03 22:34:55,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 356 states have (on average 1.1179775280898876) internal successors, (398), 361 states have internal predecessors, (398), 100 states have call successors, (100), 21 states have call predecessors, (100), 21 states have return successors, (100), 95 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 22:34:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 598 transitions. [2025-03-03 22:34:55,348 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 598 transitions. Word has length 93 [2025-03-03 22:34:55,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:55,349 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 598 transitions. [2025-03-03 22:34:55,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:55,349 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 598 transitions. [2025-03-03 22:34:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 22:34:55,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:55,350 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:55,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 22:34:55,350 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:55,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:55,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1566403356, now seen corresponding path program 1 times [2025-03-03 22:34:55,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:55,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044642379] [2025-03-03 22:34:55,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:55,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:55,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 22:34:55,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 22:34:55,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:55,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:55,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:55,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044642379] [2025-03-03 22:34:55,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044642379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:55,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:55,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:34:55,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514347862] [2025-03-03 22:34:55,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:55,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:34:55,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:55,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:34:55,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:34:55,384 INFO L87 Difference]: Start difference. First operand 478 states and 598 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:55,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:55,550 INFO L93 Difference]: Finished difference Result 1029 states and 1290 transitions. [2025-03-03 22:34:55,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:34:55,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 94 [2025-03-03 22:34:55,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:55,554 INFO L225 Difference]: With dead ends: 1029 [2025-03-03 22:34:55,554 INFO L226 Difference]: Without dead ends: 577 [2025-03-03 22:34:55,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:34:55,558 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 70 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:55,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 151 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:34:55,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-03-03 22:34:55,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 483. [2025-03-03 22:34:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 361 states have (on average 1.1191135734072022) internal successors, (404), 366 states have internal predecessors, (404), 100 states have call successors, (100), 21 states have call predecessors, (100), 21 states have return successors, (100), 95 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 22:34:55,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 604 transitions. [2025-03-03 22:34:55,604 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 604 transitions. Word has length 94 [2025-03-03 22:34:55,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:55,604 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 604 transitions. [2025-03-03 22:34:55,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:55,605 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 604 transitions. [2025-03-03 22:34:55,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 22:34:55,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:55,605 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:55,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 22:34:55,606 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:55,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:55,606 INFO L85 PathProgramCache]: Analyzing trace with hash -230548003, now seen corresponding path program 1 times [2025-03-03 22:34:55,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:55,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140466850] [2025-03-03 22:34:55,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:55,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:55,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 22:34:55,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 22:34:55,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:55,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:55,668 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:55,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:55,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140466850] [2025-03-03 22:34:55,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140466850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:55,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:55,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:34:55,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35995057] [2025-03-03 22:34:55,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:55,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:34:55,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:55,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:34:55,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:34:55,670 INFO L87 Difference]: Start difference. First operand 483 states and 604 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:55,898 INFO L93 Difference]: Finished difference Result 1172 states and 1459 transitions. [2025-03-03 22:34:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:34:55,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 94 [2025-03-03 22:34:55,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:55,902 INFO L225 Difference]: With dead ends: 1172 [2025-03-03 22:34:55,902 INFO L226 Difference]: Without dead ends: 715 [2025-03-03 22:34:55,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:34:55,903 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 172 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:55,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 160 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:34:55,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-03-03 22:34:55,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 473. [2025-03-03 22:34:55,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 364 states have (on average 1.1263736263736264) internal successors, (410), 368 states have internal predecessors, (410), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 22:34:55,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 586 transitions. [2025-03-03 22:34:55,973 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 586 transitions. Word has length 94 [2025-03-03 22:34:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:55,973 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 586 transitions. [2025-03-03 22:34:55,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 586 transitions. [2025-03-03 22:34:55,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 22:34:55,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:55,974 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:55,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 22:34:55,974 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:55,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:55,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1014216478, now seen corresponding path program 1 times [2025-03-03 22:34:55,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:55,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888905084] [2025-03-03 22:34:55,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:55,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:55,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 22:34:55,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 22:34:55,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:55,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:56,175 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:56,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:56,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888905084] [2025-03-03 22:34:56,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888905084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:56,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:56,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 22:34:56,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037942240] [2025-03-03 22:34:56,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:56,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:34:56,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:56,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:34:56,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:34:56,177 INFO L87 Difference]: Start difference. First operand 473 states and 586 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:56,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:56,383 INFO L93 Difference]: Finished difference Result 1070 states and 1315 transitions. [2025-03-03 22:34:56,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 22:34:56,384 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 94 [2025-03-03 22:34:56,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:56,386 INFO L225 Difference]: With dead ends: 1070 [2025-03-03 22:34:56,387 INFO L226 Difference]: Without dead ends: 600 [2025-03-03 22:34:56,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:34:56,389 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 127 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:56,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 323 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:34:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-03 22:34:56,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 503. [2025-03-03 22:34:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 394 states have (on average 1.131979695431472) internal successors, (446), 398 states have internal predecessors, (446), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 22:34:56,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 622 transitions. [2025-03-03 22:34:56,434 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 622 transitions. Word has length 94 [2025-03-03 22:34:56,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:56,434 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 622 transitions. [2025-03-03 22:34:56,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:56,434 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 622 transitions. [2025-03-03 22:34:56,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 22:34:56,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:56,435 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:56,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 22:34:56,435 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:56,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:56,435 INFO L85 PathProgramCache]: Analyzing trace with hash -21701423, now seen corresponding path program 1 times [2025-03-03 22:34:56,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:56,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853908001] [2025-03-03 22:34:56,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:56,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:56,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 22:34:56,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 22:34:56,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:56,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:56,573 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:56,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:56,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853908001] [2025-03-03 22:34:56,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853908001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:56,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:56,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 22:34:56,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111732214] [2025-03-03 22:34:56,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:56,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:34:56,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:56,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:34:56,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:34:56,576 INFO L87 Difference]: Start difference. First operand 503 states and 622 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:56,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:56,963 INFO L93 Difference]: Finished difference Result 1075 states and 1336 transitions. [2025-03-03 22:34:56,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 22:34:56,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 95 [2025-03-03 22:34:56,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:56,966 INFO L225 Difference]: With dead ends: 1075 [2025-03-03 22:34:56,966 INFO L226 Difference]: Without dead ends: 575 [2025-03-03 22:34:56,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:34:56,967 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 226 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:56,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 378 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 22:34:56,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-03 22:34:57,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 503. [2025-03-03 22:34:57,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 394 states have (on average 1.1294416243654823) internal successors, (445), 398 states have internal predecessors, (445), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 22:34:57,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 621 transitions. [2025-03-03 22:34:57,012 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 621 transitions. Word has length 95 [2025-03-03 22:34:57,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:57,013 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 621 transitions. [2025-03-03 22:34:57,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:57,013 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 621 transitions. [2025-03-03 22:34:57,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 22:34:57,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:57,014 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:57,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 22:34:57,014 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:57,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:57,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1108982372, now seen corresponding path program 1 times [2025-03-03 22:34:57,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:57,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298973292] [2025-03-03 22:34:57,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:57,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:57,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 22:34:57,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 22:34:57,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:57,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:57,482 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:57,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:57,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298973292] [2025-03-03 22:34:57,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298973292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:57,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:57,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 22:34:57,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682396186] [2025-03-03 22:34:57,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:57,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:34:57,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:57,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:34:57,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:34:57,484 INFO L87 Difference]: Start difference. First operand 503 states and 621 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:57,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:57,759 INFO L93 Difference]: Finished difference Result 1105 states and 1352 transitions. [2025-03-03 22:34:57,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 22:34:57,760 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 95 [2025-03-03 22:34:57,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:57,763 INFO L225 Difference]: With dead ends: 1105 [2025-03-03 22:34:57,763 INFO L226 Difference]: Without dead ends: 605 [2025-03-03 22:34:57,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:34:57,764 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 142 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:57,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 217 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:34:57,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-03 22:34:57,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 481. [2025-03-03 22:34:57,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 372 states have (on average 1.1236559139784945) internal successors, (418), 376 states have internal predecessors, (418), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 22:34:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 594 transitions. [2025-03-03 22:34:57,811 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 594 transitions. Word has length 95 [2025-03-03 22:34:57,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:57,811 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 594 transitions. [2025-03-03 22:34:57,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:57,811 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 594 transitions. [2025-03-03 22:34:57,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 22:34:57,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:57,812 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:57,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 22:34:57,812 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:57,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:57,813 INFO L85 PathProgramCache]: Analyzing trace with hash -866975725, now seen corresponding path program 1 times [2025-03-03 22:34:57,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:57,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170370482] [2025-03-03 22:34:57,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:57,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:57,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 22:34:57,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 22:34:57,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:57,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:57,837 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:57,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:57,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170370482] [2025-03-03 22:34:57,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170370482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:57,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:57,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:34:57,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144799022] [2025-03-03 22:34:57,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:57,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:34:57,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:57,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:34:57,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:34:57,838 INFO L87 Difference]: Start difference. First operand 481 states and 594 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:57,961 INFO L93 Difference]: Finished difference Result 1014 states and 1257 transitions. [2025-03-03 22:34:57,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:34:57,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 95 [2025-03-03 22:34:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:57,967 INFO L225 Difference]: With dead ends: 1014 [2025-03-03 22:34:57,967 INFO L226 Difference]: Without dead ends: 536 [2025-03-03 22:34:57,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:34:57,968 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 58 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:57,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 173 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:34:57,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-03 22:34:58,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 487. [2025-03-03 22:34:58,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 378 states have (on average 1.1243386243386244) internal successors, (425), 382 states have internal predecessors, (425), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 22:34:58,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 601 transitions. [2025-03-03 22:34:58,017 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 601 transitions. Word has length 95 [2025-03-03 22:34:58,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:58,017 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 601 transitions. [2025-03-03 22:34:58,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:58,018 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 601 transitions. [2025-03-03 22:34:58,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 22:34:58,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:58,020 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:58,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 22:34:58,020 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:58,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:58,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1673054492, now seen corresponding path program 1 times [2025-03-03 22:34:58,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:58,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85374049] [2025-03-03 22:34:58,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:58,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:58,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 22:34:58,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 22:34:58,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:58,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:58,047 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:58,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:58,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85374049] [2025-03-03 22:34:58,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85374049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:58,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:58,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:34:58,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143505245] [2025-03-03 22:34:58,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:58,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:34:58,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:58,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:34:58,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:34:58,050 INFO L87 Difference]: Start difference. First operand 487 states and 601 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:58,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:58,155 INFO L93 Difference]: Finished difference Result 1050 states and 1304 transitions. [2025-03-03 22:34:58,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:34:58,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 95 [2025-03-03 22:34:58,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:58,158 INFO L225 Difference]: With dead ends: 1050 [2025-03-03 22:34:58,158 INFO L226 Difference]: Without dead ends: 566 [2025-03-03 22:34:58,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:34:58,159 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 62 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:58,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 137 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:34:58,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-03 22:34:58,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 466. [2025-03-03 22:34:58,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 357 states have (on average 1.112044817927171) internal successors, (397), 361 states have internal predecessors, (397), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 22:34:58,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 573 transitions. [2025-03-03 22:34:58,211 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 573 transitions. Word has length 95 [2025-03-03 22:34:58,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:58,212 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 573 transitions. [2025-03-03 22:34:58,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:58,212 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 573 transitions. [2025-03-03 22:34:58,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 22:34:58,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:58,213 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:58,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 22:34:58,213 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:58,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:58,213 INFO L85 PathProgramCache]: Analyzing trace with hash 873650248, now seen corresponding path program 1 times [2025-03-03 22:34:58,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:58,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164015645] [2025-03-03 22:34:58,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:58,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:58,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 22:34:58,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 22:34:58,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:58,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:58,275 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:58,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:58,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164015645] [2025-03-03 22:34:58,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164015645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:58,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:58,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:34:58,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933711105] [2025-03-03 22:34:58,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:58,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:34:58,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:58,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:34:58,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:34:58,277 INFO L87 Difference]: Start difference. First operand 466 states and 573 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:58,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:58,422 INFO L93 Difference]: Finished difference Result 994 states and 1229 transitions. [2025-03-03 22:34:58,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:34:58,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 96 [2025-03-03 22:34:58,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:58,425 INFO L225 Difference]: With dead ends: 994 [2025-03-03 22:34:58,425 INFO L226 Difference]: Without dead ends: 531 [2025-03-03 22:34:58,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:34:58,428 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 135 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:58,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 368 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:34:58,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-03 22:34:58,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 459. [2025-03-03 22:34:58,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 350 states have (on average 1.1114285714285714) internal successors, (389), 354 states have internal predecessors, (389), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 22:34:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 565 transitions. [2025-03-03 22:34:58,485 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 565 transitions. Word has length 96 [2025-03-03 22:34:58,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:58,486 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 565 transitions. [2025-03-03 22:34:58,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 565 transitions. [2025-03-03 22:34:58,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 22:34:58,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:58,487 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:58,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 22:34:58,487 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:58,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:58,488 INFO L85 PathProgramCache]: Analyzing trace with hash 159375572, now seen corresponding path program 1 times [2025-03-03 22:34:58,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:58,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395846389] [2025-03-03 22:34:58,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:58,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:58,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 22:34:58,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 22:34:58,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:58,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:58,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:58,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395846389] [2025-03-03 22:34:58,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395846389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:58,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:58,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:34:58,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521738291] [2025-03-03 22:34:58,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:58,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:34:58,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:58,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:34:58,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:34:58,542 INFO L87 Difference]: Start difference. First operand 459 states and 565 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:58,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:58,680 INFO L93 Difference]: Finished difference Result 918 states and 1133 transitions. [2025-03-03 22:34:58,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:34:58,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 96 [2025-03-03 22:34:58,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:58,683 INFO L225 Difference]: With dead ends: 918 [2025-03-03 22:34:58,683 INFO L226 Difference]: Without dead ends: 462 [2025-03-03 22:34:58,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:34:58,684 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 78 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:58,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 119 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:34:58,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-03-03 22:34:58,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2025-03-03 22:34:58,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 351 states have (on average 1.1111111111111112) internal successors, (390), 355 states have internal predecessors, (390), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 22:34:58,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 566 transitions. [2025-03-03 22:34:58,729 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 566 transitions. Word has length 96 [2025-03-03 22:34:58,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:58,729 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 566 transitions. [2025-03-03 22:34:58,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:58,730 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 566 transitions. [2025-03-03 22:34:58,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 22:34:58,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:58,730 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:58,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 22:34:58,731 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:58,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:58,731 INFO L85 PathProgramCache]: Analyzing trace with hash 288458291, now seen corresponding path program 1 times [2025-03-03 22:34:58,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:58,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453899032] [2025-03-03 22:34:58,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:58,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:58,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 22:34:58,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 22:34:58,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:58,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:58,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:58,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453899032] [2025-03-03 22:34:58,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453899032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:58,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:58,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:34:58,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924611430] [2025-03-03 22:34:58,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:58,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:34:58,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:58,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:34:58,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:34:58,841 INFO L87 Difference]: Start difference. First operand 460 states and 566 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:59,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:59,307 INFO L93 Difference]: Finished difference Result 1133 states and 1392 transitions. [2025-03-03 22:34:59,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 22:34:59,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 96 [2025-03-03 22:34:59,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:59,313 INFO L225 Difference]: With dead ends: 1133 [2025-03-03 22:34:59,313 INFO L226 Difference]: Without dead ends: 676 [2025-03-03 22:34:59,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:34:59,315 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 233 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:59,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 339 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 22:34:59,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-03-03 22:34:59,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 466. [2025-03-03 22:34:59,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 357 states have (on average 1.1092436974789917) internal successors, (396), 361 states have internal predecessors, (396), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 22:34:59,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 572 transitions. [2025-03-03 22:34:59,403 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 572 transitions. Word has length 96 [2025-03-03 22:34:59,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:59,405 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 572 transitions. [2025-03-03 22:34:59,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 572 transitions. [2025-03-03 22:34:59,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 22:34:59,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:59,407 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:59,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 22:34:59,407 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:59,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:59,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1788751052, now seen corresponding path program 1 times [2025-03-03 22:34:59,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:59,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886625945] [2025-03-03 22:34:59,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:59,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:59,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 22:34:59,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 22:34:59,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:59,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:59,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:59,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886625945] [2025-03-03 22:34:59,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886625945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:59,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:59,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:34:59,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189110805] [2025-03-03 22:34:59,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:59,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:34:59,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:59,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:34:59,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:34:59,530 INFO L87 Difference]: Start difference. First operand 466 states and 572 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:59,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:34:59,819 INFO L93 Difference]: Finished difference Result 1005 states and 1242 transitions. [2025-03-03 22:34:59,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:34:59,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 96 [2025-03-03 22:34:59,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:34:59,823 INFO L225 Difference]: With dead ends: 1005 [2025-03-03 22:34:59,823 INFO L226 Difference]: Without dead ends: 542 [2025-03-03 22:34:59,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:34:59,825 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 127 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:34:59,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 347 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:34:59,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-03 22:34:59,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 459. [2025-03-03 22:34:59,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 350 states have (on average 1.1057142857142856) internal successors, (387), 354 states have internal predecessors, (387), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 22:34:59,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 563 transitions. [2025-03-03 22:34:59,876 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 563 transitions. Word has length 96 [2025-03-03 22:34:59,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:34:59,876 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 563 transitions. [2025-03-03 22:34:59,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:34:59,876 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 563 transitions. [2025-03-03 22:34:59,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 22:34:59,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:34:59,877 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:34:59,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 22:34:59,877 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:34:59,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:34:59,878 INFO L85 PathProgramCache]: Analyzing trace with hash -897106350, now seen corresponding path program 1 times [2025-03-03 22:34:59,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:34:59,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364746568] [2025-03-03 22:34:59,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:34:59,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:34:59,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 22:34:59,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 22:34:59,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:34:59,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:34:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:34:59,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:34:59,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364746568] [2025-03-03 22:34:59,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364746568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:34:59,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:34:59,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:34:59,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573615450] [2025-03-03 22:34:59,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:34:59,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:34:59,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:34:59,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:34:59,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:34:59,944 INFO L87 Difference]: Start difference. First operand 459 states and 563 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:35:00,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:35:00,101 INFO L93 Difference]: Finished difference Result 950 states and 1171 transitions. [2025-03-03 22:35:00,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:35:00,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 97 [2025-03-03 22:35:00,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:35:00,104 INFO L225 Difference]: With dead ends: 950 [2025-03-03 22:35:00,104 INFO L226 Difference]: Without dead ends: 494 [2025-03-03 22:35:00,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:35:00,105 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 128 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:35:00,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 257 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:35:00,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-03-03 22:35:00,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 459. [2025-03-03 22:35:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 350 states have (on average 1.1028571428571428) internal successors, (386), 354 states have internal predecessors, (386), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 22:35:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 562 transitions. [2025-03-03 22:35:00,154 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 562 transitions. Word has length 97 [2025-03-03 22:35:00,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:35:00,155 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 562 transitions. [2025-03-03 22:35:00,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:35:00,155 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 562 transitions. [2025-03-03 22:35:00,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 22:35:00,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:35:00,155 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:35:00,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 22:35:00,156 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:35:00,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:35:00,157 INFO L85 PathProgramCache]: Analyzing trace with hash 456203347, now seen corresponding path program 1 times [2025-03-03 22:35:00,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:35:00,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809711877] [2025-03-03 22:35:00,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:35:00,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:35:00,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 22:35:00,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 22:35:00,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:35:00,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:35:00,224 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:35:00,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:35:00,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809711877] [2025-03-03 22:35:00,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809711877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:35:00,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:35:00,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:35:00,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285843498] [2025-03-03 22:35:00,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:35:00,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:35:00,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:35:00,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:35:00,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:35:00,226 INFO L87 Difference]: Start difference. First operand 459 states and 562 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:35:00,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:35:00,386 INFO L93 Difference]: Finished difference Result 945 states and 1162 transitions. [2025-03-03 22:35:00,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:35:00,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 97 [2025-03-03 22:35:00,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:35:00,389 INFO L225 Difference]: With dead ends: 945 [2025-03-03 22:35:00,389 INFO L226 Difference]: Without dead ends: 489 [2025-03-03 22:35:00,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:35:00,391 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 72 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:35:00,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 261 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:35:00,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-03 22:35:00,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 455. [2025-03-03 22:35:00,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 346 states have (on average 1.0895953757225434) internal successors, (377), 350 states have internal predecessors, (377), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 22:35:00,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 553 transitions. [2025-03-03 22:35:00,442 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 553 transitions. Word has length 97 [2025-03-03 22:35:00,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:35:00,442 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 553 transitions. [2025-03-03 22:35:00,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:35:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 553 transitions. [2025-03-03 22:35:00,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 22:35:00,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:35:00,444 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:35:00,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 22:35:00,444 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:35:00,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:35:00,444 INFO L85 PathProgramCache]: Analyzing trace with hash 585286066, now seen corresponding path program 1 times [2025-03-03 22:35:00,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:35:00,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004799918] [2025-03-03 22:35:00,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:35:00,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:35:00,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 22:35:00,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 22:35:00,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:35:00,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:35:00,936 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:35:00,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:35:00,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004799918] [2025-03-03 22:35:00,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004799918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:35:00,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:35:00,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:35:00,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156509807] [2025-03-03 22:35:00,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:35:00,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:35:00,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:35:00,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:35:00,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:35:00,937 INFO L87 Difference]: Start difference. First operand 455 states and 553 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:35:01,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:35:01,218 INFO L93 Difference]: Finished difference Result 1010 states and 1213 transitions. [2025-03-03 22:35:01,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 22:35:01,218 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 97 [2025-03-03 22:35:01,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:35:01,221 INFO L225 Difference]: With dead ends: 1010 [2025-03-03 22:35:01,221 INFO L226 Difference]: Without dead ends: 558 [2025-03-03 22:35:01,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-03 22:35:01,222 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 47 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:35:01,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 360 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:35:01,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-03-03 22:35:01,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 468. [2025-03-03 22:35:01,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 359 states have (on average 1.0863509749303621) internal successors, (390), 363 states have internal predecessors, (390), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 22:35:01,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 566 transitions. [2025-03-03 22:35:01,273 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 566 transitions. Word has length 97 [2025-03-03 22:35:01,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:35:01,273 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 566 transitions. [2025-03-03 22:35:01,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:35:01,273 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 566 transitions. [2025-03-03 22:35:01,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 22:35:01,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:35:01,274 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:35:01,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 22:35:01,274 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:35:01,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:35:01,275 INFO L85 PathProgramCache]: Analyzing trace with hash 616305873, now seen corresponding path program 1 times [2025-03-03 22:35:01,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:35:01,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487572605] [2025-03-03 22:35:01,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:35:01,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:35:01,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 22:35:01,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 22:35:01,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:35:01,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:35:01,586 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:35:01,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:35:01,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487572605] [2025-03-03 22:35:01,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487572605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:35:01,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:35:01,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 22:35:01,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073706434] [2025-03-03 22:35:01,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:35:01,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 22:35:01,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:35:01,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 22:35:01,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:35:01,588 INFO L87 Difference]: Start difference. First operand 468 states and 566 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:35:01,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:35:01,855 INFO L93 Difference]: Finished difference Result 1024 states and 1226 transitions. [2025-03-03 22:35:01,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:35:01,856 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 97 [2025-03-03 22:35:01,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:35:01,860 INFO L225 Difference]: With dead ends: 1024 [2025-03-03 22:35:01,861 INFO L226 Difference]: Without dead ends: 559 [2025-03-03 22:35:01,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-03 22:35:01,862 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 76 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:35:01,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 455 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:35:01,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-03 22:35:01,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 453. [2025-03-03 22:35:01,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 344 states have (on average 1.0872093023255813) internal successors, (374), 348 states have internal predecessors, (374), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 22:35:01,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 550 transitions. [2025-03-03 22:35:01,910 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 550 transitions. Word has length 97 [2025-03-03 22:35:01,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:35:01,911 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 550 transitions. [2025-03-03 22:35:01,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:35:01,912 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 550 transitions. [2025-03-03 22:35:01,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 22:35:01,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:35:01,912 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:35:01,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 22:35:01,913 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:35:01,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:35:01,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1455865542, now seen corresponding path program 1 times [2025-03-03 22:35:01,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:35:01,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408154879] [2025-03-03 22:35:01,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:35:01,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:35:01,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 22:35:01,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 22:35:01,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:35:01,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:35:02,240 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:35:02,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:35:02,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408154879] [2025-03-03 22:35:02,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408154879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:35:02,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:35:02,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:35:02,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615223351] [2025-03-03 22:35:02,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:35:02,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:35:02,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:35:02,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:35:02,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:35:02,243 INFO L87 Difference]: Start difference. First operand 453 states and 550 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:35:02,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:35:02,724 INFO L93 Difference]: Finished difference Result 527 states and 639 transitions. [2025-03-03 22:35:02,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 22:35:02,724 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2025-03-03 22:35:02,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:35:02,727 INFO L225 Difference]: With dead ends: 527 [2025-03-03 22:35:02,727 INFO L226 Difference]: Without dead ends: 525 [2025-03-03 22:35:02,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-03 22:35:02,727 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 198 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:35:02,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 406 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 22:35:02,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-03 22:35:02,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 459. [2025-03-03 22:35:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 350 states have (on average 1.0914285714285714) internal successors, (382), 354 states have internal predecessors, (382), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 22:35:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 558 transitions. [2025-03-03 22:35:02,776 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 558 transitions. Word has length 98 [2025-03-03 22:35:02,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:35:02,776 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 558 transitions. [2025-03-03 22:35:02,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:35:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 558 transitions. [2025-03-03 22:35:02,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 22:35:02,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:35:02,777 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:35:02,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 22:35:02,777 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:35:02,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:35:02,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1429791182, now seen corresponding path program 1 times [2025-03-03 22:35:02,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:35:02,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99166642] [2025-03-03 22:35:02,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:35:02,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:35:02,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 22:35:02,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 22:35:02,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:35:02,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:35:02,883 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:35:02,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:35:02,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99166642] [2025-03-03 22:35:02,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99166642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:35:02,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:35:02,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:35:02,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734095479] [2025-03-03 22:35:02,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:35:02,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:35:02,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:35:02,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:35:02,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:35:02,885 INFO L87 Difference]: Start difference. First operand 459 states and 558 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:35:03,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:35:03,301 INFO L93 Difference]: Finished difference Result 1130 states and 1370 transitions. [2025-03-03 22:35:03,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 22:35:03,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 101 [2025-03-03 22:35:03,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:35:03,309 INFO L225 Difference]: With dead ends: 1130 [2025-03-03 22:35:03,309 INFO L226 Difference]: Without dead ends: 674 [2025-03-03 22:35:03,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:35:03,311 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 209 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:35:03,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 332 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:35:03,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-03-03 22:35:03,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 477. [2025-03-03 22:35:03,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 368 states have (on average 1.0896739130434783) internal successors, (401), 372 states have internal predecessors, (401), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 22:35:03,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 577 transitions. [2025-03-03 22:35:03,363 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 577 transitions. Word has length 101 [2025-03-03 22:35:03,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:35:03,363 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 577 transitions. [2025-03-03 22:35:03,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:35:03,363 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 577 transitions. [2025-03-03 22:35:03,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 22:35:03,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:35:03,364 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:35:03,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 22:35:03,364 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:35:03,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:35:03,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1441107309, now seen corresponding path program 1 times [2025-03-03 22:35:03,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:35:03,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266920380] [2025-03-03 22:35:03,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:35:03,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:35:03,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 22:35:03,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 22:35:03,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:35:03,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:35:03,472 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:35:03,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:35:03,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266920380] [2025-03-03 22:35:03,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266920380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:35:03,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:35:03,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:35:03,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622049712] [2025-03-03 22:35:03,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:35:03,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:35:03,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:35:03,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:35:03,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:35:03,474 INFO L87 Difference]: Start difference. First operand 477 states and 577 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:35:03,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:35:03,719 INFO L93 Difference]: Finished difference Result 1020 states and 1242 transitions. [2025-03-03 22:35:03,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:35:03,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 101 [2025-03-03 22:35:03,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:35:03,722 INFO L225 Difference]: With dead ends: 1020 [2025-03-03 22:35:03,722 INFO L226 Difference]: Without dead ends: 546 [2025-03-03 22:35:03,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:35:03,723 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 108 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:35:03,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 346 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:35:03,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-03-03 22:35:03,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 459. [2025-03-03 22:35:03,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 350 states have (on average 1.0885714285714285) internal successors, (381), 354 states have internal predecessors, (381), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 22:35:03,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 557 transitions. [2025-03-03 22:35:03,774 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 557 transitions. Word has length 101 [2025-03-03 22:35:03,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:35:03,775 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 557 transitions. [2025-03-03 22:35:03,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:35:03,775 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 557 transitions. [2025-03-03 22:35:03,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 22:35:03,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:35:03,775 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:35:03,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 22:35:03,776 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:35:03,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:35:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1374719253, now seen corresponding path program 1 times [2025-03-03 22:35:03,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:35:03,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559281332] [2025-03-03 22:35:03,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:35:03,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:35:03,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 22:35:03,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 22:35:03,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:35:03,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:35:04,064 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:35:04,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:35:04,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559281332] [2025-03-03 22:35:04,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559281332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:35:04,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:35:04,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:35:04,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802019553] [2025-03-03 22:35:04,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:35:04,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:35:04,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:35:04,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:35:04,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:35:04,066 INFO L87 Difference]: Start difference. First operand 459 states and 557 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:35:04,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:35:04,344 INFO L93 Difference]: Finished difference Result 491 states and 599 transitions. [2025-03-03 22:35:04,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 22:35:04,344 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2025-03-03 22:35:04,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:35:04,347 INFO L225 Difference]: With dead ends: 491 [2025-03-03 22:35:04,347 INFO L226 Difference]: Without dead ends: 489 [2025-03-03 22:35:04,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-03 22:35:04,347 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 123 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:35:04,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 350 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:35:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-03 22:35:04,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 454. [2025-03-03 22:35:04,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 345 states have (on average 1.0869565217391304) internal successors, (375), 349 states have internal predecessors, (375), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 22:35:04,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 551 transitions. [2025-03-03 22:35:04,395 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 551 transitions. Word has length 102 [2025-03-03 22:35:04,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:35:04,395 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 551 transitions. [2025-03-03 22:35:04,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:35:04,395 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 551 transitions. [2025-03-03 22:35:04,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-03 22:35:04,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:35:04,397 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:35:04,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 22:35:04,397 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:35:04,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:35:04,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1712751752, now seen corresponding path program 1 times [2025-03-03 22:35:04,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:35:04,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111256857] [2025-03-03 22:35:04,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:35:04,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:35:04,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 22:35:04,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 22:35:04,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:35:04,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:35:04,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1141 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:35:04,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:35:04,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111256857] [2025-03-03 22:35:04,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111256857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:35:04,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:35:04,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:35:04,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673475805] [2025-03-03 22:35:04,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:35:04,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:35:04,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:35:04,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:35:04,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:35:04,524 INFO L87 Difference]: Start difference. First operand 454 states and 551 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 22:35:04,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:35:04,735 INFO L93 Difference]: Finished difference Result 1338 states and 1611 transitions. [2025-03-03 22:35:04,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:35:04,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 180 [2025-03-03 22:35:04,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:35:04,739 INFO L225 Difference]: With dead ends: 1338 [2025-03-03 22:35:04,739 INFO L226 Difference]: Without dead ends: 887 [2025-03-03 22:35:04,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:35:04,741 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 137 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:35:04,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 188 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:35:04,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2025-03-03 22:35:04,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 454. [2025-03-03 22:35:04,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 345 states have (on average 1.0869565217391304) internal successors, (375), 349 states have internal predecessors, (375), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 22:35:04,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 551 transitions. [2025-03-03 22:35:04,799 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 551 transitions. Word has length 180 [2025-03-03 22:35:04,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:35:04,799 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 551 transitions. [2025-03-03 22:35:04,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 22:35:04,799 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 551 transitions. [2025-03-03 22:35:04,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 22:35:04,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:35:04,801 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:35:04,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 22:35:04,801 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:35:04,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:35:04,802 INFO L85 PathProgramCache]: Analyzing trace with hash 153176839, now seen corresponding path program 1 times [2025-03-03 22:35:04,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:35:04,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100439901] [2025-03-03 22:35:04,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:35:04,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:35:04,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 22:35:04,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 22:35:04,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:35:04,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:35:05,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1141 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2025-03-03 22:35:05,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:35:05,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100439901] [2025-03-03 22:35:05,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100439901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:35:05,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:35:05,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 22:35:05,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899489772] [2025-03-03 22:35:05,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:35:05,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 22:35:05,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:35:05,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 22:35:05,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:35:05,119 INFO L87 Difference]: Start difference. First operand 454 states and 551 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:35:05,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:35:05,424 INFO L93 Difference]: Finished difference Result 901 states and 1095 transitions. [2025-03-03 22:35:05,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 22:35:05,425 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 181 [2025-03-03 22:35:05,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:35:05,426 INFO L225 Difference]: With dead ends: 901 [2025-03-03 22:35:05,426 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 22:35:05,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-03 22:35:05,428 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 165 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:35:05,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 174 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:35:05,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 22:35:05,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 22:35:05,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 22:35:05,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 22:35:05,429 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 181 [2025-03-03 22:35:05,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:35:05,429 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 22:35:05,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:35:05,429 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 22:35:05,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 22:35:05,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:35:05,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 22:35:05,435 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-03 22:35:05,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 22:35:24,666 WARN L286 SmtUtils]: Spent 18.94s on a formula simplification. DAG size of input: 106 DAG size of output: 173 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-03 22:35:44,643 WARN L286 SmtUtils]: Spent 18.65s on a formula simplification. DAG size of input: 106 DAG size of output: 173 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-03 22:35:51,168 WARN L286 SmtUtils]: Spent 6.52s on a formula simplification. DAG size of input: 98 DAG size of output: 131 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-03 22:35:57,797 WARN L286 SmtUtils]: Spent 6.55s on a formula simplification. DAG size of input: 98 DAG size of output: 131 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-03 22:36:16,551 WARN L286 SmtUtils]: Spent 18.72s on a formula simplification. DAG size of input: 106 DAG size of output: 173 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)