./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-81.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_fillercode_fillercodestructure_filler-ps-ci_file-81.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 2913f965e0d9fa4df5794a69da1eb9ae7e20a4f8b2461420582f4690c4751bfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:43:24,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:43:24,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:43:24,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:43:24,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:43:24,395 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:43:24,396 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:43:24,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:43:24,396 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:43:24,396 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:43:24,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:43:24,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:43:24,396 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:43:24,396 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:43:24,396 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:43:24,397 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:43:24,397 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:43:24,397 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:43:24,397 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:43:24,397 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:43:24,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:43:24,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:43:24,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:43:24,397 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:43:24,397 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:43:24,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:43:24,397 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:43:24,397 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:43:24,397 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:43:24,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:43:24,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:43:24,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:43:24,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:43:24,398 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:43:24,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:43:24,398 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:43:24,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:43:24,398 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:43:24,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:43:24,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:43:24,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:43:24,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:43:24,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:43:24,398 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 -> 2913f965e0d9fa4df5794a69da1eb9ae7e20a4f8b2461420582f4690c4751bfe [2025-03-03 21:43:24,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:43:24,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:43:24,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:43:24,634 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:43:24,634 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:43:24,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-81.i [2025-03-03 21:43:25,756 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40d53f2db/96eb07c46f7b4f5ebd7903972e34e421/FLAG861629dd2 [2025-03-03 21:43:26,035 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:43:26,036 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-81.i [2025-03-03 21:43:26,047 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40d53f2db/96eb07c46f7b4f5ebd7903972e34e421/FLAG861629dd2 [2025-03-03 21:43:26,062 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40d53f2db/96eb07c46f7b4f5ebd7903972e34e421 [2025-03-03 21:43:26,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:43:26,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:43:26,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:43:26,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:43:26,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:43:26,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:43:26" (1/1) ... [2025-03-03 21:43:26,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61850395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26, skipping insertion in model container [2025-03-03 21:43:26,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:43:26" (1/1) ... [2025-03-03 21:43:26,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:43:26,183 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_fillercode_fillercodestructure_filler-ps-ci_file-81.i[919,932] [2025-03-03 21:43:26,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:43:26,251 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:43:26,259 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_fillercode_fillercodestructure_filler-ps-ci_file-81.i[919,932] [2025-03-03 21:43:26,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:43:26,306 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:43:26,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26 WrapperNode [2025-03-03 21:43:26,306 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:43:26,307 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:43:26,307 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:43:26,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:43:26,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (1/1) ... [2025-03-03 21:43:26,322 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (1/1) ... [2025-03-03 21:43:26,363 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 247 [2025-03-03 21:43:26,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:43:26,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:43:26,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:43:26,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:43:26,370 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (1/1) ... [2025-03-03 21:43:26,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (1/1) ... [2025-03-03 21:43:26,377 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (1/1) ... [2025-03-03 21:43:26,397 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 21:43:26,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (1/1) ... [2025-03-03 21:43:26,400 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (1/1) ... [2025-03-03 21:43:26,410 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (1/1) ... [2025-03-03 21:43:26,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (1/1) ... [2025-03-03 21:43:26,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (1/1) ... [2025-03-03 21:43:26,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (1/1) ... [2025-03-03 21:43:26,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:43:26,423 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:43:26,423 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:43:26,424 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:43:26,424 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (1/1) ... [2025-03-03 21:43:26,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:43:26,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:43:26,448 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 21:43:26,451 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 21:43:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:43:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:43:26,465 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:43:26,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:43:26,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:43:26,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:43:26,525 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:43:26,526 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:43:26,881 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L187: havoc property_#t~bitwise25#1;havoc property_#t~short26#1; [2025-03-03 21:43:26,916 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 21:43:26,916 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:43:26,936 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:43:26,937 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:43:26,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:43:26 BoogieIcfgContainer [2025-03-03 21:43:26,937 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:43:26,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:43:26,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:43:26,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:43:26,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:43:26" (1/3) ... [2025-03-03 21:43:26,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ca0b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:43:26, skipping insertion in model container [2025-03-03 21:43:26,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (2/3) ... [2025-03-03 21:43:26,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ca0b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:43:26, skipping insertion in model container [2025-03-03 21:43:26,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:43:26" (3/3) ... [2025-03-03 21:43:26,943 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-81.i [2025-03-03 21:43:26,953 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:43:26,954 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-81.i that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:43:26,994 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:43:27,003 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;@cb9c031, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:43:27,004 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:43:27,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 72 states have internal predecessors, (104), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 21:43:27,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-03 21:43:27,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:27,018 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:43:27,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:27,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:27,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1551107637, now seen corresponding path program 1 times [2025-03-03 21:43:27,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:43:27,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132301372] [2025-03-03 21:43:27,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:27,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:43:27,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 21:43:27,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 21:43:27,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:27,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:27,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-03 21:43:27,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:43:27,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132301372] [2025-03-03 21:43:27,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132301372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:43:27,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912160376] [2025-03-03 21:43:27,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:27,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:43:27,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:43:27,369 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:43:27,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 21:43:27,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 21:43:27,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 21:43:27,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:27,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:27,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:43:27,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:43:27,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-03 21:43:27,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:43:27,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912160376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:43:27,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:43:27,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:43:27,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567163524] [2025-03-03 21:43:27,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:43:27,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:43:27,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:43:27,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:43:27,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:43:27,555 INFO L87 Difference]: Start difference. First operand has 105 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 72 states have internal predecessors, (104), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:43:27,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:27,581 INFO L93 Difference]: Finished difference Result 204 states and 358 transitions. [2025-03-03 21:43:27,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:43:27,583 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 202 [2025-03-03 21:43:27,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:27,587 INFO L225 Difference]: With dead ends: 204 [2025-03-03 21:43:27,588 INFO L226 Difference]: Without dead ends: 102 [2025-03-03 21:43:27,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:43:27,592 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:27,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:43:27,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-03 21:43:27,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-03 21:43:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 69 states have (on average 1.434782608695652) internal successors, (99), 69 states have internal predecessors, (99), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 21:43:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 161 transitions. [2025-03-03 21:43:27,625 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 161 transitions. Word has length 202 [2025-03-03 21:43:27,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:27,626 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 161 transitions. [2025-03-03 21:43:27,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:43:27,626 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 161 transitions. [2025-03-03 21:43:27,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-03 21:43:27,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:27,630 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:43:27,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 21:43:27,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 21:43:27,831 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:27,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:27,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1892852102, now seen corresponding path program 1 times [2025-03-03 21:43:27,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:43:27,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221866663] [2025-03-03 21:43:27,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:27,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:43:27,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 21:43:27,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 21:43:27,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:27,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:28,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:43:28,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:43:28,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221866663] [2025-03-03 21:43:28,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221866663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:43:28,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:43:28,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:43:28,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003211013] [2025-03-03 21:43:28,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:43:28,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:43:28,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:43:28,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:43:28,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:43:28,144 INFO L87 Difference]: Start difference. First operand 102 states and 161 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:43:28,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:28,213 INFO L93 Difference]: Finished difference Result 283 states and 453 transitions. [2025-03-03 21:43:28,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:43:28,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-03-03 21:43:28,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:28,216 INFO L225 Difference]: With dead ends: 283 [2025-03-03 21:43:28,216 INFO L226 Difference]: Without dead ends: 184 [2025-03-03 21:43:28,217 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 21:43:28,220 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 76 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:28,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 291 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:43:28,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-03 21:43:28,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 169. [2025-03-03 21:43:28,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 104 states have internal predecessors, (142), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-03 21:43:28,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 266 transitions. [2025-03-03 21:43:28,257 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 266 transitions. Word has length 202 [2025-03-03 21:43:28,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:28,257 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 266 transitions. [2025-03-03 21:43:28,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:43:28,257 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 266 transitions. [2025-03-03 21:43:28,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 21:43:28,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:28,259 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:43:28,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:43:28,260 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:28,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:28,260 INFO L85 PathProgramCache]: Analyzing trace with hash 762052910, now seen corresponding path program 1 times [2025-03-03 21:43:28,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:43:28,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312728003] [2025-03-03 21:43:28,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:28,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:43:28,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 21:43:28,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 21:43:28,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:28,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:28,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:43:28,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:43:28,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312728003] [2025-03-03 21:43:28,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312728003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:43:28,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:43:28,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:43:28,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930901813] [2025-03-03 21:43:28,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:43:28,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:43:28,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:43:28,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:43:28,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:43:28,461 INFO L87 Difference]: Start difference. First operand 169 states and 266 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:43:28,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:28,593 INFO L93 Difference]: Finished difference Result 399 states and 625 transitions. [2025-03-03 21:43:28,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:43:28,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2025-03-03 21:43:28,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:28,596 INFO L225 Difference]: With dead ends: 399 [2025-03-03 21:43:28,596 INFO L226 Difference]: Without dead ends: 300 [2025-03-03 21:43:28,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 21:43:28,598 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 178 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:28,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 362 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:43:28,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-03 21:43:28,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 273. [2025-03-03 21:43:28,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 202 states have (on average 1.4851485148514851) internal successors, (300), 203 states have internal predecessors, (300), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 21:43:28,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 432 transitions. [2025-03-03 21:43:28,620 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 432 transitions. Word has length 204 [2025-03-03 21:43:28,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:28,620 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 432 transitions. [2025-03-03 21:43:28,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:43:28,621 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 432 transitions. [2025-03-03 21:43:28,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 21:43:28,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:28,625 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:43:28,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:43:28,625 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:28,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:28,628 INFO L85 PathProgramCache]: Analyzing trace with hash 565539405, now seen corresponding path program 1 times [2025-03-03 21:43:28,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:43:28,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358717901] [2025-03-03 21:43:28,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:28,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:43:28,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 21:43:28,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 21:43:28,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:28,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:28,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:43:28,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:43:28,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358717901] [2025-03-03 21:43:28,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358717901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:43:28,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:43:28,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:43:28,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134071363] [2025-03-03 21:43:28,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:43:28,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:43:28,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:43:28,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:43:28,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:43:28,848 INFO L87 Difference]: Start difference. First operand 273 states and 432 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:43:28,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:28,924 INFO L93 Difference]: Finished difference Result 505 states and 807 transitions. [2025-03-03 21:43:28,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:43:28,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2025-03-03 21:43:28,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:28,931 INFO L225 Difference]: With dead ends: 505 [2025-03-03 21:43:28,931 INFO L226 Difference]: Without dead ends: 317 [2025-03-03 21:43:28,933 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 21:43:28,934 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 74 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:28,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 436 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:43:28,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-03 21:43:28,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 273. [2025-03-03 21:43:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 202 states have (on average 1.4702970297029703) internal successors, (297), 203 states have internal predecessors, (297), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 21:43:28,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 429 transitions. [2025-03-03 21:43:28,975 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 429 transitions. Word has length 204 [2025-03-03 21:43:28,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:28,976 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 429 transitions. [2025-03-03 21:43:28,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:43:28,976 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 429 transitions. [2025-03-03 21:43:28,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-03 21:43:28,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:28,979 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:43:28,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:43:28,980 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:28,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:28,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1850823708, now seen corresponding path program 1 times [2025-03-03 21:43:28,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:43:28,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188952055] [2025-03-03 21:43:28,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:28,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:43:28,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-03 21:43:29,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-03 21:43:29,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:29,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:29,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:43:29,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:43:29,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188952055] [2025-03-03 21:43:29,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188952055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:43:29,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:43:29,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:43:29,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618053962] [2025-03-03 21:43:29,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:43:29,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:43:29,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:43:29,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:43:29,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:43:29,394 INFO L87 Difference]: Start difference. First operand 273 states and 429 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:43:29,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:29,535 INFO L93 Difference]: Finished difference Result 504 states and 789 transitions. [2025-03-03 21:43:29,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:43:29,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-03-03 21:43:29,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:29,538 INFO L225 Difference]: With dead ends: 504 [2025-03-03 21:43:29,538 INFO L226 Difference]: Without dead ends: 307 [2025-03-03 21:43:29,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:43:29,539 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 74 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:29,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 489 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:43:29,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-03 21:43:29,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 255. [2025-03-03 21:43:29,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 188 states have (on average 1.425531914893617) internal successors, (268), 188 states have internal predecessors, (268), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-03 21:43:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 392 transitions. [2025-03-03 21:43:29,565 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 392 transitions. Word has length 205 [2025-03-03 21:43:29,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:29,566 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 392 transitions. [2025-03-03 21:43:29,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:43:29,566 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 392 transitions. [2025-03-03 21:43:29,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-03 21:43:29,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:29,570 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:43:29,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:43:29,570 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:29,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:29,572 INFO L85 PathProgramCache]: Analyzing trace with hash 843705734, now seen corresponding path program 1 times [2025-03-03 21:43:29,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:43:29,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861011034] [2025-03-03 21:43:29,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:29,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:43:29,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-03 21:43:29,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-03 21:43:29,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:29,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:43:41,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:43:41,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861011034] [2025-03-03 21:43:41,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861011034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:43:41,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:43:41,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 21:43:41,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891900766] [2025-03-03 21:43:41,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:43:41,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 21:43:41,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:43:41,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 21:43:41,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:43:41,368 INFO L87 Difference]: Start difference. First operand 255 states and 392 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:43:44,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:44,675 INFO L93 Difference]: Finished difference Result 721 states and 1088 transitions. [2025-03-03 21:43:44,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 21:43:44,675 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 205 [2025-03-03 21:43:44,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:44,678 INFO L225 Difference]: With dead ends: 721 [2025-03-03 21:43:44,678 INFO L226 Difference]: Without dead ends: 559 [2025-03-03 21:43:44,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=217, Invalid=539, Unknown=0, NotChecked=0, Total=756 [2025-03-03 21:43:44,679 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 559 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:44,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 1095 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 21:43:44,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-03 21:43:44,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 387. [2025-03-03 21:43:44,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 307 states have (on average 1.4397394136807817) internal successors, (442), 308 states have internal predecessors, (442), 72 states have call successors, (72), 7 states have call predecessors, (72), 7 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 21:43:44,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 586 transitions. [2025-03-03 21:43:44,696 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 586 transitions. Word has length 205 [2025-03-03 21:43:44,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:44,697 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 586 transitions. [2025-03-03 21:43:44,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:43:44,697 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 586 transitions. [2025-03-03 21:43:44,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-03 21:43:44,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:44,699 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:43:44,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:43:44,699 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:44,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:44,699 INFO L85 PathProgramCache]: Analyzing trace with hash 972788453, now seen corresponding path program 1 times [2025-03-03 21:43:44,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:43:44,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312153256] [2025-03-03 21:43:44,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:44,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:43:44,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-03 21:43:44,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-03 21:43:44,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:44,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:45,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:43:45,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:43:45,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312153256] [2025-03-03 21:43:45,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312153256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:43:45,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:43:45,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 21:43:45,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383824244] [2025-03-03 21:43:45,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:43:45,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 21:43:45,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:43:45,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 21:43:45,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:43:45,650 INFO L87 Difference]: Start difference. First operand 387 states and 586 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:43:47,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:47,146 INFO L93 Difference]: Finished difference Result 814 states and 1222 transitions. [2025-03-03 21:43:47,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 21:43:47,146 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 205 [2025-03-03 21:43:47,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:47,149 INFO L225 Difference]: With dead ends: 814 [2025-03-03 21:43:47,149 INFO L226 Difference]: Without dead ends: 614 [2025-03-03 21:43:47,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2025-03-03 21:43:47,150 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 733 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:47,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 934 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 21:43:47,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-03-03 21:43:47,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 451. [2025-03-03 21:43:47,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 370 states have (on average 1.4513513513513514) internal successors, (537), 371 states have internal predecessors, (537), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 21:43:47,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 681 transitions. [2025-03-03 21:43:47,170 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 681 transitions. Word has length 205 [2025-03-03 21:43:47,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:47,170 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 681 transitions. [2025-03-03 21:43:47,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:43:47,170 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 681 transitions. [2025-03-03 21:43:47,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-03 21:43:47,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:47,172 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:43:47,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:43:47,172 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:47,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:47,172 INFO L85 PathProgramCache]: Analyzing trace with hash 467229828, now seen corresponding path program 1 times [2025-03-03 21:43:47,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:43:47,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444576238] [2025-03-03 21:43:47,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:47,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:43:47,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-03 21:43:47,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-03 21:43:47,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:47,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:47,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:43:47,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:43:47,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444576238] [2025-03-03 21:43:47,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444576238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:43:47,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:43:47,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 21:43:47,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882640991] [2025-03-03 21:43:47,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:43:47,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:43:47,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:43:47,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:43:47,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:43:47,887 INFO L87 Difference]: Start difference. First operand 451 states and 681 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:43:48,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:48,655 INFO L93 Difference]: Finished difference Result 738 states and 1116 transitions. [2025-03-03 21:43:48,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 21:43:48,655 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 205 [2025-03-03 21:43:48,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:48,658 INFO L225 Difference]: With dead ends: 738 [2025-03-03 21:43:48,658 INFO L226 Difference]: Without dead ends: 538 [2025-03-03 21:43:48,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2025-03-03 21:43:48,661 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 487 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:48,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 774 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:43:48,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-03 21:43:48,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 437. [2025-03-03 21:43:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 356 states have (on average 1.446629213483146) internal successors, (515), 357 states have internal predecessors, (515), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 21:43:48,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 659 transitions. [2025-03-03 21:43:48,695 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 659 transitions. Word has length 205 [2025-03-03 21:43:48,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:48,697 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 659 transitions. [2025-03-03 21:43:48,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:43:48,697 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 659 transitions. [2025-03-03 21:43:48,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 21:43:48,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:48,700 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:43:48,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 21:43:48,700 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:48,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:48,701 INFO L85 PathProgramCache]: Analyzing trace with hash 975372336, now seen corresponding path program 1 times [2025-03-03 21:43:48,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:43:48,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480238191] [2025-03-03 21:43:48,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:48,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:43:48,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 21:43:48,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 21:43:48,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:48,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:43:54,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:43:54,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480238191] [2025-03-03 21:43:54,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480238191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:43:54,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:43:54,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 21:43:54,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146667955] [2025-03-03 21:43:54,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:43:54,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 21:43:54,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:43:54,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 21:43:54,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:43:54,084 INFO L87 Difference]: Start difference. First operand 437 states and 659 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:43:55,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:55,446 INFO L93 Difference]: Finished difference Result 741 states and 1111 transitions. [2025-03-03 21:43:55,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:43:55,447 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-03 21:43:55,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:55,449 INFO L225 Difference]: With dead ends: 741 [2025-03-03 21:43:55,449 INFO L226 Difference]: Without dead ends: 551 [2025-03-03 21:43:55,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:43:55,450 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 198 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:55,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 522 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:43:55,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-03 21:43:55,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 473. [2025-03-03 21:43:55,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 392 states have (on average 1.4489795918367347) internal successors, (568), 393 states have internal predecessors, (568), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 21:43:55,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 712 transitions. [2025-03-03 21:43:55,475 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 712 transitions. Word has length 206 [2025-03-03 21:43:55,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:55,475 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 712 transitions. [2025-03-03 21:43:55,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:43:55,475 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 712 transitions. [2025-03-03 21:43:55,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 21:43:55,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:55,478 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:43:55,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 21:43:55,478 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:55,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:55,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1104455055, now seen corresponding path program 1 times [2025-03-03 21:43:55,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:43:55,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084388883] [2025-03-03 21:43:55,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:55,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:43:55,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 21:43:55,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 21:43:55,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:55,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:43:56,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:43:56,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084388883] [2025-03-03 21:43:56,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084388883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:43:56,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:43:56,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 21:43:56,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90758649] [2025-03-03 21:43:56,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:43:56,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 21:43:56,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:43:56,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 21:43:56,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:43:56,224 INFO L87 Difference]: Start difference. First operand 473 states and 712 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:43:57,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:57,016 INFO L93 Difference]: Finished difference Result 1093 states and 1643 transitions. [2025-03-03 21:43:57,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:43:57,016 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 206 [2025-03-03 21:43:57,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:57,019 INFO L225 Difference]: With dead ends: 1093 [2025-03-03 21:43:57,019 INFO L226 Difference]: Without dead ends: 839 [2025-03-03 21:43:57,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:43:57,021 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 510 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:57,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 688 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:43:57,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2025-03-03 21:43:57,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 549. [2025-03-03 21:43:57,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 468 states have (on average 1.4423076923076923) internal successors, (675), 469 states have internal predecessors, (675), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 21:43:57,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 819 transitions. [2025-03-03 21:43:57,047 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 819 transitions. Word has length 206 [2025-03-03 21:43:57,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:57,049 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 819 transitions. [2025-03-03 21:43:57,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:43:57,049 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 819 transitions. [2025-03-03 21:43:57,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 21:43:57,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:57,050 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:43:57,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 21:43:57,050 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:57,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:57,051 INFO L85 PathProgramCache]: Analyzing trace with hash 598896430, now seen corresponding path program 1 times [2025-03-03 21:43:57,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:43:57,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547963458] [2025-03-03 21:43:57,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:57,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:43:57,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 21:43:57,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 21:43:57,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:57,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:57,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:43:57,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:43:57,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547963458] [2025-03-03 21:43:57,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547963458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:43:57,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:43:57,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 21:43:57,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168513836] [2025-03-03 21:43:57,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:43:57,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:43:57,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:43:57,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:43:57,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:43:57,442 INFO L87 Difference]: Start difference. First operand 549 states and 819 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:43:57,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:57,805 INFO L93 Difference]: Finished difference Result 851 states and 1277 transitions. [2025-03-03 21:43:57,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 21:43:57,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-03 21:43:57,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:57,807 INFO L225 Difference]: With dead ends: 851 [2025-03-03 21:43:57,807 INFO L226 Difference]: Without dead ends: 597 [2025-03-03 21:43:57,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:43:57,808 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 153 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:57,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 666 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:43:57,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-03 21:43:57,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 509. [2025-03-03 21:43:57,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 428 states have (on average 1.4322429906542056) internal successors, (613), 429 states have internal predecessors, (613), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 21:43:57,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 757 transitions. [2025-03-03 21:43:57,833 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 757 transitions. Word has length 206 [2025-03-03 21:43:57,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:57,834 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 757 transitions. [2025-03-03 21:43:57,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:43:57,834 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 757 transitions. [2025-03-03 21:43:57,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 21:43:57,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:57,836 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:43:57,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 21:43:57,836 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:57,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:57,836 INFO L85 PathProgramCache]: Analyzing trace with hash -228067063, now seen corresponding path program 1 times [2025-03-03 21:43:57,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:43:57,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176484149] [2025-03-03 21:43:57,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:57,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:43:57,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 21:43:57,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 21:43:57,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:57,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:03,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:44:03,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:03,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176484149] [2025-03-03 21:44:03,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176484149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:03,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:03,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 21:44:03,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127061311] [2025-03-03 21:44:03,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:03,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 21:44:03,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:03,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 21:44:03,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:44:03,593 INFO L87 Difference]: Start difference. First operand 509 states and 757 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:44:05,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:05,899 INFO L93 Difference]: Finished difference Result 886 states and 1299 transitions. [2025-03-03 21:44:05,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 21:44:05,900 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 206 [2025-03-03 21:44:05,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:05,903 INFO L225 Difference]: With dead ends: 886 [2025-03-03 21:44:05,903 INFO L226 Difference]: Without dead ends: 676 [2025-03-03 21:44:05,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=277, Invalid=983, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 21:44:05,904 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 667 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:05,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1112 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 21:44:05,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-03-03 21:44:05,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 525. [2025-03-03 21:44:05,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 444 states have (on average 1.4301801801801801) internal successors, (635), 445 states have internal predecessors, (635), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 21:44:05,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 779 transitions. [2025-03-03 21:44:05,926 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 779 transitions. Word has length 206 [2025-03-03 21:44:05,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:05,926 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 779 transitions. [2025-03-03 21:44:05,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:44:05,926 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 779 transitions. [2025-03-03 21:44:05,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 21:44:05,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:05,927 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:44:05,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 21:44:05,927 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:05,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:05,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1828504917, now seen corresponding path program 1 times [2025-03-03 21:44:05,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:05,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110422455] [2025-03-03 21:44:05,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:05,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:05,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 21:44:05,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 21:44:05,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:05,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:10,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:44:10,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:10,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110422455] [2025-03-03 21:44:10,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110422455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:10,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:10,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 21:44:10,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234049571] [2025-03-03 21:44:10,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:10,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 21:44:10,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:10,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 21:44:10,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:44:10,824 INFO L87 Difference]: Start difference. First operand 525 states and 779 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:44:15,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:15,478 INFO L93 Difference]: Finished difference Result 907 states and 1315 transitions. [2025-03-03 21:44:15,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-03 21:44:15,479 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-03 21:44:15,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:15,481 INFO L225 Difference]: With dead ends: 907 [2025-03-03 21:44:15,481 INFO L226 Difference]: Without dead ends: 697 [2025-03-03 21:44:15,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=438, Invalid=1454, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 21:44:15,483 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 507 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:15,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1258 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 21:44:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-03-03 21:44:15,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 545. [2025-03-03 21:44:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 461 states have (on average 1.4273318872017353) internal successors, (658), 462 states have internal predecessors, (658), 74 states have call successors, (74), 9 states have call predecessors, (74), 9 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 21:44:15,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 806 transitions. [2025-03-03 21:44:15,507 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 806 transitions. Word has length 206 [2025-03-03 21:44:15,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:15,508 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 806 transitions. [2025-03-03 21:44:15,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:44:15,508 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 806 transitions. [2025-03-03 21:44:15,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 21:44:15,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:15,509 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:44:15,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 21:44:15,509 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:15,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:15,510 INFO L85 PathProgramCache]: Analyzing trace with hash -2025018422, now seen corresponding path program 1 times [2025-03-03 21:44:15,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:15,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868478148] [2025-03-03 21:44:15,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:15,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:15,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 21:44:15,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 21:44:15,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:15,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:21,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:44:21,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:21,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868478148] [2025-03-03 21:44:21,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868478148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:21,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:21,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 21:44:21,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504684476] [2025-03-03 21:44:21,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:21,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 21:44:21,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:21,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 21:44:21,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:44:21,567 INFO L87 Difference]: Start difference. First operand 545 states and 806 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:44:22,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:22,959 INFO L93 Difference]: Finished difference Result 879 states and 1284 transitions. [2025-03-03 21:44:22,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 21:44:22,959 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-03 21:44:22,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:22,963 INFO L225 Difference]: With dead ends: 879 [2025-03-03 21:44:22,963 INFO L226 Difference]: Without dead ends: 665 [2025-03-03 21:44:22,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2025-03-03 21:44:22,964 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 503 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:22,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 913 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 21:44:22,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-03 21:44:22,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 553. [2025-03-03 21:44:22,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 469 states have (on average 1.4264392324093818) internal successors, (669), 470 states have internal predecessors, (669), 74 states have call successors, (74), 9 states have call predecessors, (74), 9 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 21:44:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 817 transitions. [2025-03-03 21:44:22,988 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 817 transitions. Word has length 206 [2025-03-03 21:44:22,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:22,989 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 817 transitions. [2025-03-03 21:44:22,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:44:22,989 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 817 transitions. [2025-03-03 21:44:22,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 21:44:22,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:22,990 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:44:22,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 21:44:22,991 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:22,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:22,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1279484746, now seen corresponding path program 1 times [2025-03-03 21:44:22,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:22,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196734524] [2025-03-03 21:44:22,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:22,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:22,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 21:44:23,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 21:44:23,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:23,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:28,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:44:28,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:28,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196734524] [2025-03-03 21:44:28,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196734524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:28,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:28,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 21:44:28,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422238325] [2025-03-03 21:44:28,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:28,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 21:44:28,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:28,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 21:44:28,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:44:28,382 INFO L87 Difference]: Start difference. First operand 553 states and 817 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:44:30,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:30,665 INFO L93 Difference]: Finished difference Result 883 states and 1292 transitions. [2025-03-03 21:44:30,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 21:44:30,665 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-03 21:44:30,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:30,668 INFO L225 Difference]: With dead ends: 883 [2025-03-03 21:44:30,668 INFO L226 Difference]: Without dead ends: 669 [2025-03-03 21:44:30,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=238, Invalid=754, Unknown=0, NotChecked=0, Total=992 [2025-03-03 21:44:30,670 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 557 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:30,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 1013 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 21:44:30,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-03-03 21:44:30,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 553. [2025-03-03 21:44:30,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 469 states have (on average 1.4264392324093818) internal successors, (669), 470 states have internal predecessors, (669), 74 states have call successors, (74), 9 states have call predecessors, (74), 9 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 21:44:30,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 817 transitions. [2025-03-03 21:44:30,695 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 817 transitions. Word has length 206 [2025-03-03 21:44:30,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:30,696 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 817 transitions. [2025-03-03 21:44:30,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:44:30,696 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 817 transitions. [2025-03-03 21:44:30,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 21:44:30,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:30,697 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:44:30,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 21:44:30,697 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:30,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:30,698 INFO L85 PathProgramCache]: Analyzing trace with hash -320953108, now seen corresponding path program 1 times [2025-03-03 21:44:30,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:30,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443920113] [2025-03-03 21:44:30,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:30,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:30,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 21:44:30,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 21:44:30,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:30,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:44:30,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:30,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443920113] [2025-03-03 21:44:30,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443920113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:30,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:30,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:44:30,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887246766] [2025-03-03 21:44:30,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:30,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:44:30,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:30,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:44:30,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:44:30,837 INFO L87 Difference]: Start difference. First operand 553 states and 817 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:44:30,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:30,930 INFO L93 Difference]: Finished difference Result 894 states and 1316 transitions. [2025-03-03 21:44:30,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:44:30,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-03 21:44:30,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:30,933 INFO L225 Difference]: With dead ends: 894 [2025-03-03 21:44:30,934 INFO L226 Difference]: Without dead ends: 630 [2025-03-03 21:44:30,935 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 21:44:30,936 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 88 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:30,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 487 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:44:30,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2025-03-03 21:44:30,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 541. [2025-03-03 21:44:30,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 457 states have (on average 1.4091903719912473) internal successors, (644), 458 states have internal predecessors, (644), 74 states have call successors, (74), 9 states have call predecessors, (74), 9 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 21:44:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 792 transitions. [2025-03-03 21:44:30,962 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 792 transitions. Word has length 206 [2025-03-03 21:44:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:30,962 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 792 transitions. [2025-03-03 21:44:30,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:44:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 792 transitions. [2025-03-03 21:44:30,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 21:44:30,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:30,964 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:44:30,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 21:44:30,965 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:30,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:30,965 INFO L85 PathProgramCache]: Analyzing trace with hash -517466613, now seen corresponding path program 1 times [2025-03-03 21:44:30,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:30,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266865439] [2025-03-03 21:44:30,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:30,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:30,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 21:44:30,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 21:44:30,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:30,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:44:38,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:38,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266865439] [2025-03-03 21:44:38,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266865439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:38,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:38,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 21:44:38,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232486370] [2025-03-03 21:44:38,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:38,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 21:44:38,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:38,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 21:44:38,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:44:38,058 INFO L87 Difference]: Start difference. First operand 541 states and 792 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:44:39,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:39,525 INFO L93 Difference]: Finished difference Result 847 states and 1232 transitions. [2025-03-03 21:44:39,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 21:44:39,526 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-03 21:44:39,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:39,528 INFO L225 Difference]: With dead ends: 847 [2025-03-03 21:44:39,528 INFO L226 Difference]: Without dead ends: 633 [2025-03-03 21:44:39,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=213, Invalid=543, Unknown=0, NotChecked=0, Total=756 [2025-03-03 21:44:39,529 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 439 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:39,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 953 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:44:39,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-03 21:44:39,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 535. [2025-03-03 21:44:39,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 451 states have (on average 1.41019955654102) internal successors, (636), 452 states have internal predecessors, (636), 74 states have call successors, (74), 9 states have call predecessors, (74), 9 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 21:44:39,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 784 transitions. [2025-03-03 21:44:39,553 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 784 transitions. Word has length 206 [2025-03-03 21:44:39,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:39,554 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 784 transitions. [2025-03-03 21:44:39,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:44:39,554 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 784 transitions. [2025-03-03 21:44:39,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-03 21:44:39,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:39,555 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:44:39,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 21:44:39,556 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:39,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:39,556 INFO L85 PathProgramCache]: Analyzing trace with hash -441369697, now seen corresponding path program 1 times [2025-03-03 21:44:39,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:39,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610776188] [2025-03-03 21:44:39,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:39,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:39,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 21:44:39,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 21:44:39,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:39,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:44:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 21:44:43,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:44:43,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610776188] [2025-03-03 21:44:43,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610776188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:44:43,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:44:43,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 21:44:43,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256707245] [2025-03-03 21:44:43,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:44:43,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 21:44:43,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:44:43,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 21:44:43,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:44:43,869 INFO L87 Difference]: Start difference. First operand 535 states and 784 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:44:45,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:44:45,130 INFO L93 Difference]: Finished difference Result 1070 states and 1542 transitions. [2025-03-03 21:44:45,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 21:44:45,130 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2025-03-03 21:44:45,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:44:45,133 INFO L225 Difference]: With dead ends: 1070 [2025-03-03 21:44:45,133 INFO L226 Difference]: Without dead ends: 856 [2025-03-03 21:44:45,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-03-03 21:44:45,134 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 421 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 21:44:45,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 861 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 21:44:45,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2025-03-03 21:44:45,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 565. [2025-03-03 21:44:45,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 481 states have (on average 1.4116424116424116) internal successors, (679), 482 states have internal predecessors, (679), 74 states have call successors, (74), 9 states have call predecessors, (74), 9 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 21:44:45,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 827 transitions. [2025-03-03 21:44:45,163 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 827 transitions. Word has length 207 [2025-03-03 21:44:45,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:44:45,163 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 827 transitions. [2025-03-03 21:44:45,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 21:44:45,163 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 827 transitions. [2025-03-03 21:44:45,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-03 21:44:45,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:44:45,164 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:44:45,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 21:44:45,165 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:44:45,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:44:45,165 INFO L85 PathProgramCache]: Analyzing trace with hash -2041807551, now seen corresponding path program 1 times [2025-03-03 21:44:45,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:44:45,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612379657] [2025-03-03 21:44:45,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:44:45,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:44:45,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 21:44:45,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 21:44:45,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:44:45,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat