./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-20.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_operatoramount_amount100_file-20.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 36737b7958ca72f0774fc0f7ccab03861500afa24766b605f5269ead47c0b677 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:52:21,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:52:21,966 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:52:21,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:52:21,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:52:21,996 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:52:21,997 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:52:21,997 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:52:21,997 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:52:21,997 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:52:21,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:52:21,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:52:21,998 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:52:21,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:52:21,999 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:52:21,999 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:52:21,999 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:52:21,999 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:52:21,999 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:52:21,999 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:52:21,999 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:52:22,000 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:52:22,000 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:52:22,000 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:52:22,000 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:52:22,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:52:22,000 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:52:22,000 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:52:22,000 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:52:22,000 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:52:22,000 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:52:22,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:52:22,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:52:22,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:52:22,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:52:22,000 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:52:22,000 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:52:22,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:52:22,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:52:22,000 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:52:22,000 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:52:22,000 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:52:22,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:52:22,000 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 -> 36737b7958ca72f0774fc0f7ccab03861500afa24766b605f5269ead47c0b677 [2025-03-03 23:52:22,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:52:22,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:52:22,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:52:22,263 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:52:22,263 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:52:22,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-20.i [2025-03-03 23:52:23,423 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7cebe11a/19372ddb0c5943e6b6c4725bdac61f2f/FLAG2cc9fc240 [2025-03-03 23:52:23,697 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:52:23,698 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-20.i [2025-03-03 23:52:23,706 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7cebe11a/19372ddb0c5943e6b6c4725bdac61f2f/FLAG2cc9fc240 [2025-03-03 23:52:24,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7cebe11a/19372ddb0c5943e6b6c4725bdac61f2f [2025-03-03 23:52:24,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:52:24,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:52:24,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:52:24,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:52:24,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:52:24,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:52:24" (1/1) ... [2025-03-03 23:52:24,018 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a1a9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:24, skipping insertion in model container [2025-03-03 23:52:24,018 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:52:24" (1/1) ... [2025-03-03 23:52:24,036 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:52:24,152 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_operatoramount_amount100_file-20.i[916,929] [2025-03-03 23:52:24,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:52:24,252 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:52:24,260 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_operatoramount_amount100_file-20.i[916,929] [2025-03-03 23:52:24,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:52:24,325 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:52:24,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:24 WrapperNode [2025-03-03 23:52:24,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:52:24,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:52:24,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:52:24,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:52:24,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:24" (1/1) ... [2025-03-03 23:52:24,348 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:24" (1/1) ... [2025-03-03 23:52:24,387 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 258 [2025-03-03 23:52:24,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:52:24,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:52:24,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:52:24,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:52:24,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:24" (1/1) ... [2025-03-03 23:52:24,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:24" (1/1) ... [2025-03-03 23:52:24,404 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:24" (1/1) ... [2025-03-03 23:52:24,427 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 23:52:24,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:24" (1/1) ... [2025-03-03 23:52:24,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:24" (1/1) ... [2025-03-03 23:52:24,437 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:24" (1/1) ... [2025-03-03 23:52:24,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:24" (1/1) ... [2025-03-03 23:52:24,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:24" (1/1) ... [2025-03-03 23:52:24,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:24" (1/1) ... [2025-03-03 23:52:24,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:52:24,456 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:52:24,456 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:52:24,457 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:52:24,458 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:24" (1/1) ... [2025-03-03 23:52:24,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:52:24,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:52:24,486 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 23:52:24,489 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 23:52:24,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:52:24,505 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:52:24,505 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:52:24,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:52:24,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:52:24,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:52:24,565 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:52:24,566 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:52:24,903 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L199: havoc property_#t~bitwise23#1;havoc property_#t~short24#1;havoc property_#t~ite27#1;havoc property_#t~ite26#1;havoc property_#t~bitwise25#1;havoc property_#t~short28#1; [2025-03-03 23:52:24,935 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-03-03 23:52:24,935 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:52:24,947 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:52:24,947 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-03 23:52:24,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:52:24 BoogieIcfgContainer [2025-03-03 23:52:24,948 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:52:24,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:52:24,950 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:52:24,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:52:24,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:52:24" (1/3) ... [2025-03-03 23:52:24,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d434ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:52:24, skipping insertion in model container [2025-03-03 23:52:24,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:24" (2/3) ... [2025-03-03 23:52:24,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d434ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:52:24, skipping insertion in model container [2025-03-03 23:52:24,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:52:24" (3/3) ... [2025-03-03 23:52:24,955 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-20.i [2025-03-03 23:52:24,967 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:52:24,969 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-20.i that has 2 procedures, 115 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:52:25,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:52:25,036 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;@204a8f8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:52:25,036 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:52:25,040 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 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 23:52:25,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 23:52:25,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:52:25,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] [2025-03-03 23:52:25,052 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:52:25,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:52:25,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1783017545, now seen corresponding path program 1 times [2025-03-03 23:52:25,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:52:25,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527517715] [2025-03-03 23:52:25,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:52:25,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:52:25,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 23:52:25,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 23:52:25,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:52:25,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:52:25,364 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 23:52:25,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:52:25,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527517715] [2025-03-03 23:52:25,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527517715] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:52:25,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712600728] [2025-03-03 23:52:25,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:52:25,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:52:25,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:52:25,368 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 23:52:25,370 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 23:52:25,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 23:52:25,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 23:52:25,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:52:25,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:52:25,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:52:25,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:52:25,571 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 23:52:25,574 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:52:25,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712600728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:52:25,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:52:25,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:52:25,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418240793] [2025-03-03 23:52:25,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:52:25,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:52:25,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:52:25,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:52:25,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:52:25,601 INFO L87 Difference]: Start difference. First operand has 115 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 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 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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 23:52:25,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:52:25,633 INFO L93 Difference]: Finished difference Result 224 states and 382 transitions. [2025-03-03 23:52:25,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:52:25,635 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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 204 [2025-03-03 23:52:25,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:52:25,641 INFO L225 Difference]: With dead ends: 224 [2025-03-03 23:52:25,642 INFO L226 Difference]: Without dead ends: 112 [2025-03-03 23:52:25,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 205 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 23:52:25,646 INFO L435 NwaCegarLoop]: 169 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, 169 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 23:52:25,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:52:25,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-03 23:52:25,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-03 23:52:25,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 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 23:52:25,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2025-03-03 23:52:25,680 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 204 [2025-03-03 23:52:25,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:52:25,681 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2025-03-03 23:52:25,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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 23:52:25,681 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2025-03-03 23:52:25,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 23:52:25,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:52:25,684 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 23:52:25,691 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 23:52:25,884 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 23:52:25,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:52:25,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:52:25,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1184231988, now seen corresponding path program 1 times [2025-03-03 23:52:25,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:52:25,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064561013] [2025-03-03 23:52:25,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:52:25,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:52:25,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 23:52:25,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 23:52:25,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:52:25,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:52:26,379 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 23:52:26,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:52:26,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064561013] [2025-03-03 23:52:26,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064561013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:52:26,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:52:26,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:52:26,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126171113] [2025-03-03 23:52:26,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:52:26,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:52:26,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:52:26,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:52:26,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:52:26,385 INFO L87 Difference]: Start difference. First operand 112 states and 173 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 23:52:26,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:52:26,661 INFO L93 Difference]: Finished difference Result 364 states and 565 transitions. [2025-03-03 23:52:26,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:52:26,661 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 23:52:26,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:52:26,665 INFO L225 Difference]: With dead ends: 364 [2025-03-03 23:52:26,666 INFO L226 Difference]: Without dead ends: 255 [2025-03-03 23:52:26,668 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 23:52:26,669 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 168 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:52:26,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 514 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:52:26,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-03 23:52:26,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 244. [2025-03-03 23:52:26,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 179 states have internal predecessors, (251), 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 23:52:26,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 375 transitions. [2025-03-03 23:52:26,705 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 375 transitions. Word has length 204 [2025-03-03 23:52:26,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:52:26,706 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 375 transitions. [2025-03-03 23:52:26,706 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 23:52:26,706 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 375 transitions. [2025-03-03 23:52:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-03 23:52:26,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:52:26,708 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 23:52:26,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:52:26,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:52:26,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:52:26,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1871445696, now seen corresponding path program 1 times [2025-03-03 23:52:26,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:52:26,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572710719] [2025-03-03 23:52:26,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:52:26,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:52:26,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-03 23:52:26,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-03 23:52:26,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:52:26,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:52:27,303 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 23:52:27,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:52:27,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572710719] [2025-03-03 23:52:27,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572710719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:52:27,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:52:27,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 23:52:27,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389645194] [2025-03-03 23:52:27,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:52:27,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 23:52:27,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:52:27,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 23:52:27,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:52:27,305 INFO L87 Difference]: Start difference. First operand 244 states and 375 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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 23:52:27,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:52:27,867 INFO L93 Difference]: Finished difference Result 832 states and 1268 transitions. [2025-03-03 23:52:27,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 23:52:27,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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 23:52:27,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:52:27,874 INFO L225 Difference]: With dead ends: 832 [2025-03-03 23:52:27,874 INFO L226 Difference]: Without dead ends: 591 [2025-03-03 23:52:27,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:52:27,876 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 262 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 23:52:27,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1020 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 23:52:27,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-03 23:52:27,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 437. [2025-03-03 23:52:27,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 358 states have (on average 1.4301675977653632) internal successors, (512), 360 states have internal predecessors, (512), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 23:52:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 660 transitions. [2025-03-03 23:52:27,947 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 660 transitions. Word has length 205 [2025-03-03 23:52:27,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:52:27,948 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 660 transitions. [2025-03-03 23:52:27,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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 23:52:27,948 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 660 transitions. [2025-03-03 23:52:27,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 23:52:27,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:52:27,950 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 23:52:27,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:52:27,950 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:52:27,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:52:27,951 INFO L85 PathProgramCache]: Analyzing trace with hash -706933234, now seen corresponding path program 1 times [2025-03-03 23:52:27,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:52:27,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778119117] [2025-03-03 23:52:27,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:52:27,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:52:27,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 23:52:28,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 23:52:28,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:52:28,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:52:29,124 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 23:52:29,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:52:29,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778119117] [2025-03-03 23:52:29,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778119117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:52:29,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:52:29,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 23:52:29,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520238670] [2025-03-03 23:52:29,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:52:29,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 23:52:29,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:52:29,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 23:52:29,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:52:29,126 INFO L87 Difference]: Start difference. First operand 437 states and 660 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 23:52:29,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:52:29,890 INFO L93 Difference]: Finished difference Result 1363 states and 2032 transitions. [2025-03-03 23:52:29,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:52:29,891 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 23:52:29,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:52:29,896 INFO L225 Difference]: With dead ends: 1363 [2025-03-03 23:52:29,897 INFO L226 Difference]: Without dead ends: 929 [2025-03-03 23:52:29,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:52:29,899 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 362 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 23:52:29,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 738 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 23:52:29,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-03-03 23:52:29,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 633. [2025-03-03 23:52:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 538 states have (on average 1.4479553903345725) internal successors, (779), 543 states have internal predecessors, (779), 86 states have call successors, (86), 8 states have call predecessors, (86), 8 states have return successors, (86), 81 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-03 23:52:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 951 transitions. [2025-03-03 23:52:29,954 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 951 transitions. Word has length 206 [2025-03-03 23:52:29,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:52:29,954 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 951 transitions. [2025-03-03 23:52:29,955 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 23:52:29,955 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 951 transitions. [2025-03-03 23:52:29,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 23:52:29,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:52:29,957 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 23:52:29,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 23:52:29,957 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:52:29,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:52:29,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1212491859, now seen corresponding path program 1 times [2025-03-03 23:52:29,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:52:29,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785550179] [2025-03-03 23:52:29,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:52:29,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:52:29,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 23:52:30,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 23:52:30,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:52:30,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:52:30,296 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 23:52:30,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:52:30,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785550179] [2025-03-03 23:52:30,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785550179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:52:30,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:52:30,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 23:52:30,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711064111] [2025-03-03 23:52:30,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:52:30,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 23:52:30,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:52:30,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 23:52:30,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:52:30,297 INFO L87 Difference]: Start difference. First operand 633 states and 951 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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 23:52:30,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:52:30,877 INFO L93 Difference]: Finished difference Result 1591 states and 2373 transitions. [2025-03-03 23:52:30,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 23:52:30,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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 23:52:30,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:52:30,885 INFO L225 Difference]: With dead ends: 1591 [2025-03-03 23:52:30,885 INFO L226 Difference]: Without dead ends: 968 [2025-03-03 23:52:30,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:52:30,890 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 252 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:52:30,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 649 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 23:52:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2025-03-03 23:52:30,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 804. [2025-03-03 23:52:30,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 668 states have (on average 1.4251497005988023) internal successors, (952), 675 states have internal predecessors, (952), 123 states have call successors, (123), 12 states have call predecessors, (123), 12 states have return successors, (123), 116 states have call predecessors, (123), 123 states have call successors, (123) [2025-03-03 23:52:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1198 transitions. [2025-03-03 23:52:30,980 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1198 transitions. Word has length 206 [2025-03-03 23:52:30,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:52:30,981 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1198 transitions. [2025-03-03 23:52:30,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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 23:52:30,981 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1198 transitions. [2025-03-03 23:52:30,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 23:52:30,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:52:30,984 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 23:52:30,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 23:52:30,985 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:52:30,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:52:30,985 INFO L85 PathProgramCache]: Analyzing trace with hash 537831247, now seen corresponding path program 1 times [2025-03-03 23:52:30,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:52:30,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531929191] [2025-03-03 23:52:30,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:52:30,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:52:31,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 23:52:31,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 23:52:31,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:52:31,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:52:32,819 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 23:52:32,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:52:32,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531929191] [2025-03-03 23:52:32,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531929191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:52:32,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:52:32,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 23:52:32,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173904560] [2025-03-03 23:52:32,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:52:32,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 23:52:32,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:52:32,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 23:52:32,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:52:32,821 INFO L87 Difference]: Start difference. First operand 804 states and 1198 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 23:52:34,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:52:34,416 INFO L93 Difference]: Finished difference Result 3070 states and 4529 transitions. [2025-03-03 23:52:34,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 23:52:34,417 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 23:52:34,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:52:34,430 INFO L225 Difference]: With dead ends: 3070 [2025-03-03 23:52:34,430 INFO L226 Difference]: Without dead ends: 2276 [2025-03-03 23:52:34,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2025-03-03 23:52:34,434 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 499 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:52:34,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 711 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 23:52:34,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2025-03-03 23:52:34,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 1047. [2025-03-03 23:52:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 911 states have (on average 1.4621295279912185) internal successors, (1332), 918 states have internal predecessors, (1332), 123 states have call successors, (123), 12 states have call predecessors, (123), 12 states have return successors, (123), 116 states have call predecessors, (123), 123 states have call successors, (123) [2025-03-03 23:52:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1578 transitions. [2025-03-03 23:52:34,518 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1578 transitions. Word has length 206 [2025-03-03 23:52:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:52:34,519 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1578 transitions. [2025-03-03 23:52:34,519 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 23:52:34,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1578 transitions. [2025-03-03 23:52:34,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 23:52:34,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:52:34,521 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 23:52:34,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 23:52:34,525 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:52:34,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:52:34,526 INFO L85 PathProgramCache]: Analyzing trace with hash 129007022, now seen corresponding path program 1 times [2025-03-03 23:52:34,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:52:34,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826143333] [2025-03-03 23:52:34,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:52:34,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:52:34,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 23:52:34,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 23:52:34,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:52:34,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:52:34,634 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 23:52:34,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:52:34,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826143333] [2025-03-03 23:52:34,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826143333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:52:34,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:52:34,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:52:34,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992705210] [2025-03-03 23:52:34,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:52:34,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:52:34,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:52:34,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:52:34,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:52:34,635 INFO L87 Difference]: Start difference. First operand 1047 states and 1578 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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 23:52:34,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:52:34,775 INFO L93 Difference]: Finished difference Result 2438 states and 3670 transitions. [2025-03-03 23:52:34,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:52:34,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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 23:52:34,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:52:34,785 INFO L225 Difference]: With dead ends: 2438 [2025-03-03 23:52:34,786 INFO L226 Difference]: Without dead ends: 1401 [2025-03-03 23:52:34,788 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 23:52:34,789 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 148 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:52:34,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 439 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:52:34,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2025-03-03 23:52:34,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1150. [2025-03-03 23:52:34,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1022 states have (on average 1.477495107632094) internal successors, (1510), 1028 states have internal predecessors, (1510), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-03 23:52:34,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1744 transitions. [2025-03-03 23:52:34,861 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1744 transitions. Word has length 206 [2025-03-03 23:52:34,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:52:34,861 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1744 transitions. [2025-03-03 23:52:34,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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 23:52:34,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1744 transitions. [2025-03-03 23:52:34,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 23:52:34,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:52:34,866 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 23:52:34,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 23:52:34,867 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:52:34,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:52:34,867 INFO L85 PathProgramCache]: Analyzing trace with hash -2035021443, now seen corresponding path program 1 times [2025-03-03 23:52:34,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:52:34,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951597254] [2025-03-03 23:52:34,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:52:34,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:52:34,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 23:52:34,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 23:52:34,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:52:34,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:52:36,821 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 23:52:36,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:52:36,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951597254] [2025-03-03 23:52:36,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951597254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:52:36,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:52:36,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 23:52:36,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551319057] [2025-03-03 23:52:36,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:52:36,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 23:52:36,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:52:36,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 23:52:36,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:52:36,823 INFO L87 Difference]: Start difference. First operand 1150 states and 1744 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 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 23:52:38,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:52:38,626 INFO L93 Difference]: Finished difference Result 2334 states and 3489 transitions. [2025-03-03 23:52:38,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:52:38,628 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 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 23:52:38,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:52:38,635 INFO L225 Difference]: With dead ends: 2334 [2025-03-03 23:52:38,636 INFO L226 Difference]: Without dead ends: 1749 [2025-03-03 23:52:38,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 23:52:38,638 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 481 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:52:38,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 727 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 23:52:38,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2025-03-03 23:52:38,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1198. [2025-03-03 23:52:38,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 1070 states have (on average 1.4813084112149533) internal successors, (1585), 1076 states have internal predecessors, (1585), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-03 23:52:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1819 transitions. [2025-03-03 23:52:38,696 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1819 transitions. Word has length 206 [2025-03-03 23:52:38,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:52:38,697 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1819 transitions. [2025-03-03 23:52:38,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 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 23:52:38,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1819 transitions. [2025-03-03 23:52:38,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-03 23:52:38,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:52:38,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, 1] [2025-03-03 23:52:38,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 23:52:38,700 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:52:38,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:52:38,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1580374622, now seen corresponding path program 1 times [2025-03-03 23:52:38,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:52:38,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847589408] [2025-03-03 23:52:38,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:52:38,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:52:38,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 23:52:38,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 23:52:38,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:52:38,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:52:38,858 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 23:52:38,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:52:38,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847589408] [2025-03-03 23:52:38,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847589408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:52:38,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:52:38,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:52:38,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639669811] [2025-03-03 23:52:38,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:52:38,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:52:38,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:52:38,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:52:38,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:52:38,861 INFO L87 Difference]: Start difference. First operand 1198 states and 1819 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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 23:52:39,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:52:39,200 INFO L93 Difference]: Finished difference Result 2808 states and 4265 transitions. [2025-03-03 23:52:39,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:52:39,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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 23:52:39,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:52:39,209 INFO L225 Difference]: With dead ends: 2808 [2025-03-03 23:52:39,209 INFO L226 Difference]: Without dead ends: 1620 [2025-03-03 23:52:39,212 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 23:52:39,214 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 153 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:52:39,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 646 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 23:52:39,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2025-03-03 23:52:39,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1253. [2025-03-03 23:52:39,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1125 states have (on average 1.48) internal successors, (1665), 1131 states have internal predecessors, (1665), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-03 23:52:39,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1899 transitions. [2025-03-03 23:52:39,280 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1899 transitions. Word has length 207 [2025-03-03 23:52:39,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:52:39,280 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1899 transitions. [2025-03-03 23:52:39,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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 23:52:39,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1899 transitions. [2025-03-03 23:52:39,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 23:52:39,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:52:39,283 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, 1] [2025-03-03 23:52:39,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 23:52:39,283 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:52:39,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:52:39,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2052724903, now seen corresponding path program 1 times [2025-03-03 23:52:39,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:52:39,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972888128] [2025-03-03 23:52:39,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:52:39,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:52:39,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 23:52:39,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 23:52:39,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:52:39,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:52:40,782 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 23:52:40,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:52:40,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972888128] [2025-03-03 23:52:40,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972888128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:52:40,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:52:40,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 23:52:40,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846714323] [2025-03-03 23:52:40,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:52:40,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 23:52:40,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:52:40,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 23:52:40,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:52:40,784 INFO L87 Difference]: Start difference. First operand 1253 states and 1899 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 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 23:52:42,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:52:42,814 INFO L93 Difference]: Finished difference Result 2549 states and 3806 transitions. [2025-03-03 23:52:42,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 23:52:42,814 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 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 208 [2025-03-03 23:52:42,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:52:42,822 INFO L225 Difference]: With dead ends: 2549 [2025-03-03 23:52:42,822 INFO L226 Difference]: Without dead ends: 1919 [2025-03-03 23:52:42,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-03 23:52:42,824 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 533 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:52:42,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1231 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 23:52:42,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2025-03-03 23:52:42,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1160. [2025-03-03 23:52:42,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 1069 states have (on average 1.4948550046772684) internal successors, (1598), 1073 states have internal predecessors, (1598), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 23:52:42,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1762 transitions. [2025-03-03 23:52:42,893 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1762 transitions. Word has length 208 [2025-03-03 23:52:42,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:52:42,895 INFO L471 AbstractCegarLoop]: Abstraction has 1160 states and 1762 transitions. [2025-03-03 23:52:42,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 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 23:52:42,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1762 transitions. [2025-03-03 23:52:42,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 23:52:42,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:52:42,898 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, 1] [2025-03-03 23:52:42,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 23:52:42,898 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:52:42,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:52:42,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1736683768, now seen corresponding path program 1 times [2025-03-03 23:52:42,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:52:42,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859035592] [2025-03-03 23:52:42,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:52:42,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:52:42,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 23:52:42,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 23:52:43,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:52:43,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:52:43,886 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 23:52:43,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:52:43,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859035592] [2025-03-03 23:52:43,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859035592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:52:43,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:52:43,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 23:52:43,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836030666] [2025-03-03 23:52:43,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:52:43,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 23:52:43,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:52:43,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 23:52:43,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:52:43,887 INFO L87 Difference]: Start difference. First operand 1160 states and 1762 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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 23:52:44,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:52:44,484 INFO L93 Difference]: Finished difference Result 2644 states and 3970 transitions. [2025-03-03 23:52:44,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:52:44,485 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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 208 [2025-03-03 23:52:44,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:52:44,490 INFO L225 Difference]: With dead ends: 2644 [2025-03-03 23:52:44,490 INFO L226 Difference]: Without dead ends: 1941 [2025-03-03 23:52:44,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2025-03-03 23:52:44,492 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 368 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 23:52:44,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 444 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 23:52:44,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2025-03-03 23:52:44,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1370. [2025-03-03 23:52:44,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1279 states have (on average 1.4800625488663017) internal successors, (1893), 1283 states have internal predecessors, (1893), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 23:52:44,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 2057 transitions. [2025-03-03 23:52:44,537 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 2057 transitions. Word has length 208 [2025-03-03 23:52:44,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:52:44,538 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 2057 transitions. [2025-03-03 23:52:44,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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 23:52:44,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 2057 transitions. [2025-03-03 23:52:44,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 23:52:44,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:52:44,540 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, 1] [2025-03-03 23:52:44,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 23:52:44,541 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:52:44,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:52:44,541 INFO L85 PathProgramCache]: Analyzing trace with hash -512054673, now seen corresponding path program 1 times [2025-03-03 23:52:44,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:52:44,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879657267] [2025-03-03 23:52:44,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:52:44,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:52:44,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 23:52:44,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 23:52:44,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:52:44,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:52:44,635 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 23:52:44,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:52:44,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879657267] [2025-03-03 23:52:44,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879657267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:52:44,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:52:44,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:52:44,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206790223] [2025-03-03 23:52:44,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:52:44,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:52:44,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:52:44,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:52:44,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:52:44,637 INFO L87 Difference]: Start difference. First operand 1370 states and 2057 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 23:52:44,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:52:44,707 INFO L93 Difference]: Finished difference Result 1874 states and 2764 transitions. [2025-03-03 23:52:44,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:52:44,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 208 [2025-03-03 23:52:44,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:52:44,711 INFO L225 Difference]: With dead ends: 1874 [2025-03-03 23:52:44,712 INFO L226 Difference]: Without dead ends: 853 [2025-03-03 23:52:44,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:52:44,714 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 156 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:52:44,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 415 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:52:44,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2025-03-03 23:52:44,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 849. [2025-03-03 23:52:44,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 758 states have (on average 1.3443271767810026) internal successors, (1019), 762 states have internal predecessors, (1019), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 23:52:44,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1183 transitions. [2025-03-03 23:52:44,751 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1183 transitions. Word has length 208 [2025-03-03 23:52:44,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:52:44,751 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1183 transitions. [2025-03-03 23:52:44,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 23:52:44,752 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1183 transitions. [2025-03-03 23:52:44,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 23:52:44,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:52:44,753 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, 1] [2025-03-03 23:52:44,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 23:52:44,754 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:52:44,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:52:44,754 INFO L85 PathProgramCache]: Analyzing trace with hash -579061426, now seen corresponding path program 1 times [2025-03-03 23:52:44,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:52:44,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364362884] [2025-03-03 23:52:44,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:52:44,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:52:44,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 23:52:44,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 23:52:44,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:52:44,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:52:46,267 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 23:52:46,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:52:46,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364362884] [2025-03-03 23:52:46,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364362884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:52:46,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:52:46,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 23:52:46,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536054204] [2025-03-03 23:52:46,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:52:46,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 23:52:46,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:52:46,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 23:52:46,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:52:46,269 INFO L87 Difference]: Start difference. First operand 849 states and 1183 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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 23:52:47,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:52:47,163 INFO L93 Difference]: Finished difference Result 1945 states and 2676 transitions. [2025-03-03 23:52:47,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:52:47,164 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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 208 [2025-03-03 23:52:47,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:52:47,167 INFO L225 Difference]: With dead ends: 1945 [2025-03-03 23:52:47,167 INFO L226 Difference]: Without dead ends: 1099 [2025-03-03 23:52:47,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:52:47,169 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 278 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 23:52:47,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 858 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 23:52:47,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-03-03 23:52:47,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 850. [2025-03-03 23:52:47,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 759 states have (on average 1.3451910408432148) internal successors, (1021), 763 states have internal predecessors, (1021), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 23:52:47,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1185 transitions. [2025-03-03 23:52:47,207 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1185 transitions. Word has length 208 [2025-03-03 23:52:47,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:52:47,207 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1185 transitions. [2025-03-03 23:52:47,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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 23:52:47,207 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1185 transitions. [2025-03-03 23:52:47,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 23:52:47,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:52:47,209 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, 1] [2025-03-03 23:52:47,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 23:52:47,209 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:52:47,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:52:47,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1084620051, now seen corresponding path program 1 times [2025-03-03 23:52:47,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:52:47,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705993242] [2025-03-03 23:52:47,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:52:47,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:52:47,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 23:52:47,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 23:52:47,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:52:47,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:52:48,674 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 23:52:48,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:52:48,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705993242] [2025-03-03 23:52:48,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705993242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:52:48,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:52:48,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 23:52:48,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880740606] [2025-03-03 23:52:48,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:52:48,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 23:52:48,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:52:48,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 23:52:48,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:52:48,675 INFO L87 Difference]: Start difference. First operand 850 states and 1185 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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 23:52:49,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:52:49,906 INFO L93 Difference]: Finished difference Result 2039 states and 2803 transitions. [2025-03-03 23:52:49,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 23:52:49,906 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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 208 [2025-03-03 23:52:49,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:52:49,919 INFO L225 Difference]: With dead ends: 2039 [2025-03-03 23:52:49,919 INFO L226 Difference]: Without dead ends: 1192 [2025-03-03 23:52:49,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-03-03 23:52:49,921 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 348 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:52:49,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1186 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 23:52:49,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2025-03-03 23:52:49,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 855. [2025-03-03 23:52:49,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 764 states have (on average 1.3455497382198953) internal successors, (1028), 768 states have internal predecessors, (1028), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 23:52:49,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1192 transitions. [2025-03-03 23:52:49,979 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1192 transitions. Word has length 208 [2025-03-03 23:52:49,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:52:49,980 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1192 transitions. [2025-03-03 23:52:49,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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 23:52:49,981 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1192 transitions. [2025-03-03 23:52:49,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 23:52:49,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:52:49,983 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, 1] [2025-03-03 23:52:49,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 23:52:49,983 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:52:49,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:52:49,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1929091922, now seen corresponding path program 1 times [2025-03-03 23:52:49,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:52:49,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388571081] [2025-03-03 23:52:49,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:52:49,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:52:49,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 23:52:50,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 23:52:50,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:52:50,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:52:50,277 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 23:52:50,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:52:50,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388571081] [2025-03-03 23:52:50,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388571081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:52:50,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:52:50,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 23:52:50,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727914827] [2025-03-03 23:52:50,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:52:50,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:52:50,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:52:50,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:52:50,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:52:50,278 INFO L87 Difference]: Start difference. First operand 855 states and 1192 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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 23:52:51,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:52:51,280 INFO L93 Difference]: Finished difference Result 2401 states and 3329 transitions. [2025-03-03 23:52:51,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:52:51,281 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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 208 [2025-03-03 23:52:51,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:52:51,285 INFO L225 Difference]: With dead ends: 2401 [2025-03-03 23:52:51,285 INFO L226 Difference]: Without dead ends: 1549 [2025-03-03 23:52:51,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-03 23:52:51,288 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 317 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 23:52:51,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1419 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 23:52:51,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2025-03-03 23:52:51,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1222. [2025-03-03 23:52:51,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 1056 states have (on average 1.3352272727272727) internal successors, (1410), 1062 states have internal predecessors, (1410), 150 states have call successors, (150), 15 states have call predecessors, (150), 15 states have return successors, (150), 144 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-03 23:52:51,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1710 transitions. [2025-03-03 23:52:51,361 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1710 transitions. Word has length 208 [2025-03-03 23:52:51,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:52:51,361 INFO L471 AbstractCegarLoop]: Abstraction has 1222 states and 1710 transitions. [2025-03-03 23:52:51,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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 23:52:51,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1710 transitions. [2025-03-03 23:52:51,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 23:52:51,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:52:51,363 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, 1] [2025-03-03 23:52:51,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 23:52:51,363 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:52:51,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:52:51,364 INFO L85 PathProgramCache]: Analyzing trace with hash 498600186, now seen corresponding path program 1 times [2025-03-03 23:52:51,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:52:51,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660081779] [2025-03-03 23:52:51,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:52:51,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:52:51,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 23:52:51,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 23:52:51,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:52:51,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:52:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-03 23:52:51,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:52:51,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660081779] [2025-03-03 23:52:51,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660081779] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:52:51,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18720785] [2025-03-03 23:52:51,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:52:51,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:52:51,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:52:51,854 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:52:51,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 23:52:51,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 23:52:51,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 23:52:51,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:52:51,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:52:51,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 23:52:51,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:52:52,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 872 proven. 114 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2025-03-03 23:52:52,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:52:52,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18720785] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:52:52,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:52:52,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2025-03-03 23:52:52,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570142482] [2025-03-03 23:52:52,723 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:52:52,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 23:52:52,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:52:52,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 23:52:52,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-03 23:52:52,724 INFO L87 Difference]: Start difference. First operand 1222 states and 1710 transitions. Second operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 4 states have call successors, (57), 3 states have call predecessors, (57), 4 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) [2025-03-03 23:52:54,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:52:54,980 INFO L93 Difference]: Finished difference Result 2107 states and 2908 transitions. [2025-03-03 23:52:54,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-03 23:52:54,980 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 4 states have call successors, (57), 3 states have call predecessors, (57), 4 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) Word has length 208 [2025-03-03 23:52:54,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:52:54,984 INFO L225 Difference]: With dead ends: 2107 [2025-03-03 23:52:54,984 INFO L226 Difference]: Without dead ends: 888 [2025-03-03 23:52:54,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=690, Invalid=2280, Unknown=0, NotChecked=0, Total=2970 [2025-03-03 23:52:54,986 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 563 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 2201 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 2201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:52:54,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1339 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 2201 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 23:52:54,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2025-03-03 23:52:55,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 486. [2025-03-03 23:52:55,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 400 states have (on average 1.2725) internal successors, (509), 402 states have internal predecessors, (509), 72 states have call successors, (72), 13 states have call predecessors, (72), 13 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 23:52:55,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 653 transitions. [2025-03-03 23:52:55,024 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 653 transitions. Word has length 208 [2025-03-03 23:52:55,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:52:55,025 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 653 transitions. [2025-03-03 23:52:55,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 4 states have call successors, (57), 3 states have call predecessors, (57), 4 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) [2025-03-03 23:52:55,025 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 653 transitions. [2025-03-03 23:52:55,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 23:52:55,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:52:55,026 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, 1, 1, 1] [2025-03-03 23:52:55,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 23:52:55,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 23:52:55,226 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:52:55,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:52:55,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1279400903, now seen corresponding path program 1 times [2025-03-03 23:52:55,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:52:55,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810129701] [2025-03-03 23:52:55,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:52:55,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:52:55,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 23:52:55,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 23:52:55,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:52:55,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:52:56,710 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 23:52:56,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:52:56,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810129701] [2025-03-03 23:52:56,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810129701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:52:56,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:52:56,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 23:52:56,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14338070] [2025-03-03 23:52:56,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:52:56,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 23:52:56,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:52:56,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 23:52:56,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:52:56,711 INFO L87 Difference]: Start difference. First operand 486 states and 653 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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 23:52:57,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:52:57,336 INFO L93 Difference]: Finished difference Result 1164 states and 1550 transitions. [2025-03-03 23:52:57,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 23:52:57,340 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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 210 [2025-03-03 23:52:57,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:52:57,343 INFO L225 Difference]: With dead ends: 1164 [2025-03-03 23:52:57,343 INFO L226 Difference]: Without dead ends: 681 [2025-03-03 23:52:57,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-03 23:52:57,345 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 274 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:52:57,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1059 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 23:52:57,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-03-03 23:52:57,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 488. [2025-03-03 23:52:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 402 states have (on average 1.2736318407960199) internal successors, (512), 404 states have internal predecessors, (512), 72 states have call successors, (72), 13 states have call predecessors, (72), 13 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 23:52:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 656 transitions. [2025-03-03 23:52:57,378 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 656 transitions. Word has length 210 [2025-03-03 23:52:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:52:57,379 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 656 transitions. [2025-03-03 23:52:57,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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 23:52:57,380 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 656 transitions. [2025-03-03 23:52:57,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 23:52:57,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:52:57,381 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, 1, 1, 1] [2025-03-03 23:52:57,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 23:52:57,381 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:52:57,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:52:57,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1784959528, now seen corresponding path program 1 times [2025-03-03 23:52:57,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:52:57,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642998082] [2025-03-03 23:52:57,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:52:57,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:52:57,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 23:52:57,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 23:52:57,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:52:57,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:53:00,612 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 23:53:00,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:53:00,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642998082] [2025-03-03 23:53:00,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642998082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:53:00,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:53:00,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 23:53:00,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15568127] [2025-03-03 23:53:00,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:53:00,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 23:53:00,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:53:00,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 23:53:00,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-03-03 23:53:00,614 INFO L87 Difference]: Start difference. First operand 488 states and 656 transitions. Second operand has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 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 23:53:04,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:53:04,550 INFO L93 Difference]: Finished difference Result 1345 states and 1790 transitions. [2025-03-03 23:53:04,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 23:53:04,550 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 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 210 [2025-03-03 23:53:04,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:53:04,553 INFO L225 Difference]: With dead ends: 1345 [2025-03-03 23:53:04,553 INFO L226 Difference]: Without dead ends: 860 [2025-03-03 23:53:04,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=252, Invalid=740, Unknown=0, NotChecked=0, Total=992 [2025-03-03 23:53:04,554 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 462 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 23:53:04,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1383 Invalid, 1699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 23:53:04,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2025-03-03 23:53:04,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 579. [2025-03-03 23:53:04,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 457 states have (on average 1.2560175054704594) internal successors, (574), 459 states have internal predecessors, (574), 103 states have call successors, (103), 18 states have call predecessors, (103), 18 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-03 23:53:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 780 transitions. [2025-03-03 23:53:04,602 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 780 transitions. Word has length 210 [2025-03-03 23:53:04,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:53:04,603 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 780 transitions. [2025-03-03 23:53:04,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 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 23:53:04,603 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 780 transitions. [2025-03-03 23:53:04,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 23:53:04,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:53:04,604 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, 1, 1, 1] [2025-03-03 23:53:04,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 23:53:04,605 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:53:04,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:53:04,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1665535897, now seen corresponding path program 1 times [2025-03-03 23:53:04,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:53:04,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000284042] [2025-03-03 23:53:04,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:53:04,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:53:04,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 23:53:04,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 23:53:04,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:53:04,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:53:04,859 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 23:53:04,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:53:04,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000284042] [2025-03-03 23:53:04,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000284042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:53:04,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:53:04,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 23:53:04,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804361585] [2025-03-03 23:53:04,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:53:04,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:53:04,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:53:04,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:53:04,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:53:04,861 INFO L87 Difference]: Start difference. First operand 579 states and 780 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-03 23:53:05,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:53:05,302 INFO L93 Difference]: Finished difference Result 1358 states and 1829 transitions. [2025-03-03 23:53:05,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:53:05,302 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 210 [2025-03-03 23:53:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:53:05,306 INFO L225 Difference]: With dead ends: 1358 [2025-03-03 23:53:05,306 INFO L226 Difference]: Without dead ends: 873 [2025-03-03 23:53:05,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:53:05,307 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 304 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:53:05,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 885 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 23:53:05,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-03-03 23:53:05,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 722. [2025-03-03 23:53:05,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 564 states have (on average 1.25177304964539) internal successors, (706), 566 states have internal predecessors, (706), 134 states have call successors, (134), 23 states have call predecessors, (134), 23 states have return successors, (134), 132 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-03 23:53:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 974 transitions. [2025-03-03 23:53:05,405 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 974 transitions. Word has length 210 [2025-03-03 23:53:05,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:53:05,405 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 974 transitions. [2025-03-03 23:53:05,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-03 23:53:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 974 transitions. [2025-03-03 23:53:05,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 23:53:05,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:53:05,407 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, 1, 1, 1] [2025-03-03 23:53:05,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 23:53:05,407 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:53:05,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:53:05,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1488044281, now seen corresponding path program 1 times [2025-03-03 23:53:05,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:53:05,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142265238] [2025-03-03 23:53:05,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:53:05,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:53:05,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 23:53:05,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 23:53:05,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:53:05,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:53:07,762 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 23:53:07,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:53:07,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142265238] [2025-03-03 23:53:07,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142265238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:53:07,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:53:07,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 23:53:07,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768517116] [2025-03-03 23:53:07,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:53:07,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 23:53:07,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:53:07,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 23:53:07,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-03 23:53:07,763 INFO L87 Difference]: Start difference. First operand 722 states and 974 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 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 23:53:09,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:53:09,283 INFO L93 Difference]: Finished difference Result 1459 states and 1947 transitions. [2025-03-03 23:53:09,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 23:53:09,283 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 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 210 [2025-03-03 23:53:09,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:53:09,287 INFO L225 Difference]: With dead ends: 1459 [2025-03-03 23:53:09,287 INFO L226 Difference]: Without dead ends: 974 [2025-03-03 23:53:09,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-03-03 23:53:09,288 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 359 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:53:09,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1403 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 23:53:09,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-03-03 23:53:09,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 722. [2025-03-03 23:53:09,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 564 states have (on average 1.25177304964539) internal successors, (706), 566 states have internal predecessors, (706), 134 states have call successors, (134), 23 states have call predecessors, (134), 23 states have return successors, (134), 132 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-03 23:53:09,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 974 transitions. [2025-03-03 23:53:09,356 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 974 transitions. Word has length 210 [2025-03-03 23:53:09,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:53:09,356 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 974 transitions. [2025-03-03 23:53:09,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 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 23:53:09,356 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 974 transitions. [2025-03-03 23:53:09,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 23:53:09,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:53:09,357 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, 1, 1, 1] [2025-03-03 23:53:09,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 23:53:09,358 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:53:09,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:53:09,358 INFO L85 PathProgramCache]: Analyzing trace with hash 982485656, now seen corresponding path program 1 times [2025-03-03 23:53:09,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:53:09,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345268603] [2025-03-03 23:53:09,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:53:09,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:53:09,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 23:53:09,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 23:53:09,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:53:09,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:53:10,666 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 23:53:10,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:53:10,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345268603] [2025-03-03 23:53:10,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345268603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:53:10,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:53:10,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 23:53:10,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571960530] [2025-03-03 23:53:10,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:53:10,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 23:53:10,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:53:10,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 23:53:10,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:53:10,667 INFO L87 Difference]: Start difference. First operand 722 states and 974 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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 23:53:11,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:53:11,590 INFO L93 Difference]: Finished difference Result 1494 states and 1999 transitions. [2025-03-03 23:53:11,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 23:53:11,591 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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 210 [2025-03-03 23:53:11,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:53:11,596 INFO L225 Difference]: With dead ends: 1494 [2025-03-03 23:53:11,596 INFO L226 Difference]: Without dead ends: 1009 [2025-03-03 23:53:11,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-03 23:53:11,597 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 335 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 23:53:11,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1181 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 23:53:11,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-03-03 23:53:11,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 743. [2025-03-03 23:53:11,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 585 states have (on average 1.2547008547008547) internal successors, (734), 587 states have internal predecessors, (734), 134 states have call successors, (134), 23 states have call predecessors, (134), 23 states have return successors, (134), 132 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-03 23:53:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1002 transitions. [2025-03-03 23:53:11,679 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1002 transitions. Word has length 210 [2025-03-03 23:53:11,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:53:11,679 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1002 transitions. [2025-03-03 23:53:11,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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 23:53:11,684 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1002 transitions. [2025-03-03 23:53:11,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 23:53:11,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:53:11,685 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, 1, 1, 1] [2025-03-03 23:53:11,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 23:53:11,685 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:53:11,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:53:11,685 INFO L85 PathProgramCache]: Analyzing trace with hash 977510104, now seen corresponding path program 1 times [2025-03-03 23:53:11,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:53:11,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216382775] [2025-03-03 23:53:11,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:53:11,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:53:11,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 23:53:11,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 23:53:11,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:53:11,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:53:15,821 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 23:53:15,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:53:15,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216382775] [2025-03-03 23:53:15,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216382775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:53:15,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:53:15,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 23:53:15,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577677429] [2025-03-03 23:53:15,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:53:15,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 23:53:15,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:53:15,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 23:53:15,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-03 23:53:15,823 INFO L87 Difference]: Start difference. First operand 743 states and 1002 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 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 23:53:26,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:53:26,472 INFO L93 Difference]: Finished difference Result 1580 states and 2101 transitions. [2025-03-03 23:53:26,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 23:53:26,474 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 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 210 [2025-03-03 23:53:26,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:53:26,481 INFO L225 Difference]: With dead ends: 1580 [2025-03-03 23:53:26,481 INFO L226 Difference]: Without dead ends: 1074 [2025-03-03 23:53:26,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2025-03-03 23:53:26,483 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 494 mSDsluCounter, 1644 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-03-03 23:53:26,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 1845 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2025-03-03 23:53:26,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2025-03-03 23:53:26,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 748. [2025-03-03 23:53:26,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 590 states have (on average 1.2576271186440677) internal successors, (742), 592 states have internal predecessors, (742), 134 states have call successors, (134), 23 states have call predecessors, (134), 23 states have return successors, (134), 132 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-03 23:53:26,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1010 transitions. [2025-03-03 23:53:26,571 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1010 transitions. Word has length 210 [2025-03-03 23:53:26,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:53:26,571 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1010 transitions. [2025-03-03 23:53:26,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 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 23:53:26,571 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1010 transitions. [2025-03-03 23:53:26,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 23:53:26,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:53:26,572 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, 1, 1, 1] [2025-03-03 23:53:26,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 23:53:26,572 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:53:26,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:53:26,574 INFO L85 PathProgramCache]: Analyzing trace with hash 471951479, now seen corresponding path program 1 times [2025-03-03 23:53:26,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:53:26,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220136424] [2025-03-03 23:53:26,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:53:26,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:53:26,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 23:53:26,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 23:53:26,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:53:26,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:53:31,799 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 23:53:31,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:53:31,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220136424] [2025-03-03 23:53:31,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220136424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:53:31,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:53:31,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 23:53:31,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236633776] [2025-03-03 23:53:31,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:53:31,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 23:53:31,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:53:31,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 23:53:31,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-03 23:53:31,801 INFO L87 Difference]: Start difference. First operand 748 states and 1010 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 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 23:53:33,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:53:33,024 INFO L93 Difference]: Finished difference Result 1517 states and 2030 transitions. [2025-03-03 23:53:33,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 23:53:33,025 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 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 210 [2025-03-03 23:53:33,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:53:33,028 INFO L225 Difference]: With dead ends: 1517 [2025-03-03 23:53:33,028 INFO L226 Difference]: Without dead ends: 1006 [2025-03-03 23:53:33,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-03 23:53:33,029 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 278 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:53:33,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 1447 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 23:53:33,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2025-03-03 23:53:33,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 748. [2025-03-03 23:53:33,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 590 states have (on average 1.2576271186440677) internal successors, (742), 592 states have internal predecessors, (742), 134 states have call successors, (134), 23 states have call predecessors, (134), 23 states have return successors, (134), 132 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-03 23:53:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1010 transitions. [2025-03-03 23:53:33,093 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1010 transitions. Word has length 210 [2025-03-03 23:53:33,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:53:33,094 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1010 transitions. [2025-03-03 23:53:33,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 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 23:53:33,094 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1010 transitions. [2025-03-03 23:53:33,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 23:53:33,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:53:33,095 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, 1, 1, 1] [2025-03-03 23:53:33,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 23:53:33,095 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:53:33,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:53:33,096 INFO L85 PathProgramCache]: Analyzing trace with hash 133038233, now seen corresponding path program 1 times [2025-03-03 23:53:33,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:53:33,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967628477] [2025-03-03 23:53:33,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:53:33,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:53:33,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 23:53:33,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 23:53:33,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:53:33,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:53:33,607 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 23:53:33,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:53:33,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967628477] [2025-03-03 23:53:33,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967628477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:53:33,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:53:33,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 23:53:33,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380987952] [2025-03-03 23:53:33,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:53:33,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 23:53:33,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:53:33,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 23:53:33,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:53:33,608 INFO L87 Difference]: Start difference. First operand 748 states and 1010 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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 23:53:34,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:53:34,776 INFO L93 Difference]: Finished difference Result 1804 states and 2439 transitions. [2025-03-03 23:53:34,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 23:53:34,776 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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 210 [2025-03-03 23:53:34,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:53:34,781 INFO L225 Difference]: With dead ends: 1804 [2025-03-03 23:53:34,781 INFO L226 Difference]: Without dead ends: 1293 [2025-03-03 23:53:34,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2025-03-03 23:53:34,782 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 360 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 23:53:34,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1285 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 23:53:34,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2025-03-03 23:53:34,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 903. [2025-03-03 23:53:34,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 709 states have (on average 1.2609308885754584) internal successors, (894), 711 states have internal predecessors, (894), 165 states have call successors, (165), 28 states have call predecessors, (165), 28 states have return successors, (165), 163 states have call predecessors, (165), 165 states have call successors, (165) [2025-03-03 23:53:34,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1224 transitions. [2025-03-03 23:53:34,877 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1224 transitions. Word has length 210 [2025-03-03 23:53:34,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:53:34,877 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1224 transitions. [2025-03-03 23:53:34,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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 23:53:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1224 transitions. [2025-03-03 23:53:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-03 23:53:34,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:53:34,878 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, 1, 1, 1, 1] [2025-03-03 23:53:34,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 23:53:34,878 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:53:34,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:53:34,878 INFO L85 PathProgramCache]: Analyzing trace with hash -509329697, now seen corresponding path program 1 times [2025-03-03 23:53:34,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:53:34,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429625594] [2025-03-03 23:53:34,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:53:34,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:53:34,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-03 23:53:34,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-03 23:53:34,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:53:34,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:53:35,157 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 23:53:35,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:53:35,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429625594] [2025-03-03 23:53:35,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429625594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:53:35,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:53:35,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 23:53:35,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990457504] [2025-03-03 23:53:35,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:53:35,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:53:35,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:53:35,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:53:35,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:53:35,158 INFO L87 Difference]: Start difference. First operand 903 states and 1224 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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 23:53:35,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:53:35,804 INFO L93 Difference]: Finished difference Result 2497 states and 3349 transitions. [2025-03-03 23:53:35,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 23:53:35,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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 211 [2025-03-03 23:53:35,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:53:35,809 INFO L225 Difference]: With dead ends: 2497 [2025-03-03 23:53:35,809 INFO L226 Difference]: Without dead ends: 1688 [2025-03-03 23:53:35,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:53:35,811 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 477 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:53:35,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 733 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 23:53:35,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2025-03-03 23:53:35,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1400. [2025-03-03 23:53:35,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1121 states have (on average 1.2622658340767172) internal successors, (1415), 1125 states have internal predecessors, (1415), 237 states have call successors, (237), 41 states have call predecessors, (237), 41 states have return successors, (237), 233 states have call predecessors, (237), 237 states have call successors, (237) [2025-03-03 23:53:35,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1889 transitions. [2025-03-03 23:53:35,945 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1889 transitions. Word has length 211 [2025-03-03 23:53:35,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:53:35,945 INFO L471 AbstractCegarLoop]: Abstraction has 1400 states and 1889 transitions. [2025-03-03 23:53:35,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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 23:53:35,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1889 transitions. [2025-03-03 23:53:35,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-03 23:53:35,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:53:35,947 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, 1, 1, 1, 1] [2025-03-03 23:53:35,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 23:53:35,947 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:53:35,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:53:35,947 INFO L85 PathProgramCache]: Analyzing trace with hash -802732704, now seen corresponding path program 1 times [2025-03-03 23:53:35,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:53:35,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143114637] [2025-03-03 23:53:35,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:53:35,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:53:35,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-03 23:53:35,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-03 23:53:35,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:53:35,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:53:37,643 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 23:53:37,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:53:37,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143114637] [2025-03-03 23:53:37,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143114637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:53:37,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:53:37,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 23:53:37,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139836241] [2025-03-03 23:53:37,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:53:37,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 23:53:37,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:53:37,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 23:53:37,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-03 23:53:37,644 INFO L87 Difference]: Start difference. First operand 1400 states and 1889 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 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 23:53:39,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:53:39,796 INFO L93 Difference]: Finished difference Result 3003 states and 4005 transitions. [2025-03-03 23:53:39,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 23:53:39,796 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 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 211 [2025-03-03 23:53:39,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:53:39,801 INFO L225 Difference]: With dead ends: 3003 [2025-03-03 23:53:39,801 INFO L226 Difference]: Without dead ends: 1995 [2025-03-03 23:53:39,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-03-03 23:53:39,803 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 342 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 23:53:39,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 1841 Invalid, 1388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1387 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 23:53:39,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2025-03-03 23:53:39,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1409. [2025-03-03 23:53:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1130 states have (on average 1.263716814159292) internal successors, (1428), 1134 states have internal predecessors, (1428), 237 states have call successors, (237), 41 states have call predecessors, (237), 41 states have return successors, (237), 233 states have call predecessors, (237), 237 states have call successors, (237) [2025-03-03 23:53:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 1902 transitions. [2025-03-03 23:53:39,919 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 1902 transitions. Word has length 211 [2025-03-03 23:53:39,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:53:39,920 INFO L471 AbstractCegarLoop]: Abstraction has 1409 states and 1902 transitions. [2025-03-03 23:53:39,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 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 23:53:39,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 1902 transitions. [2025-03-03 23:53:39,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-03 23:53:39,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:53:39,921 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, 1, 1, 1, 1] [2025-03-03 23:53:39,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 23:53:39,921 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:53:39,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:53:39,921 INFO L85 PathProgramCache]: Analyzing trace with hash -772117025, now seen corresponding path program 1 times [2025-03-03 23:53:39,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:53:39,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939722787] [2025-03-03 23:53:39,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:53:39,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:53:39,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-03 23:53:39,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-03 23:53:39,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:53:39,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:53:40,149 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 23:53:40,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:53:40,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939722787] [2025-03-03 23:53:40,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939722787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:53:40,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:53:40,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 23:53:40,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682417704] [2025-03-03 23:53:40,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:53:40,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:53:40,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:53:40,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:53:40,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:53:40,150 INFO L87 Difference]: Start difference. First operand 1409 states and 1902 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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 23:53:40,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:53:40,893 INFO L93 Difference]: Finished difference Result 2925 states and 3885 transitions. [2025-03-03 23:53:40,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:53:40,893 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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 211 [2025-03-03 23:53:40,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:53:40,898 INFO L225 Difference]: With dead ends: 2925 [2025-03-03 23:53:40,898 INFO L226 Difference]: Without dead ends: 2255 [2025-03-03 23:53:40,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:53:40,900 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 266 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 23:53:40,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 975 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 23:53:40,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2255 states. [2025-03-03 23:53:41,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2255 to 1437. [2025-03-03 23:53:41,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1158 states have (on average 1.2677029360967185) internal successors, (1468), 1162 states have internal predecessors, (1468), 237 states have call successors, (237), 41 states have call predecessors, (237), 41 states have return successors, (237), 233 states have call predecessors, (237), 237 states have call successors, (237) [2025-03-03 23:53:41,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 1942 transitions. [2025-03-03 23:53:41,029 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 1942 transitions. Word has length 211 [2025-03-03 23:53:41,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:53:41,029 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 1942 transitions. [2025-03-03 23:53:41,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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 23:53:41,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1942 transitions. [2025-03-03 23:53:41,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-03 23:53:41,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:53:41,030 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, 1, 1, 1, 1] [2025-03-03 23:53:41,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 23:53:41,031 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:53:41,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:53:41,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1065520032, now seen corresponding path program 1 times [2025-03-03 23:53:41,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:53:41,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616721096] [2025-03-03 23:53:41,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:53:41,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:53:41,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-03 23:53:41,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-03 23:53:41,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:53:41,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat