./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-61.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 6d70d056c1185c197829b20726e7e8c352a9989b4edbacd554399a50d7e882a4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:59:40,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:59:40,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:59:40,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:59:40,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:59:40,838 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:59:40,838 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:59:40,838 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:59:40,839 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:59:40,839 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:59:40,839 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:59:40,839 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:59:40,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:59:40,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:59:40,839 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:59:40,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:59:40,840 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:59:40,840 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:59:40,840 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:59:40,840 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:59:40,840 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:59:40,840 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:59:40,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:59:40,840 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:59:40,840 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:59:40,840 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:59:40,840 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:59:40,841 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:59:40,841 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:59:40,841 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:59:40,841 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:59:40,841 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:59:40,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:59:40,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:59:40,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:59:40,841 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:59:40,841 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:59:40,841 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:59:40,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:59:40,841 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:59:40,841 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:59:40,841 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:59:40,841 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:59:40,842 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-jdk21/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 -> 6d70d056c1185c197829b20726e7e8c352a9989b4edbacd554399a50d7e882a4 [2025-02-05 21:59:41,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:59:41,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:59:41,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:59:41,063 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:59:41,063 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:59:41,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-61.i [2025-02-05 21:59:42,195 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1b3f81d1/125eed4dab0649539722f738d36c2d24/FLAG4050b9519 [2025-02-05 21:59:42,484 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:59:42,485 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-61.i [2025-02-05 21:59:42,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1b3f81d1/125eed4dab0649539722f738d36c2d24/FLAG4050b9519 [2025-02-05 21:59:42,773 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1b3f81d1/125eed4dab0649539722f738d36c2d24 [2025-02-05 21:59:42,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:59:42,781 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:59:42,782 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:59:42,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:59:42,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:59:42,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:59:42" (1/1) ... [2025-02-05 21:59:42,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@357018ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:42, skipping insertion in model container [2025-02-05 21:59:42,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:59:42" (1/1) ... [2025-02-05 21:59:42,853 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:59:42,982 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-61.i[916,929] [2025-02-05 21:59:43,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:59:43,154 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:59:43,166 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-61.i[916,929] [2025-02-05 21:59:43,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:59:43,223 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:59:43,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:43 WrapperNode [2025-02-05 21:59:43,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:59:43,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:59:43,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:59:43,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:59:43,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:43" (1/1) ... [2025-02-05 21:59:43,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:43" (1/1) ... [2025-02-05 21:59:43,289 INFO L138 Inliner]: procedures = 26, calls = 122, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 886 [2025-02-05 21:59:43,290 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:59:43,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:59:43,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:59:43,291 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:59:43,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:43" (1/1) ... [2025-02-05 21:59:43,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:43" (1/1) ... [2025-02-05 21:59:43,302 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:43" (1/1) ... [2025-02-05 21:59:43,319 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-02-05 21:59:43,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:43" (1/1) ... [2025-02-05 21:59:43,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:43" (1/1) ... [2025-02-05 21:59:43,337 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:43" (1/1) ... [2025-02-05 21:59:43,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:43" (1/1) ... [2025-02-05 21:59:43,343 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:43" (1/1) ... [2025-02-05 21:59:43,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:43" (1/1) ... [2025-02-05 21:59:43,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:59:43,354 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:59:43,354 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:59:43,354 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:59:43,355 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:43" (1/1) ... [2025-02-05 21:59:43,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:59:43,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:59:43,405 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:59:43,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:59:43,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:59:43,425 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:59:43,425 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:59:43,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:59:43,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:59:43,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:59:43,535 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:59:43,536 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:59:44,323 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L698: havoc property_#t~ite83#1;havoc property_#t~ite82#1;havoc property_#t~bitwise81#1;havoc property_#t~short84#1; [2025-02-05 21:59:44,535 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-02-05 21:59:44,535 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:59:44,574 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:59:44,576 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:59:44,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:59:44 BoogieIcfgContainer [2025-02-05 21:59:44,577 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:59:44,578 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:59:44,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:59:44,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:59:44,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:59:42" (1/3) ... [2025-02-05 21:59:44,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45588c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:59:44, skipping insertion in model container [2025-02-05 21:59:44,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:43" (2/3) ... [2025-02-05 21:59:44,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45588c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:59:44, skipping insertion in model container [2025-02-05 21:59:44,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:59:44" (3/3) ... [2025-02-05 21:59:44,584 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-61.i [2025-02-05 21:59:44,594 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:59:44,597 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-61.i that has 2 procedures, 373 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:59:44,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:59:44,681 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;@2f2a3390, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:59:44,682 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:59:44,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 373 states, 261 states have (on average 1.6015325670498084) internal successors, (418), 262 states have internal predecessors, (418), 109 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 109 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-05 21:59:44,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2025-02-05 21:59:44,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:44,717 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:44,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:44,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:44,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1196601934, now seen corresponding path program 1 times [2025-02-05 21:59:44,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:44,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610448536] [2025-02-05 21:59:44,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:44,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:44,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-02-05 21:59:44,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-02-05 21:59:44,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:44,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:45,292 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 23328 trivial. 0 not checked. [2025-02-05 21:59:45,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:45,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610448536] [2025-02-05 21:59:45,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610448536] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:59:45,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804334595] [2025-02-05 21:59:45,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:45,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:59:45,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:59:45,295 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:59:45,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:59:45,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-02-05 21:59:45,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-02-05 21:59:45,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:45,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:45,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 1564 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:59:45,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:59:45,702 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 23328 trivial. 0 not checked. [2025-02-05 21:59:45,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:59:45,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804334595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:45,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:59:45,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:59:45,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229118565] [2025-02-05 21:59:45,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:45,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:59:45,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:45,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:59:45,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:59:45,732 INFO L87 Difference]: Start difference. First operand has 373 states, 261 states have (on average 1.6015325670498084) internal successors, (418), 262 states have internal predecessors, (418), 109 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 109 states have call predecessors, (109), 109 states have call successors, (109) Second operand has 2 states, 2 states have (on average 79.0) internal successors, (158), 2 states have internal predecessors, (158), 2 states have call successors, (109), 2 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 2 states have call successors, (109) [2025-02-05 21:59:45,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:45,832 INFO L93 Difference]: Finished difference Result 740 states and 1376 transitions. [2025-02-05 21:59:45,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:59:45,834 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 79.0) internal successors, (158), 2 states have internal predecessors, (158), 2 states have call successors, (109), 2 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 2 states have call successors, (109) Word has length 698 [2025-02-05 21:59:45,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:45,841 INFO L225 Difference]: With dead ends: 740 [2025-02-05 21:59:45,844 INFO L226 Difference]: Without dead ends: 370 [2025-02-05 21:59:45,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 699 GetRequests, 699 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-02-05 21:59:45,854 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:45,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 607 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:59:45,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-02-05 21:59:45,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-02-05 21:59:45,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 259 states have (on average 1.579150579150579) internal successors, (409), 259 states have internal predecessors, (409), 109 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 109 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-05 21:59:45,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 627 transitions. [2025-02-05 21:59:45,965 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 627 transitions. Word has length 698 [2025-02-05 21:59:45,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:45,967 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 627 transitions. [2025-02-05 21:59:45,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 79.0) internal successors, (158), 2 states have internal predecessors, (158), 2 states have call successors, (109), 2 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 2 states have call successors, (109) [2025-02-05 21:59:45,968 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 627 transitions. [2025-02-05 21:59:45,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2025-02-05 21:59:45,994 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:45,994 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:46,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:59:46,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:59:46,195 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:46,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:46,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1825360073, now seen corresponding path program 1 times [2025-02-05 21:59:46,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:46,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76156493] [2025-02-05 21:59:46,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:46,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:46,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-02-05 21:59:46,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-02-05 21:59:46,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:46,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:59:46,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:46,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76156493] [2025-02-05 21:59:46,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76156493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:46,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:46,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:46,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43070913] [2025-02-05 21:59:46,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:46,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:46,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:46,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:46,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:46,929 INFO L87 Difference]: Start difference. First operand 370 states and 627 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:59:47,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:47,062 INFO L93 Difference]: Finished difference Result 978 states and 1664 transitions. [2025-02-05 21:59:47,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:47,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 698 [2025-02-05 21:59:47,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:47,074 INFO L225 Difference]: With dead ends: 978 [2025-02-05 21:59:47,074 INFO L226 Difference]: Without dead ends: 611 [2025-02-05 21:59:47,075 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-02-05 21:59:47,075 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 391 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:47,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1175 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:47,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-02-05 21:59:47,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 608. [2025-02-05 21:59:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 460 states have (on average 1.6130434782608696) internal successors, (742), 461 states have internal predecessors, (742), 145 states have call successors, (145), 2 states have call predecessors, (145), 2 states have return successors, (145), 144 states have call predecessors, (145), 145 states have call successors, (145) [2025-02-05 21:59:47,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1032 transitions. [2025-02-05 21:59:47,147 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1032 transitions. Word has length 698 [2025-02-05 21:59:47,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:47,152 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 1032 transitions. [2025-02-05 21:59:47,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:59:47,152 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1032 transitions. [2025-02-05 21:59:47,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2025-02-05 21:59:47,159 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:47,160 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:47,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:59:47,160 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:47,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:47,161 INFO L85 PathProgramCache]: Analyzing trace with hash -64109840, now seen corresponding path program 1 times [2025-02-05 21:59:47,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:47,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552578957] [2025-02-05 21:59:47,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:47,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:47,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-02-05 21:59:47,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-02-05 21:59:47,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:47,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:47,613 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:59:47,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:47,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552578957] [2025-02-05 21:59:47,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552578957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:47,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:47,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:47,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034608749] [2025-02-05 21:59:47,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:47,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:47,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:47,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:47,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:47,619 INFO L87 Difference]: Start difference. First operand 608 states and 1032 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:59:47,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:47,797 INFO L93 Difference]: Finished difference Result 1808 states and 3072 transitions. [2025-02-05 21:59:47,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:47,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 699 [2025-02-05 21:59:47,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:47,814 INFO L225 Difference]: With dead ends: 1808 [2025-02-05 21:59:47,816 INFO L226 Difference]: Without dead ends: 1203 [2025-02-05 21:59:47,824 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-02-05 21:59:47,824 INFO L435 NwaCegarLoop]: 1055 mSDtfsCounter, 586 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:47,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1655 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:47,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2025-02-05 21:59:47,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1201. [2025-02-05 21:59:47,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 906 states have (on average 1.609271523178808) internal successors, (1458), 908 states have internal predecessors, (1458), 290 states have call successors, (290), 4 states have call predecessors, (290), 4 states have return successors, (290), 288 states have call predecessors, (290), 290 states have call successors, (290) [2025-02-05 21:59:47,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 2038 transitions. [2025-02-05 21:59:47,932 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 2038 transitions. Word has length 699 [2025-02-05 21:59:47,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:47,933 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 2038 transitions. [2025-02-05 21:59:47,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:59:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 2038 transitions. [2025-02-05 21:59:47,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2025-02-05 21:59:47,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:47,938 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:47,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:59:47,938 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:47,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:47,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2141319183, now seen corresponding path program 1 times [2025-02-05 21:59:47,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:47,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975310946] [2025-02-05 21:59:47,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:47,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:47,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-02-05 21:59:48,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-02-05 21:59:48,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:48,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:48,269 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:59:48,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:48,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975310946] [2025-02-05 21:59:48,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975310946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:48,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:48,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:48,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471683848] [2025-02-05 21:59:48,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:48,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:48,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:48,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:48,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:48,272 INFO L87 Difference]: Start difference. First operand 1201 states and 2038 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:59:48,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:48,347 INFO L93 Difference]: Finished difference Result 2399 states and 4073 transitions. [2025-02-05 21:59:48,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:48,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 699 [2025-02-05 21:59:48,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:48,355 INFO L225 Difference]: With dead ends: 2399 [2025-02-05 21:59:48,356 INFO L226 Difference]: Without dead ends: 1201 [2025-02-05 21:59:48,358 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-02-05 21:59:48,359 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 0 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:48,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1205 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:59:48,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2025-02-05 21:59:48,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1201. [2025-02-05 21:59:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 906 states have (on average 1.6048565121412803) internal successors, (1454), 908 states have internal predecessors, (1454), 290 states have call successors, (290), 4 states have call predecessors, (290), 4 states have return successors, (290), 288 states have call predecessors, (290), 290 states have call successors, (290) [2025-02-05 21:59:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 2034 transitions. [2025-02-05 21:59:48,452 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 2034 transitions. Word has length 699 [2025-02-05 21:59:48,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:48,453 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 2034 transitions. [2025-02-05 21:59:48,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:59:48,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 2034 transitions. [2025-02-05 21:59:48,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2025-02-05 21:59:48,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:48,461 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:48,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:59:48,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:48,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:48,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1309176242, now seen corresponding path program 1 times [2025-02-05 21:59:48,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:48,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757308643] [2025-02-05 21:59:48,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:48,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:48,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-02-05 21:59:48,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-02-05 21:59:48,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:48,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:59:48,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:48,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757308643] [2025-02-05 21:59:48,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757308643] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:48,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:48,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:48,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087342841] [2025-02-05 21:59:48,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:48,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:48,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:48,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:48,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:48,851 INFO L87 Difference]: Start difference. First operand 1201 states and 2034 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:59:49,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:49,005 INFO L93 Difference]: Finished difference Result 3297 states and 5592 transitions. [2025-02-05 21:59:49,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:49,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 699 [2025-02-05 21:59:49,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:49,015 INFO L225 Difference]: With dead ends: 3297 [2025-02-05 21:59:49,015 INFO L226 Difference]: Without dead ends: 2099 [2025-02-05 21:59:49,018 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-02-05 21:59:49,018 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 378 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:49,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1389 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:49,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2025-02-05 21:59:49,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 2093. [2025-02-05 21:59:49,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2093 states, 1666 states have (on average 1.6302521008403361) internal successors, (2716), 1672 states have internal predecessors, (2716), 418 states have call successors, (418), 8 states have call predecessors, (418), 8 states have return successors, (418), 412 states have call predecessors, (418), 418 states have call successors, (418) [2025-02-05 21:59:49,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 3552 transitions. [2025-02-05 21:59:49,118 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 3552 transitions. Word has length 699 [2025-02-05 21:59:49,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:49,119 INFO L471 AbstractCegarLoop]: Abstraction has 2093 states and 3552 transitions. [2025-02-05 21:59:49,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:59:49,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 3552 transitions. [2025-02-05 21:59:49,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2025-02-05 21:59:49,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:49,127 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:49,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:59:49,129 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:49,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:49,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1054162898, now seen corresponding path program 1 times [2025-02-05 21:59:49,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:49,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594373671] [2025-02-05 21:59:49,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:49,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:49,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-02-05 21:59:49,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-02-05 21:59:49,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:49,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:59:49,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:49,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594373671] [2025-02-05 21:59:49,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594373671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:49,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:49,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:59:49,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887284362] [2025-02-05 21:59:49,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:49,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:59:49,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:49,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:59:49,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:59:49,537 INFO L87 Difference]: Start difference. First operand 2093 states and 3552 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:59:49,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:49,781 INFO L93 Difference]: Finished difference Result 6273 states and 10650 transitions. [2025-02-05 21:59:49,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:49,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 699 [2025-02-05 21:59:49,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:49,807 INFO L225 Difference]: With dead ends: 6273 [2025-02-05 21:59:49,807 INFO L226 Difference]: Without dead ends: 4183 [2025-02-05 21:59:49,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:59:49,816 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 420 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:49,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 1766 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:49,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4183 states. [2025-02-05 21:59:50,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4183 to 4177. [2025-02-05 21:59:50,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4177 states, 3324 states have (on average 1.628158844765343) internal successors, (5412), 3336 states have internal predecessors, (5412), 836 states have call successors, (836), 16 states have call predecessors, (836), 16 states have return successors, (836), 824 states have call predecessors, (836), 836 states have call successors, (836) [2025-02-05 21:59:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4177 states to 4177 states and 7084 transitions. [2025-02-05 21:59:50,067 INFO L78 Accepts]: Start accepts. Automaton has 4177 states and 7084 transitions. Word has length 699 [2025-02-05 21:59:50,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:50,068 INFO L471 AbstractCegarLoop]: Abstraction has 4177 states and 7084 transitions. [2025-02-05 21:59:50,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:59:50,069 INFO L276 IsEmpty]: Start isEmpty. Operand 4177 states and 7084 transitions. [2025-02-05 21:59:50,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2025-02-05 21:59:50,075 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:50,076 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:50,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:59:50,076 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:50,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:50,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1155074865, now seen corresponding path program 1 times [2025-02-05 21:59:50,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:50,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231580535] [2025-02-05 21:59:50,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:50,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:50,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-02-05 21:59:50,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-02-05 21:59:50,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:50,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:59:50,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:50,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231580535] [2025-02-05 21:59:50,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231580535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:50,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:50,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:50,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531738948] [2025-02-05 21:59:50,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:50,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:50,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:50,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:50,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:50,777 INFO L87 Difference]: Start difference. First operand 4177 states and 7084 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:59:51,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:51,065 INFO L93 Difference]: Finished difference Result 12525 states and 21246 transitions. [2025-02-05 21:59:51,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:51,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 699 [2025-02-05 21:59:51,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:51,107 INFO L225 Difference]: With dead ends: 12525 [2025-02-05 21:59:51,108 INFO L226 Difference]: Without dead ends: 8351 [2025-02-05 21:59:51,118 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-02-05 21:59:51,119 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 434 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:51,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1203 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:51,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8351 states. [2025-02-05 21:59:51,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8351 to 8349. [2025-02-05 21:59:51,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8349 states, 6644 states have (on average 1.621312462372065) internal successors, (10772), 6668 states have internal predecessors, (10772), 1672 states have call successors, (1672), 32 states have call predecessors, (1672), 32 states have return successors, (1672), 1648 states have call predecessors, (1672), 1672 states have call successors, (1672) [2025-02-05 21:59:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8349 states to 8349 states and 14116 transitions. [2025-02-05 21:59:51,602 INFO L78 Accepts]: Start accepts. Automaton has 8349 states and 14116 transitions. Word has length 699 [2025-02-05 21:59:51,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:51,603 INFO L471 AbstractCegarLoop]: Abstraction has 8349 states and 14116 transitions. [2025-02-05 21:59:51,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:59:51,603 INFO L276 IsEmpty]: Start isEmpty. Operand 8349 states and 14116 transitions. [2025-02-05 21:59:51,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2025-02-05 21:59:51,611 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:51,611 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:51,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:59:51,611 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:51,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:51,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1247348207, now seen corresponding path program 1 times [2025-02-05 21:59:51,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:51,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71724467] [2025-02-05 21:59:51,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:51,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:51,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-02-05 21:59:51,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-02-05 21:59:51,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:51,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:51,831 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:59:51,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:51,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71724467] [2025-02-05 21:59:51,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71724467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:51,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:51,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:59:51,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120543868] [2025-02-05 21:59:51,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:51,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:59:51,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:51,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:59:51,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:59:51,834 INFO L87 Difference]: Start difference. First operand 8349 states and 14116 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:59:52,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:52,398 INFO L93 Difference]: Finished difference Result 17433 states and 29508 transitions. [2025-02-05 21:59:52,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:59:52,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 699 [2025-02-05 21:59:52,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:52,456 INFO L225 Difference]: With dead ends: 17433 [2025-02-05 21:59:52,457 INFO L226 Difference]: Without dead ends: 8355 [2025-02-05 21:59:52,479 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-02-05 21:59:52,479 INFO L435 NwaCegarLoop]: 1076 mSDtfsCounter, 1379 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1379 SdHoareTripleChecker+Valid, 2451 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:52,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1379 Valid, 2451 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:59:52,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8355 states. [2025-02-05 21:59:53,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8355 to 8341. [2025-02-05 21:59:53,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8341 states, 6636 states have (on average 1.6124171187462326) internal successors, (10700), 6660 states have internal predecessors, (10700), 1672 states have call successors, (1672), 32 states have call predecessors, (1672), 32 states have return successors, (1672), 1648 states have call predecessors, (1672), 1672 states have call successors, (1672) [2025-02-05 21:59:53,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8341 states to 8341 states and 14044 transitions. [2025-02-05 21:59:53,078 INFO L78 Accepts]: Start accepts. Automaton has 8341 states and 14044 transitions. Word has length 699 [2025-02-05 21:59:53,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:53,079 INFO L471 AbstractCegarLoop]: Abstraction has 8341 states and 14044 transitions. [2025-02-05 21:59:53,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:59:53,080 INFO L276 IsEmpty]: Start isEmpty. Operand 8341 states and 14044 transitions. [2025-02-05 21:59:53,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2025-02-05 21:59:53,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:53,091 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:53,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:59:53,092 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:53,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:53,093 INFO L85 PathProgramCache]: Analyzing trace with hash -959769786, now seen corresponding path program 1 times [2025-02-05 21:59:53,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:53,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443173860] [2025-02-05 21:59:53,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:53,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:53,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes. [2025-02-05 21:59:53,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements. [2025-02-05 21:59:53,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:53,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:59:53,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:53,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443173860] [2025-02-05 21:59:53,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443173860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:53,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:53,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:53,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420782776] [2025-02-05 21:59:53,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:53,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:53,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:53,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:53,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:53,549 INFO L87 Difference]: Start difference. First operand 8341 states and 14044 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:59:53,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:53,998 INFO L93 Difference]: Finished difference Result 20889 states and 35194 transitions. [2025-02-05 21:59:53,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:53,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 700 [2025-02-05 21:59:54,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:54,038 INFO L225 Difference]: With dead ends: 20889 [2025-02-05 21:59:54,039 INFO L226 Difference]: Without dead ends: 12551 [2025-02-05 21:59:54,059 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-02-05 21:59:54,061 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 408 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:54,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 1343 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:54,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12551 states. [2025-02-05 21:59:54,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12551 to 12549. [2025-02-05 21:59:54,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12549 states, 9992 states have (on average 1.611689351481185) internal successors, (16104), 10028 states have internal predecessors, (16104), 2508 states have call successors, (2508), 48 states have call predecessors, (2508), 48 states have return successors, (2508), 2472 states have call predecessors, (2508), 2508 states have call successors, (2508) [2025-02-05 21:59:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12549 states to 12549 states and 21120 transitions. [2025-02-05 21:59:54,579 INFO L78 Accepts]: Start accepts. Automaton has 12549 states and 21120 transitions. Word has length 700 [2025-02-05 21:59:54,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:54,580 INFO L471 AbstractCegarLoop]: Abstraction has 12549 states and 21120 transitions. [2025-02-05 21:59:54,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:59:54,580 INFO L276 IsEmpty]: Start isEmpty. Operand 12549 states and 21120 transitions. [2025-02-05 21:59:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2025-02-05 21:59:54,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:54,590 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:54,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:59:54,591 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:54,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:54,591 INFO L85 PathProgramCache]: Analyzing trace with hash 942590822, now seen corresponding path program 1 times [2025-02-05 21:59:54,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:54,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735587970] [2025-02-05 21:59:54,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:54,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:54,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes. [2025-02-05 21:59:54,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements. [2025-02-05 21:59:54,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:54,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:55,280 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:59:55,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:55,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735587970] [2025-02-05 21:59:55,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735587970] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:55,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:55,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 21:59:55,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748655628] [2025-02-05 21:59:55,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:55,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:59:55,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:55,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:59:55,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:59:55,281 INFO L87 Difference]: Start difference. First operand 12549 states and 21120 transitions. Second operand has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 22:00:04,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:00:04,198 INFO L93 Difference]: Finished difference Result 176043 states and 295191 transitions. [2025-02-05 22:00:04,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 22:00:04,199 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 700 [2025-02-05 22:00:04,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:00:04,737 INFO L225 Difference]: With dead ends: 176043 [2025-02-05 22:00:04,738 INFO L226 Difference]: Without dead ends: 163497 [2025-02-05 22:00:04,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2025-02-05 22:00:04,831 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 4891 mSDsluCounter, 7829 mSDsCounter, 0 mSdLazyCounter, 4852 mSolverCounterSat, 675 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4891 SdHoareTripleChecker+Valid, 8725 SdHoareTripleChecker+Invalid, 5527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 675 IncrementalHoareTripleChecker+Valid, 4852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:00:04,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4891 Valid, 8725 Invalid, 5527 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [675 Valid, 4852 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-02-05 22:00:04,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163497 states. [2025-02-05 22:00:10,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163497 to 72527. [2025-02-05 22:00:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72527 states, 59422 states have (on average 1.6230015819056915) internal successors, (96442), 59674 states have internal predecessors, (96442), 12816 states have call successors, (12816), 288 states have call predecessors, (12816), 288 states have return successors, (12816), 12564 states have call predecessors, (12816), 12816 states have call successors, (12816) [2025-02-05 22:00:10,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72527 states to 72527 states and 122074 transitions. [2025-02-05 22:00:11,030 INFO L78 Accepts]: Start accepts. Automaton has 72527 states and 122074 transitions. Word has length 700 [2025-02-05 22:00:11,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:00:11,031 INFO L471 AbstractCegarLoop]: Abstraction has 72527 states and 122074 transitions. [2025-02-05 22:00:11,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 22:00:11,032 INFO L276 IsEmpty]: Start isEmpty. Operand 72527 states and 122074 transitions. [2025-02-05 22:00:11,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2025-02-05 22:00:11,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:00:11,062 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:00:11,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 22:00:11,063 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:00:11,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:00:11,063 INFO L85 PathProgramCache]: Analyzing trace with hash -993069465, now seen corresponding path program 1 times [2025-02-05 22:00:11,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:00:11,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951743029] [2025-02-05 22:00:11,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:00:11,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:00:11,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes. [2025-02-05 22:00:11,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements. [2025-02-05 22:00:11,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:00:11,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:00:12,205 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 22:00:12,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:00:12,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951743029] [2025-02-05 22:00:12,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951743029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:00:12,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:00:12,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 22:00:12,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255466911] [2025-02-05 22:00:12,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:00:12,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 22:00:12,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:00:12,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 22:00:12,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 22:00:12,207 INFO L87 Difference]: Start difference. First operand 72527 states and 122074 transitions. Second operand has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 22:00:19,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:00:19,621 INFO L93 Difference]: Finished difference Result 203315 states and 340816 transitions. [2025-02-05 22:00:19,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 22:00:19,622 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 700 [2025-02-05 22:00:19,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:00:20,002 INFO L225 Difference]: With dead ends: 203315 [2025-02-05 22:00:20,003 INFO L226 Difference]: Without dead ends: 130791 [2025-02-05 22:00:20,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-02-05 22:00:20,182 INFO L435 NwaCegarLoop]: 1501 mSDtfsCounter, 2641 mSDsluCounter, 3335 mSDsCounter, 0 mSdLazyCounter, 2689 mSolverCounterSat, 600 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2641 SdHoareTripleChecker+Valid, 4836 SdHoareTripleChecker+Invalid, 3289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 600 IncrementalHoareTripleChecker+Valid, 2689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 22:00:20,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2641 Valid, 4836 Invalid, 3289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [600 Valid, 2689 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 22:00:20,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130791 states. [2025-02-05 22:00:25,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130791 to 50337. [2025-02-05 22:00:25,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50337 states, 41600 states have (on average 1.6277884615384615) internal successors, (67716), 41768 states have internal predecessors, (67716), 8544 states have call successors, (8544), 192 states have call predecessors, (8544), 192 states have return successors, (8544), 8376 states have call predecessors, (8544), 8544 states have call successors, (8544) [2025-02-05 22:00:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50337 states to 50337 states and 84804 transitions. [2025-02-05 22:00:25,340 INFO L78 Accepts]: Start accepts. Automaton has 50337 states and 84804 transitions. Word has length 700 [2025-02-05 22:00:25,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:00:25,341 INFO L471 AbstractCegarLoop]: Abstraction has 50337 states and 84804 transitions. [2025-02-05 22:00:25,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 22:00:25,342 INFO L276 IsEmpty]: Start isEmpty. Operand 50337 states and 84804 transitions. [2025-02-05 22:00:25,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2025-02-05 22:00:25,368 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:00:25,368 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:00:25,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 22:00:25,369 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:00:25,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:00:25,370 INFO L85 PathProgramCache]: Analyzing trace with hash -266651417, now seen corresponding path program 1 times [2025-02-05 22:00:25,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:00:25,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369673274] [2025-02-05 22:00:25,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:00:25,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:00:25,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes. [2025-02-05 22:00:25,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements. [2025-02-05 22:00:25,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:00:25,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:00:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 22:00:25,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:00:25,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369673274] [2025-02-05 22:00:25,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369673274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:00:25,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:00:25,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:00:25,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141896203] [2025-02-05 22:00:25,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:00:25,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:00:25,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:00:25,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:00:25,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:00:25,922 INFO L87 Difference]: Start difference. First operand 50337 states and 84804 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 22:00:29,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:00:29,103 INFO L93 Difference]: Finished difference Result 150621 states and 253638 transitions. [2025-02-05 22:00:29,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:00:29,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 700 [2025-02-05 22:00:29,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:00:29,406 INFO L225 Difference]: With dead ends: 150621 [2025-02-05 22:00:29,406 INFO L226 Difference]: Without dead ends: 100287 [2025-02-05 22:00:29,518 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-02-05 22:00:29,518 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 394 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:00:29,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1284 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:00:29,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100287 states. [2025-02-05 22:00:33,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100287 to 100285. [2025-02-05 22:00:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100285 states, 82812 states have (on average 1.6214558276578275) internal successors, (134276), 83148 states have internal predecessors, (134276), 17088 states have call successors, (17088), 384 states have call predecessors, (17088), 384 states have return successors, (17088), 16752 states have call predecessors, (17088), 17088 states have call successors, (17088) [2025-02-05 22:00:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100285 states to 100285 states and 168452 transitions. [2025-02-05 22:00:34,341 INFO L78 Accepts]: Start accepts. Automaton has 100285 states and 168452 transitions. Word has length 700 [2025-02-05 22:00:34,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:00:34,343 INFO L471 AbstractCegarLoop]: Abstraction has 100285 states and 168452 transitions. [2025-02-05 22:00:34,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 22:00:34,344 INFO L276 IsEmpty]: Start isEmpty. Operand 100285 states and 168452 transitions. [2025-02-05 22:00:34,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2025-02-05 22:00:34,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:00:34,373 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:00:34,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 22:00:34,374 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:00:34,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:00:34,374 INFO L85 PathProgramCache]: Analyzing trace with hash 262267622, now seen corresponding path program 1 times [2025-02-05 22:00:34,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:00:34,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776133422] [2025-02-05 22:00:34,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:00:34,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:00:34,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes. [2025-02-05 22:00:34,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements. [2025-02-05 22:00:34,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:00:34,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:00:34,816 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 22:00:34,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:00:34,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776133422] [2025-02-05 22:00:34,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776133422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:00:34,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:00:34,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:00:34,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533338444] [2025-02-05 22:00:34,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:00:34,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:00:34,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:00:34,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:00:34,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:00:34,819 INFO L87 Difference]: Start difference. First operand 100285 states and 168452 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109)