./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-92.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_operatoramount_amount500_file-92.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 ad609929f6a2bce9c8e7d6ce2810824c22896d2feba55c71bcd35f06aeaf9282 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:45:45,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:45:45,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:45:45,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:45:45,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:45:45,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:45:45,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:45:45,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:45:45,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:45:45,789 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:45:45,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:45:45,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:45:45,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:45:45,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:45:45,791 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:45:45,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:45:45,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:45:45,792 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:45:45,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:45:45,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:45:45,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:45:45,792 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:45:45,792 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:45:45,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:45:45,793 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:45:45,793 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:45:45,793 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:45:45,793 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:45:45,793 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:45:45,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:45:45,793 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:45:45,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:45:45,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:45:45,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:45:45,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:45:45,795 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:45:45,795 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:45:45,795 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:45:45,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:45:45,795 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:45:45,795 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:45:45,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:45:45,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:45:45,795 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 -> ad609929f6a2bce9c8e7d6ce2810824c22896d2feba55c71bcd35f06aeaf9282 [2025-02-06 02:45:46,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:45:46,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:45:46,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:45:46,089 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:45:46,089 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:45:46,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-92.i [2025-02-06 02:45:47,365 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac1b4c111/6e08ac7e9eba42d48e57d9cdf060e192/FLAG3c600c64f [2025-02-06 02:45:47,719 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:45:47,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-92.i [2025-02-06 02:45:47,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac1b4c111/6e08ac7e9eba42d48e57d9cdf060e192/FLAG3c600c64f [2025-02-06 02:45:47,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac1b4c111/6e08ac7e9eba42d48e57d9cdf060e192 [2025-02-06 02:45:47,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:45:47,936 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:45:47,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:45:47,938 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:45:47,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:45:47,942 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:45:47" (1/1) ... [2025-02-06 02:45:47,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c442006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:45:47, skipping insertion in model container [2025-02-06 02:45:47,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:45:47" (1/1) ... [2025-02-06 02:45:47,984 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:45:48,128 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_operatoramount_amount500_file-92.i[916,929] [2025-02-06 02:45:48,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:45:48,414 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:45:48,422 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_operatoramount_amount500_file-92.i[916,929] [2025-02-06 02:45:48,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:45:48,601 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:45:48,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:45:48 WrapperNode [2025-02-06 02:45:48,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:45:48,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:45:48,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:45:48,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:45:48,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:45:48" (1/1) ... [2025-02-06 02:45:48,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:45:48" (1/1) ... [2025-02-06 02:45:48,717 INFO L138 Inliner]: procedures = 26, calls = 81, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 603 [2025-02-06 02:45:48,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:45:48,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:45:48,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:45:48,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:45:48,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:45:48" (1/1) ... [2025-02-06 02:45:48,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:45:48" (1/1) ... [2025-02-06 02:45:48,746 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:45:48" (1/1) ... [2025-02-06 02:45:48,827 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-06 02:45:48,827 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:45:48" (1/1) ... [2025-02-06 02:45:48,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:45:48" (1/1) ... [2025-02-06 02:45:48,864 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:45:48" (1/1) ... [2025-02-06 02:45:48,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:45:48" (1/1) ... [2025-02-06 02:45:48,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:45:48" (1/1) ... [2025-02-06 02:45:48,884 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:45:48" (1/1) ... [2025-02-06 02:45:48,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:45:48,902 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:45:48,902 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:45:48,902 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:45:48,903 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:45:48" (1/1) ... [2025-02-06 02:45:48,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:45:48,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:45:48,937 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-06 02:45:48,945 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-06 02:45:48,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:45:48,965 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:45:48,965 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:45:48,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:45:48,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:45:48,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:45:49,108 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:45:49,110 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:45:50,065 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L606: havoc property_#t~bitwise47#1;havoc property_#t~short48#1;havoc property_#t~bitwise49#1;havoc property_#t~short50#1; [2025-02-06 02:45:50,208 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2025-02-06 02:45:50,208 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:45:50,240 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:45:50,241 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 02:45:50,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:45:50 BoogieIcfgContainer [2025-02-06 02:45:50,241 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:45:50,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:45:50,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:45:50,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:45:50,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:45:47" (1/3) ... [2025-02-06 02:45:50,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687f968e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:45:50, skipping insertion in model container [2025-02-06 02:45:50,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:45:48" (2/3) ... [2025-02-06 02:45:50,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687f968e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:45:50, skipping insertion in model container [2025-02-06 02:45:50,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:45:50" (3/3) ... [2025-02-06 02:45:50,255 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-92.i [2025-02-06 02:45:50,270 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:45:50,275 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-92.i that has 2 procedures, 244 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:45:50,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:45:50,363 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;@22296fe4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:45:50,364 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:45:50,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 244 states, 173 states have (on average 1.5260115606936415) internal successors, (264), 174 states have internal predecessors, (264), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-06 02:45:50,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-02-06 02:45:50,400 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:45:50,401 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:45:50,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:45:50,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:45:50,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1684262707, now seen corresponding path program 1 times [2025-02-06 02:45:50,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:45:50,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351233236] [2025-02-06 02:45:50,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:45:50,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:45:50,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-02-06 02:45:50,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-02-06 02:45:50,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:45:50,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:45:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 8978 trivial. 0 not checked. [2025-02-06 02:45:51,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:45:51,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351233236] [2025-02-06 02:45:51,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351233236] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:45:51,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727851702] [2025-02-06 02:45:51,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:45:51,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:45:51,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:45:51,161 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-06 02:45:51,162 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-06 02:45:51,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-02-06 02:45:51,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-02-06 02:45:51,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:45:51,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:45:51,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 1129 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:45:51,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:45:51,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 8978 trivial. 0 not checked. [2025-02-06 02:45:51,707 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:45:51,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727851702] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:45:51,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:45:51,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:45:51,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010029562] [2025-02-06 02:45:51,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:45:51,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:45:51,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:45:51,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:45:51,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:45:51,739 INFO L87 Difference]: Start difference. First operand has 244 states, 173 states have (on average 1.5260115606936415) internal successors, (264), 174 states have internal predecessors, (264), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) Second operand has 2 states, 2 states have (on average 65.5) internal successors, (131), 2 states have internal predecessors, (131), 2 states have call successors, (68), 2 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 2 states have call successors, (68) [2025-02-06 02:45:51,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:45:51,808 INFO L93 Difference]: Finished difference Result 482 states and 863 transitions. [2025-02-06 02:45:51,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:45:51,812 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 65.5) internal successors, (131), 2 states have internal predecessors, (131), 2 states have call successors, (68), 2 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 2 states have call successors, (68) Word has length 466 [2025-02-06 02:45:51,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:45:51,821 INFO L225 Difference]: With dead ends: 482 [2025-02-06 02:45:51,821 INFO L226 Difference]: Without dead ends: 241 [2025-02-06 02:45:51,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 467 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-06 02:45:51,832 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:45:51,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:45:51,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-02-06 02:45:51,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2025-02-06 02:45:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 171 states have (on average 1.5029239766081872) internal successors, (257), 171 states have internal predecessors, (257), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-06 02:45:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 393 transitions. [2025-02-06 02:45:51,910 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 393 transitions. Word has length 466 [2025-02-06 02:45:51,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:45:51,910 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 393 transitions. [2025-02-06 02:45:51,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 65.5) internal successors, (131), 2 states have internal predecessors, (131), 2 states have call successors, (68), 2 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 2 states have call successors, (68) [2025-02-06 02:45:51,911 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 393 transitions. [2025-02-06 02:45:51,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-02-06 02:45:51,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:45:51,923 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:45:51,934 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-06 02:45:52,123 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-06 02:45:52,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:45:52,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:45:52,127 INFO L85 PathProgramCache]: Analyzing trace with hash 336416206, now seen corresponding path program 1 times [2025-02-06 02:45:52,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:45:52,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59820578] [2025-02-06 02:45:52,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:45:52,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:45:52,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-02-06 02:45:52,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-02-06 02:45:52,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:45:52,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:45:52,876 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-02-06 02:45:52,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:45:52,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59820578] [2025-02-06 02:45:52,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59820578] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:45:52,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:45:52,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:45:52,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059462161] [2025-02-06 02:45:52,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:45:52,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:45:52,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:45:52,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:45:52,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:45:52,880 INFO L87 Difference]: Start difference. First operand 241 states and 393 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-02-06 02:45:53,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:45:53,024 INFO L93 Difference]: Finished difference Result 602 states and 984 transitions. [2025-02-06 02:45:53,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:45:53,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 466 [2025-02-06 02:45:53,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:45:53,033 INFO L225 Difference]: With dead ends: 602 [2025-02-06 02:45:53,033 INFO L226 Difference]: Without dead ends: 364 [2025-02-06 02:45:53,034 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-06 02:45:53,035 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 194 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:45:53,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 910 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:45:53,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-02-06 02:45:53,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2025-02-06 02:45:53,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 286 states have (on average 1.5524475524475525) internal successors, (444), 287 states have internal predecessors, (444), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-02-06 02:45:53,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 588 transitions. [2025-02-06 02:45:53,088 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 588 transitions. Word has length 466 [2025-02-06 02:45:53,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:45:53,089 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 588 transitions. [2025-02-06 02:45:53,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-02-06 02:45:53,090 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 588 transitions. [2025-02-06 02:45:53,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-02-06 02:45:53,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:45:53,099 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:45:53,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:45:53,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:45:53,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:45:53,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1902171682, now seen corresponding path program 1 times [2025-02-06 02:45:53,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:45:53,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687881827] [2025-02-06 02:45:53,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:45:53,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:45:53,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-02-06 02:45:53,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-02-06 02:45:53,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:45:53,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:45:53,555 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-02-06 02:45:53,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:45:53,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687881827] [2025-02-06 02:45:53,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687881827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:45:53,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:45:53,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:45:53,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751719484] [2025-02-06 02:45:53,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:45:53,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:45:53,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:45:53,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:45:53,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:45:53,564 INFO L87 Difference]: Start difference. First operand 361 states and 588 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-02-06 02:45:53,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:45:53,689 INFO L93 Difference]: Finished difference Result 1059 states and 1726 transitions. [2025-02-06 02:45:53,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:45:53,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 467 [2025-02-06 02:45:53,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:45:53,700 INFO L225 Difference]: With dead ends: 1059 [2025-02-06 02:45:53,702 INFO L226 Difference]: Without dead ends: 701 [2025-02-06 02:45:53,703 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-06 02:45:53,704 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 357 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:45:53,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 865 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:45:53,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-02-06 02:45:53,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 419. [2025-02-06 02:45:53,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 344 states have (on average 1.572674418604651) internal successors, (541), 345 states have internal predecessors, (541), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-02-06 02:45:53,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 685 transitions. [2025-02-06 02:45:53,788 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 685 transitions. Word has length 467 [2025-02-06 02:45:53,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:45:53,790 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 685 transitions. [2025-02-06 02:45:53,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-02-06 02:45:53,791 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 685 transitions. [2025-02-06 02:45:53,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-02-06 02:45:53,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:45:53,799 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:45:53,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:45:53,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:45:53,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:45:53,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1801259715, now seen corresponding path program 1 times [2025-02-06 02:45:53,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:45:53,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224802969] [2025-02-06 02:45:53,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:45:53,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:45:53,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-02-06 02:45:54,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-02-06 02:45:54,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:45:54,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:45:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-02-06 02:45:54,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:45:54,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224802969] [2025-02-06 02:45:54,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224802969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:45:54,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:45:54,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:45:54,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254757055] [2025-02-06 02:45:54,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:45:54,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:45:54,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:45:54,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:45:54,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:45:54,642 INFO L87 Difference]: Start difference. First operand 419 states and 685 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-02-06 02:45:55,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:45:55,046 INFO L93 Difference]: Finished difference Result 1534 states and 2519 transitions. [2025-02-06 02:45:55,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:45:55,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 467 [2025-02-06 02:45:55,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:45:55,057 INFO L225 Difference]: With dead ends: 1534 [2025-02-06 02:45:55,057 INFO L226 Difference]: Without dead ends: 1118 [2025-02-06 02:45:55,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:45:55,062 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 619 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:45:55,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 1529 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:45:55,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2025-02-06 02:45:55,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 829. [2025-02-06 02:45:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 680 states have (on average 1.5676470588235294) internal successors, (1066), 682 states have internal predecessors, (1066), 144 states have call successors, (144), 4 states have call predecessors, (144), 4 states have return successors, (144), 142 states have call predecessors, (144), 144 states have call successors, (144) [2025-02-06 02:45:55,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1354 transitions. [2025-02-06 02:45:55,177 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1354 transitions. Word has length 467 [2025-02-06 02:45:55,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:45:55,180 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1354 transitions. [2025-02-06 02:45:55,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-02-06 02:45:55,181 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1354 transitions. [2025-02-06 02:45:55,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-02-06 02:45:55,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:45:55,190 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:45:55,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:45:55,191 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:45:55,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:45:55,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2019627293, now seen corresponding path program 1 times [2025-02-06 02:45:55,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:45:55,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909414991] [2025-02-06 02:45:55,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:45:55,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:45:55,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-02-06 02:45:55,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-02-06 02:45:55,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:45:55,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:45:56,310 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-02-06 02:45:56,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:45:56,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909414991] [2025-02-06 02:45:56,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909414991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:45:56,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:45:56,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:45:56,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760328322] [2025-02-06 02:45:56,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:45:56,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:45:56,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:45:56,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:45:56,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:45:56,315 INFO L87 Difference]: Start difference. First operand 829 states and 1354 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-02-06 02:45:56,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:45:56,505 INFO L93 Difference]: Finished difference Result 2489 states and 4068 transitions. [2025-02-06 02:45:56,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:45:56,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 467 [2025-02-06 02:45:56,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:45:56,516 INFO L225 Difference]: With dead ends: 2489 [2025-02-06 02:45:56,516 INFO L226 Difference]: Without dead ends: 1663 [2025-02-06 02:45:56,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:45:56,519 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 210 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:45:56,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 1599 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:45:56,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2025-02-06 02:45:56,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1657. [2025-02-06 02:45:56,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1360 states have (on average 1.5588235294117647) internal successors, (2120), 1364 states have internal predecessors, (2120), 288 states have call successors, (288), 8 states have call predecessors, (288), 8 states have return successors, (288), 284 states have call predecessors, (288), 288 states have call successors, (288) [2025-02-06 02:45:56,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2696 transitions. [2025-02-06 02:45:56,667 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2696 transitions. Word has length 467 [2025-02-06 02:45:56,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:45:56,668 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2696 transitions. [2025-02-06 02:45:56,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-02-06 02:45:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2696 transitions. [2025-02-06 02:45:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-02-06 02:45:56,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:45:56,677 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:45:56,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:45:56,677 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:45:56,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:45:56,679 INFO L85 PathProgramCache]: Analyzing trace with hash 628185229, now seen corresponding path program 1 times [2025-02-06 02:45:56,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:45:56,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278182281] [2025-02-06 02:45:56,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:45:56,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:45:56,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-02-06 02:45:57,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-02-06 02:45:57,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:45:57,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:45:59,777 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-02-06 02:45:59,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:45:59,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278182281] [2025-02-06 02:45:59,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278182281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:45:59,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:45:59,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:45:59,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700418407] [2025-02-06 02:45:59,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:45:59,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:45:59,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:45:59,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:45:59,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:45:59,783 INFO L87 Difference]: Start difference. First operand 1657 states and 2696 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-02-06 02:46:01,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:01,116 INFO L93 Difference]: Finished difference Result 6465 states and 10513 transitions. [2025-02-06 02:46:01,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:46:01,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 468 [2025-02-06 02:46:01,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:01,150 INFO L225 Difference]: With dead ends: 6465 [2025-02-06 02:46:01,150 INFO L226 Difference]: Without dead ends: 4811 [2025-02-06 02:46:01,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:46:01,160 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 1025 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 2234 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:01,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 2234 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 02:46:01,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4811 states. [2025-02-06 02:46:01,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4811 to 3427. [2025-02-06 02:46:01,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3427 states, 2764 states have (on average 1.541244573082489) internal successors, (4260), 2773 states have internal predecessors, (4260), 644 states have call successors, (644), 18 states have call predecessors, (644), 18 states have return successors, (644), 635 states have call predecessors, (644), 644 states have call successors, (644) [2025-02-06 02:46:01,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 3427 states and 5548 transitions. [2025-02-06 02:46:01,578 INFO L78 Accepts]: Start accepts. Automaton has 3427 states and 5548 transitions. Word has length 468 [2025-02-06 02:46:01,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:01,579 INFO L471 AbstractCegarLoop]: Abstraction has 3427 states and 5548 transitions. [2025-02-06 02:46:01,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-02-06 02:46:01,579 INFO L276 IsEmpty]: Start isEmpty. Operand 3427 states and 5548 transitions. [2025-02-06 02:46:01,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-02-06 02:46:01,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:01,589 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:46:01,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:46:01,590 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:01,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:01,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1297348082, now seen corresponding path program 1 times [2025-02-06 02:46:01,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:01,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400679900] [2025-02-06 02:46:01,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:01,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:01,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-02-06 02:46:02,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-02-06 02:46:02,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:02,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:02,453 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-02-06 02:46:02,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:02,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400679900] [2025-02-06 02:46:02,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400679900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:02,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:02,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:46:02,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513462929] [2025-02-06 02:46:02,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:02,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:46:02,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:02,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:46:02,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:46:02,456 INFO L87 Difference]: Start difference. First operand 3427 states and 5548 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-02-06 02:46:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:02,970 INFO L93 Difference]: Finished difference Result 8113 states and 13139 transitions. [2025-02-06 02:46:02,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:46:02,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 468 [2025-02-06 02:46:02,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:02,998 INFO L225 Difference]: With dead ends: 8113 [2025-02-06 02:46:02,998 INFO L226 Difference]: Without dead ends: 4807 [2025-02-06 02:46:03,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:46:03,008 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 289 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:03,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1150 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:46:03,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4807 states. [2025-02-06 02:46:03,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4807 to 3430. [2025-02-06 02:46:03,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3430 states, 2767 states have (on average 1.5410191543187568) internal successors, (4264), 2775 states have internal predecessors, (4264), 644 states have call successors, (644), 18 states have call predecessors, (644), 18 states have return successors, (644), 636 states have call predecessors, (644), 644 states have call successors, (644) [2025-02-06 02:46:03,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3430 states to 3430 states and 5552 transitions. [2025-02-06 02:46:03,348 INFO L78 Accepts]: Start accepts. Automaton has 3430 states and 5552 transitions. Word has length 468 [2025-02-06 02:46:03,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:03,348 INFO L471 AbstractCegarLoop]: Abstraction has 3430 states and 5552 transitions. [2025-02-06 02:46:03,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-02-06 02:46:03,349 INFO L276 IsEmpty]: Start isEmpty. Operand 3430 states and 5552 transitions. [2025-02-06 02:46:03,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-02-06 02:46:03,357 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:03,357 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:46:03,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:46:03,358 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:03,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:03,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1826267121, now seen corresponding path program 1 times [2025-02-06 02:46:03,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:03,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562286947] [2025-02-06 02:46:03,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:03,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:03,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-02-06 02:46:03,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-02-06 02:46:03,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:03,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:04,078 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-02-06 02:46:04,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:04,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562286947] [2025-02-06 02:46:04,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562286947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:04,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:04,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:46:04,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797206908] [2025-02-06 02:46:04,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:04,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:46:04,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:04,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:46:04,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:46:04,082 INFO L87 Difference]: Start difference. First operand 3430 states and 5552 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-02-06 02:46:04,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:04,324 INFO L93 Difference]: Finished difference Result 5100 states and 8277 transitions. [2025-02-06 02:46:04,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:46:04,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 468 [2025-02-06 02:46:04,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:04,350 INFO L225 Difference]: With dead ends: 5100 [2025-02-06 02:46:04,351 INFO L226 Difference]: Without dead ends: 3446 [2025-02-06 02:46:04,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:46:04,359 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 3 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:04,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1152 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:46:04,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3446 states. [2025-02-06 02:46:04,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3446 to 3446. [2025-02-06 02:46:04,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3446 states, 2783 states have (on average 1.537908731584621) internal successors, (4280), 2791 states have internal predecessors, (4280), 644 states have call successors, (644), 18 states have call predecessors, (644), 18 states have return successors, (644), 636 states have call predecessors, (644), 644 states have call successors, (644) [2025-02-06 02:46:04,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3446 states to 3446 states and 5568 transitions. [2025-02-06 02:46:04,708 INFO L78 Accepts]: Start accepts. Automaton has 3446 states and 5568 transitions. Word has length 468 [2025-02-06 02:46:04,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:04,709 INFO L471 AbstractCegarLoop]: Abstraction has 3446 states and 5568 transitions. [2025-02-06 02:46:04,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-02-06 02:46:04,710 INFO L276 IsEmpty]: Start isEmpty. Operand 3446 states and 5568 transitions. [2025-02-06 02:46:04,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-02-06 02:46:04,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:04,718 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:46:04,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:46:04,719 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:04,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:04,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1834026480, now seen corresponding path program 1 times [2025-02-06 02:46:04,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:04,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637389338] [2025-02-06 02:46:04,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:04,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:04,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-02-06 02:46:05,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-02-06 02:46:05,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:05,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:06,398 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-02-06 02:46:06,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:06,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637389338] [2025-02-06 02:46:06,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637389338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:06,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:06,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:46:06,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218021333] [2025-02-06 02:46:06,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:06,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:46:06,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:06,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:46:06,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:46:06,401 INFO L87 Difference]: Start difference. First operand 3446 states and 5568 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-02-06 02:46:06,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:06,945 INFO L93 Difference]: Finished difference Result 7998 states and 12796 transitions. [2025-02-06 02:46:06,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:46:06,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 468 [2025-02-06 02:46:06,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:06,973 INFO L225 Difference]: With dead ends: 7998 [2025-02-06 02:46:06,973 INFO L226 Difference]: Without dead ends: 4676 [2025-02-06 02:46:06,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:46:06,983 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 997 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:06,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [997 Valid, 1658 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:46:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4676 states. [2025-02-06 02:46:07,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4676 to 3842. [2025-02-06 02:46:07,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3842 states, 3163 states have (on average 1.5327220992728423) internal successors, (4848), 3171 states have internal predecessors, (4848), 644 states have call successors, (644), 34 states have call predecessors, (644), 34 states have return successors, (644), 636 states have call predecessors, (644), 644 states have call successors, (644) [2025-02-06 02:46:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3842 states to 3842 states and 6136 transitions. [2025-02-06 02:46:07,317 INFO L78 Accepts]: Start accepts. Automaton has 3842 states and 6136 transitions. Word has length 468 [2025-02-06 02:46:07,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:07,318 INFO L471 AbstractCegarLoop]: Abstraction has 3842 states and 6136 transitions. [2025-02-06 02:46:07,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-02-06 02:46:07,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3842 states and 6136 transitions. [2025-02-06 02:46:07,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-02-06 02:46:07,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:07,332 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:46:07,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:46:07,332 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:07,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:07,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1501785137, now seen corresponding path program 1 times [2025-02-06 02:46:07,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:07,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124174614] [2025-02-06 02:46:07,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:07,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:07,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-02-06 02:46:07,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-02-06 02:46:07,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:07,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:08,546 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-02-06 02:46:08,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:08,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124174614] [2025-02-06 02:46:08,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124174614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:08,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:08,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:46:08,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680081940] [2025-02-06 02:46:08,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:08,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:46:08,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:08,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:46:08,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:46:08,550 INFO L87 Difference]: Start difference. First operand 3842 states and 6136 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-02-06 02:46:08,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:08,965 INFO L93 Difference]: Finished difference Result 9100 states and 14527 transitions. [2025-02-06 02:46:08,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:46:08,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 468 [2025-02-06 02:46:08,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:09,000 INFO L225 Difference]: With dead ends: 9100 [2025-02-06 02:46:09,001 INFO L226 Difference]: Without dead ends: 5382 [2025-02-06 02:46:09,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:46:09,011 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 419 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:09,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1509 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:46:09,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5382 states. [2025-02-06 02:46:09,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5382 to 4258. [2025-02-06 02:46:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4258 states, 3579 states have (on average 1.5333892148644872) internal successors, (5488), 3587 states have internal predecessors, (5488), 644 states have call successors, (644), 34 states have call predecessors, (644), 34 states have return successors, (644), 636 states have call predecessors, (644), 644 states have call successors, (644) [2025-02-06 02:46:09,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4258 states to 4258 states and 6776 transitions. [2025-02-06 02:46:09,314 INFO L78 Accepts]: Start accepts. Automaton has 4258 states and 6776 transitions. Word has length 468 [2025-02-06 02:46:09,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:09,315 INFO L471 AbstractCegarLoop]: Abstraction has 4258 states and 6776 transitions. [2025-02-06 02:46:09,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-02-06 02:46:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 4258 states and 6776 transitions. [2025-02-06 02:46:09,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-02-06 02:46:09,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:09,321 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:46:09,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:46:09,323 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:09,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:09,323 INFO L85 PathProgramCache]: Analyzing trace with hash -247572945, now seen corresponding path program 1 times [2025-02-06 02:46:09,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:09,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122373473] [2025-02-06 02:46:09,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:09,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:09,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-02-06 02:46:09,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-02-06 02:46:09,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:09,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-02-06 02:46:09,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:09,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122373473] [2025-02-06 02:46:09,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122373473] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:09,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:09,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:46:09,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155753747] [2025-02-06 02:46:09,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:09,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:46:09,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:09,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:46:09,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:46:09,906 INFO L87 Difference]: Start difference. First operand 4258 states and 6776 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-02-06 02:46:10,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:10,159 INFO L93 Difference]: Finished difference Result 8170 states and 12982 transitions. [2025-02-06 02:46:10,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:46:10,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 468 [2025-02-06 02:46:10,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:10,182 INFO L225 Difference]: With dead ends: 8170 [2025-02-06 02:46:10,182 INFO L226 Difference]: Without dead ends: 4036 [2025-02-06 02:46:10,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:46:10,194 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 184 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:10,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1247 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:46:10,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4036 states. [2025-02-06 02:46:10,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4036 to 4026. [2025-02-06 02:46:10,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4026 states, 3347 states have (on average 1.521362414102181) internal successors, (5092), 3355 states have internal predecessors, (5092), 644 states have call successors, (644), 34 states have call predecessors, (644), 34 states have return successors, (644), 636 states have call predecessors, (644), 644 states have call successors, (644) [2025-02-06 02:46:10,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4026 states to 4026 states and 6380 transitions. [2025-02-06 02:46:10,485 INFO L78 Accepts]: Start accepts. Automaton has 4026 states and 6380 transitions. Word has length 468 [2025-02-06 02:46:10,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:10,486 INFO L471 AbstractCegarLoop]: Abstraction has 4026 states and 6380 transitions. [2025-02-06 02:46:10,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-02-06 02:46:10,486 INFO L276 IsEmpty]: Start isEmpty. Operand 4026 states and 6380 transitions. [2025-02-06 02:46:10,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-02-06 02:46:10,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:10,492 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:46:10,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:46:10,493 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:10,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:10,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1892621340, now seen corresponding path program 1 times [2025-02-06 02:46:10,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:10,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444392923] [2025-02-06 02:46:10,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:10,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:10,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-02-06 02:46:17,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-02-06 02:46:17,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:17,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:32,148 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-02-06 02:46:32,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:32,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444392923] [2025-02-06 02:46:32,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444392923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:32,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:32,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-02-06 02:46:32,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805853075] [2025-02-06 02:46:32,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:32,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 02:46:32,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:32,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 02:46:32,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=643, Unknown=0, NotChecked=0, Total=702 [2025-02-06 02:46:32,152 INFO L87 Difference]: Start difference. First operand 4026 states and 6380 transitions. Second operand has 27 states, 27 states have (on average 4.888888888888889) internal successors, (132), 27 states have internal predecessors, (132), 8 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 8 states have call predecessors, (68), 8 states have call successors, (68) [2025-02-06 02:46:44,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:44,405 INFO L93 Difference]: Finished difference Result 11109 states and 17689 transitions. [2025-02-06 02:46:44,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 02:46:44,405 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.888888888888889) internal successors, (132), 27 states have internal predecessors, (132), 8 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 8 states have call predecessors, (68), 8 states have call successors, (68) Word has length 469 [2025-02-06 02:46:44,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:44,433 INFO L225 Difference]: With dead ends: 11109 [2025-02-06 02:46:44,433 INFO L226 Difference]: Without dead ends: 9147 [2025-02-06 02:46:44,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=485, Invalid=1867, Unknown=0, NotChecked=0, Total=2352 [2025-02-06 02:46:44,444 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 5932 mSDsluCounter, 7338 mSDsCounter, 0 mSdLazyCounter, 5772 mSolverCounterSat, 842 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5932 SdHoareTripleChecker+Valid, 7812 SdHoareTripleChecker+Invalid, 6614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 842 IncrementalHoareTripleChecker+Valid, 5772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:44,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5932 Valid, 7812 Invalid, 6614 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [842 Valid, 5772 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2025-02-06 02:46:44,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9147 states. [2025-02-06 02:46:44,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9147 to 4123. [2025-02-06 02:46:44,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4123 states, 3439 states have (on average 1.5210817097993603) internal successors, (5231), 3447 states have internal predecessors, (5231), 644 states have call successors, (644), 39 states have call predecessors, (644), 39 states have return successors, (644), 636 states have call predecessors, (644), 644 states have call successors, (644) [2025-02-06 02:46:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4123 states to 4123 states and 6519 transitions. [2025-02-06 02:46:44,777 INFO L78 Accepts]: Start accepts. Automaton has 4123 states and 6519 transitions. Word has length 469 [2025-02-06 02:46:44,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:44,778 INFO L471 AbstractCegarLoop]: Abstraction has 4123 states and 6519 transitions. [2025-02-06 02:46:44,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.888888888888889) internal successors, (132), 27 states have internal predecessors, (132), 8 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 8 states have call predecessors, (68), 8 states have call successors, (68) [2025-02-06 02:46:44,778 INFO L276 IsEmpty]: Start isEmpty. Operand 4123 states and 6519 transitions. [2025-02-06 02:46:44,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-02-06 02:46:44,784 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:44,785 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:46:44,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:46:44,785 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:44,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:44,786 INFO L85 PathProgramCache]: Analyzing trace with hash -431406499, now seen corresponding path program 1 times [2025-02-06 02:46:44,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:44,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094364146] [2025-02-06 02:46:44,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:44,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:44,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-02-06 02:46:45,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-02-06 02:46:45,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:45,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:47,844 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-02-06 02:46:47,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:47,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094364146] [2025-02-06 02:46:47,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094364146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:47,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:47,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 02:46:47,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189858028] [2025-02-06 02:46:47,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:47,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 02:46:47,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:47,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 02:46:47,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-06 02:46:47,847 INFO L87 Difference]: Start difference. First operand 4123 states and 6519 transitions. Second operand has 14 states, 14 states have (on average 9.428571428571429) internal successors, (132), 14 states have internal predecessors, (132), 4 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) [2025-02-06 02:46:51,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:51,350 INFO L93 Difference]: Finished difference Result 11363 states and 17769 transitions. [2025-02-06 02:46:51,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 02:46:51,350 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.428571428571429) internal successors, (132), 14 states have internal predecessors, (132), 4 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) Word has length 469 [2025-02-06 02:46:51,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:51,382 INFO L225 Difference]: With dead ends: 11363 [2025-02-06 02:46:51,382 INFO L226 Difference]: Without dead ends: 9401 [2025-02-06 02:46:51,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2025-02-06 02:46:51,391 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 1503 mSDsluCounter, 3851 mSDsCounter, 0 mSdLazyCounter, 2656 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 4585 SdHoareTripleChecker+Invalid, 3117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 2656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:51,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 4585 Invalid, 3117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [461 Valid, 2656 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-06 02:46:51,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9401 states. [2025-02-06 02:46:51,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9401 to 6073. [2025-02-06 02:46:51,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6073 states, 5228 states have (on average 1.5244835501147667) internal successors, (7970), 5252 states have internal predecessors, (7970), 772 states have call successors, (772), 72 states have call predecessors, (772), 72 states have return successors, (772), 748 states have call predecessors, (772), 772 states have call successors, (772) [2025-02-06 02:46:51,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6073 states to 6073 states and 9514 transitions. [2025-02-06 02:46:51,844 INFO L78 Accepts]: Start accepts. Automaton has 6073 states and 9514 transitions. Word has length 469 [2025-02-06 02:46:51,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:51,845 INFO L471 AbstractCegarLoop]: Abstraction has 6073 states and 9514 transitions. [2025-02-06 02:46:51,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.428571428571429) internal successors, (132), 14 states have internal predecessors, (132), 4 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) [2025-02-06 02:46:51,845 INFO L276 IsEmpty]: Start isEmpty. Operand 6073 states and 9514 transitions. [2025-02-06 02:46:51,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-02-06 02:46:51,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:51,855 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:46:51,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:46:51,855 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:51,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:51,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1284544477, now seen corresponding path program 1 times [2025-02-06 02:46:51,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:51,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093855088] [2025-02-06 02:46:51,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:51,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:51,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes.