./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-93.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-93.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 1b2580b05f716b3340a57c87bfc63ece4a11ad4db6012c36753c978126f42a07 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:45:45,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:45:45,249 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,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:45:45,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:45:45,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:45:45,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:45:45,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:45:45,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:45:45,267 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:45:45,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:45:45,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:45:45,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:45:45,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:45:45,267 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:45:45,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:45:45,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:45:45,268 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:45:45,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:45:45,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:45:45,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:45:45,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:45:45,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:45:45,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:45:45,268 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:45:45,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:45:45,268 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:45:45,268 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:45:45,269 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:45:45,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:45:45,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:45:45,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:45:45,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:45:45,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:45:45,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:45:45,269 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:45:45,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:45:45,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:45:45,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:45:45,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:45:45,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:45:45,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:45:45,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:45:45,270 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 -> 1b2580b05f716b3340a57c87bfc63ece4a11ad4db6012c36753c978126f42a07 [2025-02-06 02:45:45,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:45:45,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:45:45,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:45:45,498 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:45:45,499 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:45:45,500 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-93.i [2025-02-06 02:45:46,688 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce88aaffe/3f825a57d8254443864817b6d8d1a068/FLAGbf717a98e [2025-02-06 02:45:47,009 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:45:47,014 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-93.i [2025-02-06 02:45:47,023 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce88aaffe/3f825a57d8254443864817b6d8d1a068/FLAGbf717a98e [2025-02-06 02:45:47,034 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce88aaffe/3f825a57d8254443864817b6d8d1a068 [2025-02-06 02:45:47,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:45:47,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:45:47,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:45:47,038 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:45:47,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:45:47,041 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,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61f15af8 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,042 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,073 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:45:47,184 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-93.i[916,929] [2025-02-06 02:45:47,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:45:47,445 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:45:47,453 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-93.i[916,929] [2025-02-06 02:45:47,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:45:47,540 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:45:47,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:45:47 WrapperNode [2025-02-06 02:45:47,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:45:47,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:45:47,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:45:47,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:45:47,546 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:47" (1/1) ... [2025-02-06 02:45:47,562 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:47" (1/1) ... [2025-02-06 02:45:47,627 INFO L138 Inliner]: procedures = 26, calls = 92, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 836 [2025-02-06 02:45:47,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:45:47,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:45:47,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:45:47,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:45:47,634 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:47" (1/1) ... [2025-02-06 02:45:47,635 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:47" (1/1) ... [2025-02-06 02:45:47,647 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:47" (1/1) ... [2025-02-06 02:45:47,726 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:47,726 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:47" (1/1) ... [2025-02-06 02:45:47,727 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:47" (1/1) ... [2025-02-06 02:45:47,769 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:47" (1/1) ... [2025-02-06 02:45:47,777 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:47" (1/1) ... [2025-02-06 02:45:47,792 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:47" (1/1) ... [2025-02-06 02:45:47,798 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:47" (1/1) ... [2025-02-06 02:45:47,817 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:45:47,819 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:45:47,819 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:45:47,819 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:45:47,820 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:45:47" (1/1) ... [2025-02-06 02:45:47,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:45:47,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:45:47,851 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:47,856 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:47,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:45:47,875 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:45:47,876 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:45:47,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:45:47,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:45:47,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:45:48,000 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:45:48,001 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:45:48,894 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L653: havoc property_#t~bitwise62#1;havoc property_#t~bitwise63#1;havoc property_#t~short64#1;havoc property_#t~ite66#1;havoc property_#t~bitwise65#1;havoc property_#t~short67#1;havoc property_#t~bitwise68#1;havoc property_#t~ite70#1;havoc property_#t~bitwise69#1;havoc property_#t~bitwise71#1;havoc property_#t~short72#1;havoc property_#t~ite74#1;havoc property_#t~bitwise73#1;havoc property_#t~short75#1;havoc property_#t~ite79#1;havoc property_#t~bitwise76#1;havoc property_#t~ite78#1;havoc property_#t~bitwise77#1;havoc property_#t~short80#1; [2025-02-06 02:45:49,045 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2025-02-06 02:45:49,045 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:45:49,064 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:45:49,065 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:45:49,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:45:49 BoogieIcfgContainer [2025-02-06 02:45:49,065 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:45:49,066 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:45:49,066 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:45:49,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:45:49,069 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:49,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5f246b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:45:49, skipping insertion in model container [2025-02-06 02:45:49,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:45:47" (2/3) ... [2025-02-06 02:45:49,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5f246b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:45:49, skipping insertion in model container [2025-02-06 02:45:49,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:45:49" (3/3) ... [2025-02-06 02:45:49,071 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-93.i [2025-02-06 02:45:49,080 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:45:49,082 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-93.i that has 2 procedures, 328 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:45:49,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:45:49,125 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;@7f042503, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:45:49,126 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:45:49,129 INFO L276 IsEmpty]: Start isEmpty. Operand has 328 states, 246 states have (on average 1.5121951219512195) internal successors, (372), 247 states have internal predecessors, (372), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-02-06 02:45:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-02-06 02:45:49,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:45:49,144 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,144 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:45:49,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:45:49,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1424482083, now seen corresponding path program 1 times [2025-02-06 02:45:49,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:45:49,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100241229] [2025-02-06 02:45:49,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:45:49,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:45:49,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-02-06 02:45:49,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-02-06 02:45:49,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:45:49,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:45:49,637 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 12168 trivial. 0 not checked. [2025-02-06 02:45:49,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:45:49,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100241229] [2025-02-06 02:45:49,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100241229] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:45:49,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966349254] [2025-02-06 02:45:49,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:45:49,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:45:49,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:45:49,642 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:49,646 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:49,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-02-06 02:45:50,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-02-06 02:45:50,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:45:50,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:45:50,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 1340 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:45:50,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:45:50,121 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 12168 trivial. 0 not checked. [2025-02-06 02:45:50,121 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:45:50,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966349254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:45:50,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:45:50,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:45:50,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596036039] [2025-02-06 02:45:50,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:45:50,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:45:50,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:45:50,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:45:50,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:45:50,149 INFO L87 Difference]: Start difference. First operand has 328 states, 246 states have (on average 1.5121951219512195) internal successors, (372), 247 states have internal predecessors, (372), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) Second operand has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (79), 2 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 2 states have call successors, (79) [2025-02-06 02:45:50,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:45:50,212 INFO L93 Difference]: Finished difference Result 650 states and 1134 transitions. [2025-02-06 02:45:50,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:45:50,214 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (79), 2 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 2 states have call successors, (79) Word has length 542 [2025-02-06 02:45:50,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:45:50,221 INFO L225 Difference]: With dead ends: 650 [2025-02-06 02:45:50,222 INFO L226 Difference]: Without dead ends: 325 [2025-02-06 02:45:50,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 543 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:50,228 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:45:50,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 501 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:45:50,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-02-06 02:45:50,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2025-02-06 02:45:50,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 244 states have (on average 1.4795081967213115) internal successors, (361), 244 states have internal predecessors, (361), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-02-06 02:45:50,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 519 transitions. [2025-02-06 02:45:50,304 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 519 transitions. Word has length 542 [2025-02-06 02:45:50,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:45:50,306 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 519 transitions. [2025-02-06 02:45:50,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (79), 2 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 2 states have call successors, (79) [2025-02-06 02:45:50,307 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 519 transitions. [2025-02-06 02:45:50,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-02-06 02:45:50,318 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:45:50,318 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,329 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:50,519 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:50,520 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:45:50,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:45:50,521 INFO L85 PathProgramCache]: Analyzing trace with hash -934078631, now seen corresponding path program 1 times [2025-02-06 02:45:50,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:45:50,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055541559] [2025-02-06 02:45:50,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:45:50,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:45:50,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-02-06 02:45:50,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-02-06 02:45:50,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:45:50,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:45:51,405 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:45:51,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:45:51,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055541559] [2025-02-06 02:45:51,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055541559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:45:51,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:45:51,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:45:51,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100059859] [2025-02-06 02:45:51,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:45:51,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:45:51,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:45:51,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:45:51,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:45:51,413 INFO L87 Difference]: Start difference. First operand 325 states and 519 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-02-06 02:45:51,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:45:51,726 INFO L93 Difference]: Finished difference Result 647 states and 1035 transitions. [2025-02-06 02:45:51,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:45:51,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) Word has length 543 [2025-02-06 02:45:51,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:45:51,734 INFO L225 Difference]: With dead ends: 647 [2025-02-06 02:45:51,734 INFO L226 Difference]: Without dead ends: 325 [2025-02-06 02:45:51,735 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:45:51,735 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 484 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:45:51,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 809 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:45:51,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-02-06 02:45:51,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2025-02-06 02:45:51,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 244 states have (on average 1.4754098360655739) internal successors, (360), 244 states have internal predecessors, (360), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-02-06 02:45:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 518 transitions. [2025-02-06 02:45:51,782 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 518 transitions. Word has length 543 [2025-02-06 02:45:51,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:45:51,786 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 518 transitions. [2025-02-06 02:45:51,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-02-06 02:45:51,786 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 518 transitions. [2025-02-06 02:45:51,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-02-06 02:45:51,794 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:45:51,795 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:45:51,795 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:45:51,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:45:51,796 INFO L85 PathProgramCache]: Analyzing trace with hash 174736568, now seen corresponding path program 1 times [2025-02-06 02:45:51,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:45:51,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227607193] [2025-02-06 02:45:51,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:45:51,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:45:51,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-02-06 02:45:51,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-02-06 02:45:51,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:45:51,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:45:52,273 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:45:52,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:45:52,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227607193] [2025-02-06 02:45:52,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227607193] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:45:52,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:45:52,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:45:52,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647819658] [2025-02-06 02:45:52,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:45:52,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:45:52,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:45:52,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:45:52,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:45:52,277 INFO L87 Difference]: Start difference. First operand 325 states and 518 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:45:52,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:45:52,426 INFO L93 Difference]: Finished difference Result 962 states and 1538 transitions. [2025-02-06 02:45:52,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:45:52,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 543 [2025-02-06 02:45:52,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:45:52,433 INFO L225 Difference]: With dead ends: 962 [2025-02-06 02:45:52,434 INFO L226 Difference]: Without dead ends: 640 [2025-02-06 02:45:52,435 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:52,436 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 500 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:45:52,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 1182 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:45:52,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-02-06 02:45:52,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 466. [2025-02-06 02:45:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 385 states have (on average 1.5298701298701298) internal successors, (589), 385 states have internal predecessors, (589), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-02-06 02:45:52,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 747 transitions. [2025-02-06 02:45:52,484 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 747 transitions. Word has length 543 [2025-02-06 02:45:52,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:45:52,485 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 747 transitions. [2025-02-06 02:45:52,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:45:52,487 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 747 transitions. [2025-02-06 02:45:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-02-06 02:45:52,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:45:52,495 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:45:52,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:45:52,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:45:52,497 INFO L85 PathProgramCache]: Analyzing trace with hash -396514665, now seen corresponding path program 1 times [2025-02-06 02:45:52,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:45:52,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657861698] [2025-02-06 02:45:52,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:45:52,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:45:52,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-02-06 02:45:52,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-02-06 02:45:52,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:45:52,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:45:53,227 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:45:53,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:45:53,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657861698] [2025-02-06 02:45:53,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657861698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:45:53,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:45:53,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:45:53,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950472287] [2025-02-06 02:45:53,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:45:53,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:45:53,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:45:53,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:45:53,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:45:53,232 INFO L87 Difference]: Start difference. First operand 466 states and 747 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:45:53,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:45:53,398 INFO L93 Difference]: Finished difference Result 941 states and 1511 transitions. [2025-02-06 02:45:53,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:45:53,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 543 [2025-02-06 02:45:53,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:45:53,405 INFO L225 Difference]: With dead ends: 941 [2025-02-06 02:45:53,405 INFO L226 Difference]: Without dead ends: 478 [2025-02-06 02:45:53,406 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:45:53,407 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 5 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:45:53,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1442 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:45:53,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-02-06 02:45:53,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 472. [2025-02-06 02:45:53,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 391 states have (on average 1.526854219948849) internal successors, (597), 391 states have internal predecessors, (597), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-02-06 02:45:53,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 755 transitions. [2025-02-06 02:45:53,439 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 755 transitions. Word has length 543 [2025-02-06 02:45:53,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:45:53,440 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 755 transitions. [2025-02-06 02:45:53,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:45:53,440 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 755 transitions. [2025-02-06 02:45:53,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-02-06 02:45:53,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:45:53,447 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:45:53,448 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:45:53,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:45:53,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1350743560, now seen corresponding path program 1 times [2025-02-06 02:45:53,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:45:53,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918410228] [2025-02-06 02:45:53,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:45:53,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:45:53,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-02-06 02:45:53,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-02-06 02:45:53,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:45:53,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:45:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:45:54,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:45:54,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918410228] [2025-02-06 02:45:54,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918410228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:45:54,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:45:54,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:45:54,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067658117] [2025-02-06 02:45:54,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:45:54,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:45:54,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:45:54,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:45:54,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:45:54,265 INFO L87 Difference]: Start difference. First operand 472 states and 755 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-02-06 02:45:54,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:45:54,842 INFO L93 Difference]: Finished difference Result 1413 states and 2264 transitions. [2025-02-06 02:45:54,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:45:54,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) Word has length 543 [2025-02-06 02:45:54,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:45:54,849 INFO L225 Difference]: With dead ends: 1413 [2025-02-06 02:45:54,849 INFO L226 Difference]: Without dead ends: 944 [2025-02-06 02:45:54,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:45:54,852 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 749 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:45:54,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 1887 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:45:54,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-02-06 02:45:54,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 904. [2025-02-06 02:45:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 743 states have (on average 1.5275908479138627) internal successors, (1135), 743 states have internal predecessors, (1135), 158 states have call successors, (158), 2 states have call predecessors, (158), 2 states have return successors, (158), 158 states have call predecessors, (158), 158 states have call successors, (158) [2025-02-06 02:45:54,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1451 transitions. [2025-02-06 02:45:54,926 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1451 transitions. Word has length 543 [2025-02-06 02:45:54,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:45:54,927 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1451 transitions. [2025-02-06 02:45:54,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-02-06 02:45:54,928 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1451 transitions. [2025-02-06 02:45:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-02-06 02:45:54,933 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:45:54,933 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:45:54,933 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:45:54,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:45:54,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1441754232, now seen corresponding path program 1 times [2025-02-06 02:45:54,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:45:54,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333074246] [2025-02-06 02:45:54,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:45:54,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:45:54,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-02-06 02:45:55,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-02-06 02:45:55,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:45:55,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:45:56,198 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:45:56,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:45:56,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333074246] [2025-02-06 02:45:56,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333074246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:45:56,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:45:56,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:45:56,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026366740] [2025-02-06 02:45:56,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:45:56,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:45:56,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:45:56,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:45:56,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:45:56,201 INFO L87 Difference]: Start difference. First operand 904 states and 1451 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:45:56,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:45:56,892 INFO L93 Difference]: Finished difference Result 1703 states and 2722 transitions. [2025-02-06 02:45:56,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:45:56,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 545 [2025-02-06 02:45:56,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:45:56,900 INFO L225 Difference]: With dead ends: 1703 [2025-02-06 02:45:56,900 INFO L226 Difference]: Without dead ends: 944 [2025-02-06 02:45:56,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:56,904 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 390 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:45:56,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1801 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:45:56,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-02-06 02:45:56,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 904. [2025-02-06 02:45:56,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 743 states have (on average 1.5235531628532974) internal successors, (1132), 743 states have internal predecessors, (1132), 158 states have call successors, (158), 2 states have call predecessors, (158), 2 states have return successors, (158), 158 states have call predecessors, (158), 158 states have call successors, (158) [2025-02-06 02:45:56,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1448 transitions. [2025-02-06 02:45:56,963 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1448 transitions. Word has length 545 [2025-02-06 02:45:56,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:45:56,965 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1448 transitions. [2025-02-06 02:45:56,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:45:56,965 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1448 transitions. [2025-02-06 02:45:56,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2025-02-06 02:45:56,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:45:56,969 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:45:56,969 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:45:56,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:45:56,970 INFO L85 PathProgramCache]: Analyzing trace with hash 226668000, now seen corresponding path program 1 times [2025-02-06 02:45:56,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:45:56,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818222232] [2025-02-06 02:45:56,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:45:56,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:45:57,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes. [2025-02-06 02:45:57,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements. [2025-02-06 02:45:57,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:45:57,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:45:57,643 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:45:57,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:45:57,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818222232] [2025-02-06 02:45:57,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818222232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:45:57,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:45:57,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:45:57,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704641257] [2025-02-06 02:45:57,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:45:57,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:45:57,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:45:57,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:45:57,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:45:57,647 INFO L87 Difference]: Start difference. First operand 904 states and 1448 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-02-06 02:45:58,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:45:58,211 INFO L93 Difference]: Finished difference Result 1591 states and 2542 transitions. [2025-02-06 02:45:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:45:58,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) Word has length 547 [2025-02-06 02:45:58,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:45:58,217 INFO L225 Difference]: With dead ends: 1591 [2025-02-06 02:45:58,217 INFO L226 Difference]: Without dead ends: 944 [2025-02-06 02:45:58,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:45:58,220 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 734 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:45:58,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1727 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:45:58,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-02-06 02:45:58,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 902. [2025-02-06 02:45:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 741 states have (on average 1.5222672064777327) internal successors, (1128), 741 states have internal predecessors, (1128), 158 states have call successors, (158), 2 states have call predecessors, (158), 2 states have return successors, (158), 158 states have call predecessors, (158), 158 states have call successors, (158) [2025-02-06 02:45:58,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1444 transitions. [2025-02-06 02:45:58,279 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1444 transitions. Word has length 547 [2025-02-06 02:45:58,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:45:58,280 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1444 transitions. [2025-02-06 02:45:58,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-02-06 02:45:58,281 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1444 transitions. [2025-02-06 02:45:58,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2025-02-06 02:45:58,284 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:45:58,284 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:45:58,284 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:45:58,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:45:58,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2035311207, now seen corresponding path program 1 times [2025-02-06 02:45:58,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:45:58,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740362205] [2025-02-06 02:45:58,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:45:58,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:45:58,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes. [2025-02-06 02:45:58,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements. [2025-02-06 02:45:58,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:45:58,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:45:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:45:59,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:45:59,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740362205] [2025-02-06 02:45:59,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740362205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:45:59,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:45:59,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:45:59,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795823562] [2025-02-06 02:45:59,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:45:59,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:45:59,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:45:59,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:45:59,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:45:59,937 INFO L87 Difference]: Start difference. First operand 902 states and 1444 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-02-06 02:46:00,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:00,425 INFO L93 Difference]: Finished difference Result 1700 states and 2711 transitions. [2025-02-06 02:46:00,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:46:00,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) Word has length 547 [2025-02-06 02:46:00,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:00,431 INFO L225 Difference]: With dead ends: 1700 [2025-02-06 02:46:00,431 INFO L226 Difference]: Without dead ends: 942 [2025-02-06 02:46:00,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:46:00,433 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 406 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:00,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1916 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:46:00,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2025-02-06 02:46:00,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 902. [2025-02-06 02:46:00,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 741 states have (on average 1.5182186234817814) internal successors, (1125), 741 states have internal predecessors, (1125), 158 states have call successors, (158), 2 states have call predecessors, (158), 2 states have return successors, (158), 158 states have call predecessors, (158), 158 states have call successors, (158) [2025-02-06 02:46:00,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1441 transitions. [2025-02-06 02:46:00,493 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1441 transitions. Word has length 547 [2025-02-06 02:46:00,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:00,495 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1441 transitions. [2025-02-06 02:46:00,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-02-06 02:46:00,495 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1441 transitions. [2025-02-06 02:46:00,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-02-06 02:46:00,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:00,499 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:46:00,499 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:00,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:00,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1031185798, now seen corresponding path program 1 times [2025-02-06 02:46:00,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:00,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369794974] [2025-02-06 02:46:00,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:00,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:00,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-02-06 02:46:00,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-02-06 02:46:00,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:00,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:01,455 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:46:01,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:01,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369794974] [2025-02-06 02:46:01,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369794974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:01,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:01,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:46:01,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157786245] [2025-02-06 02:46:01,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:01,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:46:01,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:01,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:46:01,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:46:01,458 INFO L87 Difference]: Start difference. First operand 902 states and 1441 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:46:01,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:01,992 INFO L93 Difference]: Finished difference Result 1696 states and 2699 transitions. [2025-02-06 02:46:01,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:46:01,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 548 [2025-02-06 02:46:01,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:01,997 INFO L225 Difference]: With dead ends: 1696 [2025-02-06 02:46:01,998 INFO L226 Difference]: Without dead ends: 942 [2025-02-06 02:46:01,999 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:02,001 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 371 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:02,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1474 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:46:02,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2025-02-06 02:46:02,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 902. [2025-02-06 02:46:02,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 741 states have (on average 1.5168690958164643) internal successors, (1124), 741 states have internal predecessors, (1124), 158 states have call successors, (158), 2 states have call predecessors, (158), 2 states have return successors, (158), 158 states have call predecessors, (158), 158 states have call successors, (158) [2025-02-06 02:46:02,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1440 transitions. [2025-02-06 02:46:02,066 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1440 transitions. Word has length 548 [2025-02-06 02:46:02,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:02,067 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1440 transitions. [2025-02-06 02:46:02,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:46:02,067 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1440 transitions. [2025-02-06 02:46:02,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-02-06 02:46:02,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:02,071 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:46:02,071 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:02,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:02,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1016935653, now seen corresponding path program 1 times [2025-02-06 02:46:02,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:02,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395204467] [2025-02-06 02:46:02,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:02,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:02,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-02-06 02:46:02,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-02-06 02:46:02,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:02,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:02,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:46:02,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:02,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395204467] [2025-02-06 02:46:02,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395204467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:02,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:02,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:46:02,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852847398] [2025-02-06 02:46:02,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:02,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:46:02,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:02,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:46:02,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:46:02,664 INFO L87 Difference]: Start difference. First operand 902 states and 1440 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:46:02,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:02,798 INFO L93 Difference]: Finished difference Result 2124 states and 3397 transitions. [2025-02-06 02:46:02,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:46:02,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 548 [2025-02-06 02:46:02,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:02,805 INFO L225 Difference]: With dead ends: 2124 [2025-02-06 02:46:02,805 INFO L226 Difference]: Without dead ends: 1371 [2025-02-06 02:46:02,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:46:02,807 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 371 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:02,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 978 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:46:02,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2025-02-06 02:46:02,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1369. [2025-02-06 02:46:02,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1128 states have (on average 1.5062056737588652) internal successors, (1699), 1128 states have internal predecessors, (1699), 237 states have call successors, (237), 3 states have call predecessors, (237), 3 states have return successors, (237), 237 states have call predecessors, (237), 237 states have call successors, (237) [2025-02-06 02:46:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2173 transitions. [2025-02-06 02:46:02,872 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2173 transitions. Word has length 548 [2025-02-06 02:46:02,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:02,873 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 2173 transitions. [2025-02-06 02:46:02,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:46:02,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2173 transitions. [2025-02-06 02:46:02,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-02-06 02:46:02,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:02,876 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:46:02,876 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:02,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:02,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1204465095, now seen corresponding path program 1 times [2025-02-06 02:46:02,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:02,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097131670] [2025-02-06 02:46:02,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:02,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:02,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-02-06 02:46:03,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-02-06 02:46:03,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:03,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:03,906 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:46:03,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:03,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097131670] [2025-02-06 02:46:03,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097131670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:03,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:03,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 02:46:03,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145627891] [2025-02-06 02:46:03,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:03,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:46:03,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:03,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:46:03,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:46:03,908 INFO L87 Difference]: Start difference. First operand 1369 states and 2173 transitions. Second operand has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 states have internal predecessors, (156), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-02-06 02:46:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:05,216 INFO L93 Difference]: Finished difference Result 2839 states and 4485 transitions. [2025-02-06 02:46:05,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:46:05,217 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 states have internal predecessors, (156), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) Word has length 548 [2025-02-06 02:46:05,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:05,227 INFO L225 Difference]: With dead ends: 2839 [2025-02-06 02:46:05,228 INFO L226 Difference]: Without dead ends: 1707 [2025-02-06 02:46:05,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:46:05,232 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 1765 mSDsluCounter, 2330 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1765 SdHoareTripleChecker+Valid, 3062 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:05,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1765 Valid, 3062 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 02:46:05,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2025-02-06 02:46:05,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1388. [2025-02-06 02:46:05,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1147 states have (on average 1.5047951176983434) internal successors, (1726), 1147 states have internal predecessors, (1726), 237 states have call successors, (237), 3 states have call predecessors, (237), 3 states have return successors, (237), 237 states have call predecessors, (237), 237 states have call successors, (237) [2025-02-06 02:46:05,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 2200 transitions. [2025-02-06 02:46:05,351 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 2200 transitions. Word has length 548 [2025-02-06 02:46:05,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:05,352 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 2200 transitions. [2025-02-06 02:46:05,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 states have internal predecessors, (156), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-02-06 02:46:05,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 2200 transitions. [2025-02-06 02:46:05,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-02-06 02:46:05,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:05,355 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:46:05,356 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:05,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:05,356 INFO L85 PathProgramCache]: Analyzing trace with hash -731195192, now seen corresponding path program 1 times [2025-02-06 02:46:05,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:05,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233665108] [2025-02-06 02:46:05,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:05,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:05,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-02-06 02:46:05,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-02-06 02:46:05,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:05,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:06,814 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:46:06,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:06,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233665108] [2025-02-06 02:46:06,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233665108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:06,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:06,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:46:06,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841086609] [2025-02-06 02:46:06,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:06,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:46:06,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:06,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:46:06,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:46:06,817 INFO L87 Difference]: Start difference. First operand 1388 states and 2200 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:46:07,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:07,945 INFO L93 Difference]: Finished difference Result 5488 states and 8663 transitions. [2025-02-06 02:46:07,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:46:07,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 548 [2025-02-06 02:46:07,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:07,965 INFO L225 Difference]: With dead ends: 5488 [2025-02-06 02:46:07,966 INFO L226 Difference]: Without dead ends: 4256 [2025-02-06 02:46:07,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:46:07,972 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 1734 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1734 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:07,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1734 Valid, 2374 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 02:46:07,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4256 states. [2025-02-06 02:46:08,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4256 to 2778. [2025-02-06 02:46:08,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2778 states, 2426 states have (on average 1.5206100577081616) internal successors, (3689), 2428 states have internal predecessors, (3689), 345 states have call successors, (345), 6 states have call predecessors, (345), 6 states have return successors, (345), 343 states have call predecessors, (345), 345 states have call successors, (345) [2025-02-06 02:46:08,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2778 states to 2778 states and 4379 transitions. [2025-02-06 02:46:08,142 INFO L78 Accepts]: Start accepts. Automaton has 2778 states and 4379 transitions. Word has length 548 [2025-02-06 02:46:08,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:08,142 INFO L471 AbstractCegarLoop]: Abstraction has 2778 states and 4379 transitions. [2025-02-06 02:46:08,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:46:08,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2778 states and 4379 transitions. [2025-02-06 02:46:08,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-02-06 02:46:08,147 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:08,147 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:46:08,147 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:08,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:08,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1914542489, now seen corresponding path program 1 times [2025-02-06 02:46:08,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:08,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948706300] [2025-02-06 02:46:08,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:08,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:08,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-02-06 02:46:08,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-02-06 02:46:08,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:08,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:08,841 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:46:08,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:08,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948706300] [2025-02-06 02:46:08,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948706300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:08,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:08,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:46:08,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775028918] [2025-02-06 02:46:08,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:08,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:46:08,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:08,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:46:08,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:46:08,847 INFO L87 Difference]: Start difference. First operand 2778 states and 4379 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:46:09,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:09,202 INFO L93 Difference]: Finished difference Result 8868 states and 13944 transitions. [2025-02-06 02:46:09,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:46:09,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 548 [2025-02-06 02:46:09,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:09,228 INFO L225 Difference]: With dead ends: 8868 [2025-02-06 02:46:09,228 INFO L226 Difference]: Without dead ends: 6259 [2025-02-06 02:46:09,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:46:09,237 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 708 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:09,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 1546 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:46:09,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6259 states. [2025-02-06 02:46:09,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6259 to 5105. [2025-02-06 02:46:09,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5105 states, 4633 states have (on average 1.5236347938700625) internal successors, (7059), 4639 states have internal predecessors, (7059), 461 states have call successors, (461), 10 states have call predecessors, (461), 10 states have return successors, (461), 455 states have call predecessors, (461), 461 states have call successors, (461) [2025-02-06 02:46:09,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5105 states to 5105 states and 7981 transitions. [2025-02-06 02:46:09,429 INFO L78 Accepts]: Start accepts. Automaton has 5105 states and 7981 transitions. Word has length 548 [2025-02-06 02:46:09,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:09,429 INFO L471 AbstractCegarLoop]: Abstraction has 5105 states and 7981 transitions. [2025-02-06 02:46:09,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:46:09,429 INFO L276 IsEmpty]: Start isEmpty. Operand 5105 states and 7981 transitions. [2025-02-06 02:46:09,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-02-06 02:46:09,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:09,434 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:46:09,435 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:09,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:09,435 INFO L85 PathProgramCache]: Analyzing trace with hash -60196952, now seen corresponding path program 1 times [2025-02-06 02:46:09,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:09,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267414921] [2025-02-06 02:46:09,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:09,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:09,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-02-06 02:46:09,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-02-06 02:46:09,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:09,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:09,613 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:46:09,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:09,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267414921] [2025-02-06 02:46:09,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267414921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:09,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:09,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:46:09,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163675956] [2025-02-06 02:46:09,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:09,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:46:09,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:09,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:46:09,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:46:09,616 INFO L87 Difference]: Start difference. First operand 5105 states and 7981 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:46:10,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:10,017 INFO L93 Difference]: Finished difference Result 8280 states and 12932 transitions. [2025-02-06 02:46:10,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:46:10,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 548 [2025-02-06 02:46:10,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:10,032 INFO L225 Difference]: With dead ends: 8280 [2025-02-06 02:46:10,032 INFO L226 Difference]: Without dead ends: 4027 [2025-02-06 02:46:10,039 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:46:10,039 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 369 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:10,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 998 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:46:10,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4027 states. [2025-02-06 02:46:10,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4027 to 3539. [2025-02-06 02:46:10,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3539 states, 3182 states have (on average 1.5119421747328725) internal successors, (4811), 3184 states have internal predecessors, (4811), 345 states have call successors, (345), 11 states have call predecessors, (345), 11 states have return successors, (345), 343 states have call predecessors, (345), 345 states have call successors, (345) [2025-02-06 02:46:10,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3539 states to 3539 states and 5501 transitions. [2025-02-06 02:46:10,192 INFO L78 Accepts]: Start accepts. Automaton has 3539 states and 5501 transitions. Word has length 548 [2025-02-06 02:46:10,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:10,193 INFO L471 AbstractCegarLoop]: Abstraction has 3539 states and 5501 transitions. [2025-02-06 02:46:10,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:46:10,194 INFO L276 IsEmpty]: Start isEmpty. Operand 3539 states and 5501 transitions. [2025-02-06 02:46:10,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-02-06 02:46:10,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:10,198 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 02:46:10,198 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:10,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:10,199 INFO L85 PathProgramCache]: Analyzing trace with hash -631448185, now seen corresponding path program 1 times [2025-02-06 02:46:10,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:10,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766962152] [2025-02-06 02:46:10,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:10,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:10,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-02-06 02:46:10,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-02-06 02:46:10,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:10,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:46:17,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:17,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766962152] [2025-02-06 02:46:17,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766962152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:17,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:17,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 02:46:17,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446180284] [2025-02-06 02:46:17,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:17,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 02:46:17,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:17,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 02:46:17,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-06 02:46:17,310 INFO L87 Difference]: Start difference. First operand 3539 states and 5501 transitions. Second operand has 14 states, 14 states have (on average 11.142857142857142) internal successors, (156), 14 states have internal predecessors, (156), 3 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2025-02-06 02:46:19,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:19,694 INFO L93 Difference]: Finished difference Result 10717 states and 16526 transitions. [2025-02-06 02:46:19,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 02:46:19,695 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.142857142857142) internal successors, (156), 14 states have internal predecessors, (156), 3 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) Word has length 548 [2025-02-06 02:46:19,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:19,710 INFO L225 Difference]: With dead ends: 10717 [2025-02-06 02:46:19,710 INFO L226 Difference]: Without dead ends: 7565 [2025-02-06 02:46:19,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2025-02-06 02:46:19,717 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 4923 mSDsluCounter, 3674 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4923 SdHoareTripleChecker+Valid, 4167 SdHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 1650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:19,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4923 Valid, 4167 Invalid, 1987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 1650 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 02:46:19,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7565 states. [2025-02-06 02:46:19,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7565 to 5223. [2025-02-06 02:46:19,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5223 states, 4865 states have (on average 1.5223021582733813) internal successors, (7406), 4867 states have internal predecessors, (7406), 345 states have call successors, (345), 12 states have call predecessors, (345), 12 states have return successors, (345), 343 states have call predecessors, (345), 345 states have call successors, (345) [2025-02-06 02:46:19,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5223 states to 5223 states and 8096 transitions. [2025-02-06 02:46:19,890 INFO L78 Accepts]: Start accepts. Automaton has 5223 states and 8096 transitions. Word has length 548 [2025-02-06 02:46:19,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:19,891 INFO L471 AbstractCegarLoop]: Abstraction has 5223 states and 8096 transitions. [2025-02-06 02:46:19,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.142857142857142) internal successors, (156), 14 states have internal predecessors, (156), 3 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2025-02-06 02:46:19,891 INFO L276 IsEmpty]: Start isEmpty. Operand 5223 states and 8096 transitions. [2025-02-06 02:46:19,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-02-06 02:46:19,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:19,896 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 02:46:19,897 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:19,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:19,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1855671590, now seen corresponding path program 1 times [2025-02-06 02:46:19,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:19,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730790916] [2025-02-06 02:46:19,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:19,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:19,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-02-06 02:46:21,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-02-06 02:46:21,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:21,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:21,811 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 51 proven. 183 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-02-06 02:46:21,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:21,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730790916] [2025-02-06 02:46:21,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730790916] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:46:21,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361099700] [2025-02-06 02:46:21,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:21,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:46:21,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:46:21,814 INFO L229 MonitoredProcess]: Starting monitored process 3 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:46:21,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 02:46:22,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-02-06 02:46:22,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-02-06 02:46:22,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:22,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:22,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 02:46:22,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:46:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 2711 proven. 48 refuted. 0 times theorem prover too weak. 9565 trivial. 0 not checked. [2025-02-06 02:46:23,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:46:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 414 proven. 51 refuted. 0 times theorem prover too weak. 11859 trivial. 0 not checked. [2025-02-06 02:46:24,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361099700] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:46:24,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:46:24,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 11] total 25 [2025-02-06 02:46:24,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059083188] [2025-02-06 02:46:24,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:46:24,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 02:46:24,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:24,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 02:46:24,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2025-02-06 02:46:24,240 INFO L87 Difference]: Start difference. First operand 5223 states and 8096 transitions. Second operand has 25 states, 24 states have (on average 15.708333333333334) internal successors, (377), 23 states have internal predecessors, (377), 8 states have call successors, (237), 4 states have call predecessors, (237), 8 states have return successors, (237), 8 states have call predecessors, (237), 8 states have call successors, (237) [2025-02-06 02:46:33,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:33,277 INFO L93 Difference]: Finished difference Result 26562 states and 41320 transitions. [2025-02-06 02:46:33,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2025-02-06 02:46:33,277 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 15.708333333333334) internal successors, (377), 23 states have internal predecessors, (377), 8 states have call successors, (237), 4 states have call predecessors, (237), 8 states have return successors, (237), 8 states have call predecessors, (237), 8 states have call successors, (237) Word has length 548 [2025-02-06 02:46:33,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:33,366 INFO L225 Difference]: With dead ends: 26562 [2025-02-06 02:46:33,370 INFO L226 Difference]: Without dead ends: 21528 [2025-02-06 02:46:33,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1226 GetRequests, 1096 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7280 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3211, Invalid=14081, Unknown=0, NotChecked=0, Total=17292 [2025-02-06 02:46:33,395 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 10871 mSDsluCounter, 9524 mSDsCounter, 0 mSdLazyCounter, 4936 mSolverCounterSat, 4014 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10877 SdHoareTripleChecker+Valid, 10216 SdHoareTripleChecker+Invalid, 8950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4014 IncrementalHoareTripleChecker+Valid, 4936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:33,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10877 Valid, 10216 Invalid, 8950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4014 Valid, 4936 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-02-06 02:46:33,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21528 states. [2025-02-06 02:46:33,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21528 to 13255. [2025-02-06 02:46:33,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13255 states, 12279 states have (on average 1.5203192442381301) internal successors, (18668), 12285 states have internal predecessors, (18668), 927 states have call successors, (927), 48 states have call predecessors, (927), 48 states have return successors, (927), 921 states have call predecessors, (927), 927 states have call successors, (927) [2025-02-06 02:46:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13255 states to 13255 states and 20522 transitions. [2025-02-06 02:46:34,022 INFO L78 Accepts]: Start accepts. Automaton has 13255 states and 20522 transitions. Word has length 548 [2025-02-06 02:46:34,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:34,023 INFO L471 AbstractCegarLoop]: Abstraction has 13255 states and 20522 transitions. [2025-02-06 02:46:34,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 15.708333333333334) internal successors, (377), 23 states have internal predecessors, (377), 8 states have call successors, (237), 4 states have call predecessors, (237), 8 states have return successors, (237), 8 states have call predecessors, (237), 8 states have call successors, (237) [2025-02-06 02:46:34,023 INFO L276 IsEmpty]: Start isEmpty. Operand 13255 states and 20522 transitions. [2025-02-06 02:46:34,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-02-06 02:46:34,035 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:34,035 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 02:46:34,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 02:46:34,240 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:34,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:34,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1012180631, now seen corresponding path program 1 times [2025-02-06 02:46:34,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:34,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685500802] [2025-02-06 02:46:34,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:34,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:34,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-02-06 02:46:34,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-02-06 02:46:34,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:34,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:34,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:46:34,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:34,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685500802] [2025-02-06 02:46:34,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685500802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:34,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:34,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 02:46:34,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321522323] [2025-02-06 02:46:34,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:34,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:46:34,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:34,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:46:34,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:46:34,939 INFO L87 Difference]: Start difference. First operand 13255 states and 20522 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:46:36,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:36,049 INFO L93 Difference]: Finished difference Result 26707 states and 41281 transitions. [2025-02-06 02:46:36,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:46:36,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 548 [2025-02-06 02:46:36,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:36,082 INFO L225 Difference]: With dead ends: 26707 [2025-02-06 02:46:36,082 INFO L226 Difference]: Without dead ends: 15155 [2025-02-06 02:46:36,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:46:36,093 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 1478 mSDsluCounter, 2066 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:36,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 2710 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 02:46:36,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15155 states. [2025-02-06 02:46:36,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15155 to 13381. [2025-02-06 02:46:36,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13381 states, 12405 states have (on average 1.5106005642885934) internal successors, (18739), 12411 states have internal predecessors, (18739), 927 states have call successors, (927), 48 states have call predecessors, (927), 48 states have return successors, (927), 921 states have call predecessors, (927), 927 states have call successors, (927) [2025-02-06 02:46:36,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13381 states to 13381 states and 20593 transitions. [2025-02-06 02:46:36,670 INFO L78 Accepts]: Start accepts. Automaton has 13381 states and 20593 transitions. Word has length 548 [2025-02-06 02:46:36,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:36,671 INFO L471 AbstractCegarLoop]: Abstraction has 13381 states and 20593 transitions. [2025-02-06 02:46:36,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:46:36,671 INFO L276 IsEmpty]: Start isEmpty. Operand 13381 states and 20593 transitions. [2025-02-06 02:46:36,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-02-06 02:46:36,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:36,683 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 02:46:36,683 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:36,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:36,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1460877270, now seen corresponding path program 1 times [2025-02-06 02:46:36,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:36,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204493381] [2025-02-06 02:46:36,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:36,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:36,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-02-06 02:46:37,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-02-06 02:46:37,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:37,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:37,634 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 162 proven. 72 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-02-06 02:46:37,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:37,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204493381] [2025-02-06 02:46:37,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204493381] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:46:37,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237217902] [2025-02-06 02:46:37,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:37,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:46:37,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:46:37,637 INFO L229 MonitoredProcess]: Starting monitored process 4 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:46:37,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 02:46:37,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-02-06 02:46:37,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-02-06 02:46:37,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:37,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:37,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:46:37,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:46:38,178 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 5370 proven. 72 refuted. 0 times theorem prover too weak. 6882 trivial. 0 not checked. [2025-02-06 02:46:38,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:46:38,439 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 162 proven. 72 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-02-06 02:46:38,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237217902] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:46:38,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:46:38,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-06 02:46:38,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875509113] [2025-02-06 02:46:38,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:46:38,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:46:38,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:38,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:46:38,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:46:38,444 INFO L87 Difference]: Start difference. First operand 13381 states and 20593 transitions. Second operand has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 2 states have call successors, (103), 2 states have call predecessors, (103), 4 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) [2025-02-06 02:46:38,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:38,968 INFO L93 Difference]: Finished difference Result 17977 states and 27663 transitions. [2025-02-06 02:46:38,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:46:38,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 2 states have call successors, (103), 2 states have call predecessors, (103), 4 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) Word has length 548 [2025-02-06 02:46:38,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:38,984 INFO L225 Difference]: With dead ends: 17977 [2025-02-06 02:46:38,984 INFO L226 Difference]: Without dead ends: 6922 [2025-02-06 02:46:38,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1102 GetRequests, 1093 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:46:38,995 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 697 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:38,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1054 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:46:38,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6922 states. [2025-02-06 02:46:39,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6922 to 6870. [2025-02-06 02:46:39,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6870 states, 6276 states have (on average 1.5007966857871256) internal successors, (9419), 6276 states have internal predecessors, (9419), 553 states have call successors, (553), 40 states have call predecessors, (553), 40 states have return successors, (553), 553 states have call predecessors, (553), 553 states have call successors, (553) [2025-02-06 02:46:39,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6870 states to 6870 states and 10525 transitions. [2025-02-06 02:46:39,278 INFO L78 Accepts]: Start accepts. Automaton has 6870 states and 10525 transitions. Word has length 548 [2025-02-06 02:46:39,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:39,278 INFO L471 AbstractCegarLoop]: Abstraction has 6870 states and 10525 transitions. [2025-02-06 02:46:39,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 2 states have call successors, (103), 2 states have call predecessors, (103), 4 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) [2025-02-06 02:46:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 6870 states and 10525 transitions. [2025-02-06 02:46:39,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2025-02-06 02:46:39,283 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:39,283 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 02:46:39,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:46:39,484 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:39,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:39,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1655867967, now seen corresponding path program 1 times [2025-02-06 02:46:39,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:39,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127021878] [2025-02-06 02:46:39,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:39,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:39,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 552 statements into 1 equivalence classes. [2025-02-06 02:46:40,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 552 of 552 statements. [2025-02-06 02:46:40,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:40,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:41,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 75 proven. 159 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-02-06 02:46:41,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:41,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127021878] [2025-02-06 02:46:41,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127021878] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:46:41,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158095098] [2025-02-06 02:46:41,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:41,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:46:41,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:46:41,995 INFO L229 MonitoredProcess]: Starting monitored process 5 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:46:42,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 02:46:42,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 552 statements into 1 equivalence classes. [2025-02-06 02:46:42,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 552 of 552 statements. [2025-02-06 02:46:42,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:42,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:42,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 1362 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 02:46:42,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:46:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 6685 proven. 564 refuted. 0 times theorem prover too weak. 5075 trivial. 0 not checked. [2025-02-06 02:46:44,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:46:45,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158095098] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:46:45,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 02:46:45,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18] total 24 [2025-02-06 02:46:45,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606532178] [2025-02-06 02:46:45,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 02:46:45,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 02:46:45,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:45,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 02:46:45,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=674, Unknown=0, NotChecked=0, Total=812 [2025-02-06 02:46:45,782 INFO L87 Difference]: Start difference. First operand 6870 states and 10525 transitions. Second operand has 24 states, 24 states have (on average 12.0) internal successors, (288), 23 states have internal predecessors, (288), 7 states have call successors, (132), 5 states have call predecessors, (132), 7 states have return successors, (132), 7 states have call predecessors, (132), 7 states have call successors, (132) [2025-02-06 02:46:52,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:52,476 INFO L93 Difference]: Finished difference Result 29207 states and 44723 transitions. [2025-02-06 02:46:52,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2025-02-06 02:46:52,477 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 12.0) internal successors, (288), 23 states have internal predecessors, (288), 7 states have call successors, (132), 5 states have call predecessors, (132), 7 states have return successors, (132), 7 states have call predecessors, (132), 7 states have call successors, (132) Word has length 552 [2025-02-06 02:46:52,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:52,526 INFO L225 Difference]: With dead ends: 29207 [2025-02-06 02:46:52,526 INFO L226 Difference]: Without dead ends: 22838 [2025-02-06 02:46:52,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2063, Invalid=7837, Unknown=0, NotChecked=0, Total=9900 [2025-02-06 02:46:52,541 INFO L435 NwaCegarLoop]: 765 mSDtfsCounter, 4773 mSDsluCounter, 6900 mSDsCounter, 0 mSdLazyCounter, 5346 mSolverCounterSat, 1225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4799 SdHoareTripleChecker+Valid, 7665 SdHoareTripleChecker+Invalid, 6571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1225 IncrementalHoareTripleChecker+Valid, 5346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:52,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4799 Valid, 7665 Invalid, 6571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1225 Valid, 5346 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-02-06 02:46:52,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22838 states. [2025-02-06 02:46:53,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22838 to 19389. [2025-02-06 02:46:53,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19389 states, 17848 states have (on average 1.4975347377857462) internal successors, (26728), 17852 states have internal predecessors, (26728), 1343 states have call successors, (1343), 197 states have call predecessors, (1343), 197 states have return successors, (1343), 1339 states have call predecessors, (1343), 1343 states have call successors, (1343) [2025-02-06 02:46:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19389 states to 19389 states and 29414 transitions. [2025-02-06 02:46:53,338 INFO L78 Accepts]: Start accepts. Automaton has 19389 states and 29414 transitions. Word has length 552 [2025-02-06 02:46:53,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:53,338 INFO L471 AbstractCegarLoop]: Abstraction has 19389 states and 29414 transitions. [2025-02-06 02:46:53,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 12.0) internal successors, (288), 23 states have internal predecessors, (288), 7 states have call successors, (132), 5 states have call predecessors, (132), 7 states have return successors, (132), 7 states have call predecessors, (132), 7 states have call successors, (132) [2025-02-06 02:46:53,339 INFO L276 IsEmpty]: Start isEmpty. Operand 19389 states and 29414 transitions. [2025-02-06 02:46:53,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2025-02-06 02:46:53,343 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:53,343 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 02:46:53,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:46:53,546 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:53,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:53,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1910604512, now seen corresponding path program 1 times [2025-02-06 02:46:53,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:53,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772690798] [2025-02-06 02:46:53,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:53,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:53,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 552 statements into 1 equivalence classes. [2025-02-06 02:46:53,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 552 of 552 statements. [2025-02-06 02:46:53,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:53,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:54,071 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:46:54,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:54,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772690798] [2025-02-06 02:46:54,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772690798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:54,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:54,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:46:54,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548257003] [2025-02-06 02:46:54,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:54,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:46:54,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:54,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:46:54,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:46:54,074 INFO L87 Difference]: Start difference. First operand 19389 states and 29414 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:46:55,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:55,533 INFO L93 Difference]: Finished difference Result 53041 states and 80764 transitions. [2025-02-06 02:46:55,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:46:55,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 552 [2025-02-06 02:46:55,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:55,591 INFO L225 Difference]: With dead ends: 53041 [2025-02-06 02:46:55,592 INFO L226 Difference]: Without dead ends: 35667 [2025-02-06 02:46:55,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:46:55,609 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 296 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:55,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1452 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:46:55,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35667 states. [2025-02-06 02:46:57,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35667 to 35665. [2025-02-06 02:46:57,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35665 states, 32863 states have (on average 1.4997717798131638) internal successors, (49287), 32871 states have internal predecessors, (49287), 2449 states have call successors, (2449), 352 states have call predecessors, (2449), 352 states have return successors, (2449), 2441 states have call predecessors, (2449), 2449 states have call successors, (2449) [2025-02-06 02:46:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35665 states to 35665 states and 54185 transitions. [2025-02-06 02:46:57,428 INFO L78 Accepts]: Start accepts. Automaton has 35665 states and 54185 transitions. Word has length 552 [2025-02-06 02:46:57,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:57,428 INFO L471 AbstractCegarLoop]: Abstraction has 35665 states and 54185 transitions. [2025-02-06 02:46:57,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:46:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 35665 states and 54185 transitions. [2025-02-06 02:46:57,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-02-06 02:46:57,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:57,435 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 02:46:57,435 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:57,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:57,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1240168282, now seen corresponding path program 1 times [2025-02-06 02:46:57,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:57,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792416720] [2025-02-06 02:46:57,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:57,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:57,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-02-06 02:46:57,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-02-06 02:46:57,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:57,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 93 proven. 141 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-02-06 02:46:58,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:58,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792416720] [2025-02-06 02:46:58,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792416720] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:46:58,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088072002] [2025-02-06 02:46:58,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:58,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:46:58,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:46:58,735 INFO L229 MonitoredProcess]: Starting monitored process 6 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:46:58,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 02:46:58,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-02-06 02:46:59,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-02-06 02:46:59,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:59,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:59,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 1363 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 02:46:59,132 INFO L279 TraceCheckSpWp]: Computing forward predicates...