./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-64.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-64.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 e3b150a17e2463cebe76496dbc2347bb2e3ca7c0b4d818609f62a20afc82666e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:42:36,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:42:37,040 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:42:37,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:42:37,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:42:37,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:42:37,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:42:37,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:42:37,067 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:42:37,067 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:42:37,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:42:37,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:42:37,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:42:37,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:42:37,068 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:42:37,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:42:37,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:42:37,068 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:42:37,068 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:42:37,068 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:42:37,068 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:42:37,068 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:42:37,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:42:37,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:42:37,068 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:42:37,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:42:37,068 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:42:37,068 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:42:37,068 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:42:37,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:42:37,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:42:37,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:42:37,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:42:37,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:42:37,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:42:37,071 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:42:37,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:42:37,071 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:42:37,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:42:37,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:42:37,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:42:37,071 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:42:37,071 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:42:37,071 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 -> e3b150a17e2463cebe76496dbc2347bb2e3ca7c0b4d818609f62a20afc82666e [2025-02-06 02:42:37,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:42:37,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:42:37,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:42:37,360 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:42:37,365 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:42:37,366 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-64.i [2025-02-06 02:42:38,722 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09f4c9c60/d4fe280a23e2436b858e278338ed8947/FLAGbfc9d7a89 [2025-02-06 02:42:38,993 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:42:38,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-64.i [2025-02-06 02:42:39,005 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09f4c9c60/d4fe280a23e2436b858e278338ed8947/FLAGbfc9d7a89 [2025-02-06 02:42:39,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09f4c9c60/d4fe280a23e2436b858e278338ed8947 [2025-02-06 02:42:39,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:42:39,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:42:39,025 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:42:39,025 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:42:39,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:42:39,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:42:39" (1/1) ... [2025-02-06 02:42:39,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30780e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:39, skipping insertion in model container [2025-02-06 02:42:39,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:42:39" (1/1) ... [2025-02-06 02:42:39,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:42:39,220 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-64.i[916,929] [2025-02-06 02:42:39,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:42:39,451 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:42:39,463 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-64.i[916,929] [2025-02-06 02:42:39,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:42:39,585 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:42:39,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:39 WrapperNode [2025-02-06 02:42:39,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:42:39,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:42:39,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:42:39,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:42:39,591 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:42:39" (1/1) ... [2025-02-06 02:42:39,607 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:42:39" (1/1) ... [2025-02-06 02:42:39,721 INFO L138 Inliner]: procedures = 26, calls = 78, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 701 [2025-02-06 02:42:39,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:42:39,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:42:39,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:42:39,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:42:39,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:39" (1/1) ... [2025-02-06 02:42:39,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:39" (1/1) ... [2025-02-06 02:42:39,766 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:39" (1/1) ... [2025-02-06 02:42:39,851 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:42:39,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:39" (1/1) ... [2025-02-06 02:42:39,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:39" (1/1) ... [2025-02-06 02:42:39,893 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:39" (1/1) ... [2025-02-06 02:42:39,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:39" (1/1) ... [2025-02-06 02:42:39,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:39" (1/1) ... [2025-02-06 02:42:39,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:39" (1/1) ... [2025-02-06 02:42:39,949 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:42:39,950 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:42:39,951 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:42:39,951 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:42:39,952 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:39" (1/1) ... [2025-02-06 02:42:39,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:42:39,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:42:39,980 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:42:39,985 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:42:40,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:42:40,002 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:42:40,002 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:42:40,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:42:40,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:42:40,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:42:40,109 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:42:40,111 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:42:40,986 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L621: havoc property_#t~bitwise48#1;havoc property_#t~bitwise49#1;havoc property_#t~ite51#1;havoc property_#t~bitwise50#1;havoc property_#t~short52#1;havoc property_#t~bitwise53#1;havoc property_#t~ite56#1;havoc property_#t~ite55#1;havoc property_#t~bitwise54#1;havoc property_#t~short57#1;havoc property_#t~bitwise58#1;havoc property_#t~short59#1;havoc property_#t~bitwise60#1;havoc property_#t~short61#1; [2025-02-06 02:42:41,093 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2025-02-06 02:42:41,093 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:42:41,109 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:42:41,110 INFO L337 CfgBuilder]: Removed 8 assume(true) statements. [2025-02-06 02:42:41,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:42:41 BoogieIcfgContainer [2025-02-06 02:42:41,110 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:42:41,112 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:42:41,112 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:42:41,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:42:41,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:42:39" (1/3) ... [2025-02-06 02:42:41,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ca7b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:42:41, skipping insertion in model container [2025-02-06 02:42:41,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:39" (2/3) ... [2025-02-06 02:42:41,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ca7b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:42:41, skipping insertion in model container [2025-02-06 02:42:41,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:42:41" (3/3) ... [2025-02-06 02:42:41,117 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-64.i [2025-02-06 02:42:41,126 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:42:41,129 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-64.i that has 2 procedures, 274 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:42:41,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:42:41,197 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;@665fe85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:42:41,200 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:42:41,204 INFO L276 IsEmpty]: Start isEmpty. Operand has 274 states, 206 states have (on average 1.5776699029126213) internal successors, (325), 207 states have internal predecessors, (325), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-02-06 02:42:41,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-02-06 02:42:41,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:41,224 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:41,224 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:41,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:41,228 INFO L85 PathProgramCache]: Analyzing trace with hash 247434820, now seen corresponding path program 1 times [2025-02-06 02:42:41,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:41,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722262095] [2025-02-06 02:42:41,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:41,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:41,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-02-06 02:42:41,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-02-06 02:42:41,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:41,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2025-02-06 02:42:41,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:41,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722262095] [2025-02-06 02:42:41,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722262095] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:42:41,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116822211] [2025-02-06 02:42:41,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:41,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:42:41,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:42:41,703 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:42:41,705 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:42:41,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-02-06 02:42:42,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-02-06 02:42:42,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:42,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:42,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:42:42,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:42:42,103 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2025-02-06 02:42:42,103 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:42:42,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116822211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:42,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:42:42,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:42:42,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822965706] [2025-02-06 02:42:42,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:42,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:42:42,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:42,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:42:42,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:42:42,128 INFO L87 Difference]: Start difference. First operand has 274 states, 206 states have (on average 1.5776699029126213) internal successors, (325), 207 states have internal predecessors, (325), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) Second operand has 2 states, 2 states have (on average 57.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) [2025-02-06 02:42:42,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:42,185 INFO L93 Difference]: Finished difference Result 540 states and 966 transitions. [2025-02-06 02:42:42,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:42:42,187 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 57.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) Word has length 434 [2025-02-06 02:42:42,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:42,193 INFO L225 Difference]: With dead ends: 540 [2025-02-06 02:42:42,193 INFO L226 Difference]: Without dead ends: 269 [2025-02-06 02:42:42,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 435 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:42:42,202 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:42,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 430 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:42:42,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-02-06 02:42:42,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2025-02-06 02:42:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 202 states have (on average 1.5544554455445545) internal successors, (314), 202 states have internal predecessors, (314), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-02-06 02:42:42,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 444 transitions. [2025-02-06 02:42:42,252 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 444 transitions. Word has length 434 [2025-02-06 02:42:42,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:42,252 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 444 transitions. [2025-02-06 02:42:42,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) [2025-02-06 02:42:42,253 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 444 transitions. [2025-02-06 02:42:42,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-02-06 02:42:42,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:42,266 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:42,274 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:42:42,469 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:42:42,469 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:42,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:42,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1533469815, now seen corresponding path program 1 times [2025-02-06 02:42:42,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:42,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347528514] [2025-02-06 02:42:42,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:42,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:42,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-02-06 02:42:42,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-02-06 02:42:42,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:42,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:42:42,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:42,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347528514] [2025-02-06 02:42:42,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347528514] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:42,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:42,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:42:42,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047958598] [2025-02-06 02:42:42,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:42,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:42:42,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:42,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:42:42,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:42:42,958 INFO L87 Difference]: Start difference. First operand 269 states and 444 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:42:43,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:43,092 INFO L93 Difference]: Finished difference Result 739 states and 1223 transitions. [2025-02-06 02:42:43,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:42:43,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 434 [2025-02-06 02:42:43,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:43,097 INFO L225 Difference]: With dead ends: 739 [2025-02-06 02:42:43,097 INFO L226 Difference]: Without dead ends: 473 [2025-02-06 02:42:43,101 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:42:43,102 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 326 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:43,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 825 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:42:43,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-02-06 02:42:43,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 470. [2025-02-06 02:42:43,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 376 states have (on average 1.5824468085106382) internal successors, (595), 377 states have internal predecessors, (595), 91 states have call successors, (91), 2 states have call predecessors, (91), 2 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-06 02:42:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 777 transitions. [2025-02-06 02:42:43,143 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 777 transitions. Word has length 434 [2025-02-06 02:42:43,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:43,144 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 777 transitions. [2025-02-06 02:42:43,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:42:43,144 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 777 transitions. [2025-02-06 02:42:43,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-02-06 02:42:43,148 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:43,149 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:43,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:42:43,149 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:43,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:43,150 INFO L85 PathProgramCache]: Analyzing trace with hash -903011190, now seen corresponding path program 1 times [2025-02-06 02:42:43,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:43,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922747763] [2025-02-06 02:42:43,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:43,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:43,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-02-06 02:42:43,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-02-06 02:42:43,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:43,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:43,503 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:42:43,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:43,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922747763] [2025-02-06 02:42:43,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922747763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:43,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:43,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:42:43,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248704011] [2025-02-06 02:42:43,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:43,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:42:43,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:43,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:42:43,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:42:43,507 INFO L87 Difference]: Start difference. First operand 470 states and 777 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:42:43,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:43,781 INFO L93 Difference]: Finished difference Result 1354 states and 2246 transitions. [2025-02-06 02:42:43,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:42:43,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 434 [2025-02-06 02:42:43,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:43,789 INFO L225 Difference]: With dead ends: 1354 [2025-02-06 02:42:43,792 INFO L226 Difference]: Without dead ends: 887 [2025-02-06 02:42:43,793 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:42:43,794 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 391 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:43,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1045 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:42:43,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2025-02-06 02:42:43,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 532. [2025-02-06 02:42:43,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 438 states have (on average 1.6050228310502284) internal successors, (703), 439 states have internal predecessors, (703), 91 states have call successors, (91), 2 states have call predecessors, (91), 2 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-06 02:42:43,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 885 transitions. [2025-02-06 02:42:43,859 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 885 transitions. Word has length 434 [2025-02-06 02:42:43,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:43,861 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 885 transitions. [2025-02-06 02:42:43,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:42:43,861 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 885 transitions. [2025-02-06 02:42:43,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-02-06 02:42:43,867 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:43,867 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:43,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:42:43,867 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:43,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:43,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1825694773, now seen corresponding path program 1 times [2025-02-06 02:42:43,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:43,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123091017] [2025-02-06 02:42:43,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:43,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:43,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-02-06 02:42:43,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-02-06 02:42:43,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:43,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:42:44,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:44,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123091017] [2025-02-06 02:42:44,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123091017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:44,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:44,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:42:44,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518156051] [2025-02-06 02:42:44,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:44,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:42:44,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:44,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:42:44,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:42:44,139 INFO L87 Difference]: Start difference. First operand 532 states and 885 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:42:44,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:44,338 INFO L93 Difference]: Finished difference Result 1590 states and 2649 transitions. [2025-02-06 02:42:44,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:42:44,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 434 [2025-02-06 02:42:44,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:44,353 INFO L225 Difference]: With dead ends: 1590 [2025-02-06 02:42:44,356 INFO L226 Difference]: Without dead ends: 1061 [2025-02-06 02:42:44,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:42:44,363 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 439 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:44,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 893 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:42:44,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2025-02-06 02:42:44,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1059. [2025-02-06 02:42:44,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 872 states have (on average 1.598623853211009) internal successors, (1394), 874 states have internal predecessors, (1394), 182 states have call successors, (182), 4 states have call predecessors, (182), 4 states have return successors, (182), 180 states have call predecessors, (182), 182 states have call successors, (182) [2025-02-06 02:42:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1758 transitions. [2025-02-06 02:42:44,549 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1758 transitions. Word has length 434 [2025-02-06 02:42:44,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:44,550 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1758 transitions. [2025-02-06 02:42:44,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:42:44,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1758 transitions. [2025-02-06 02:42:44,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-02-06 02:42:44,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:44,563 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:44,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:42:44,563 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:44,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:44,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1837010900, now seen corresponding path program 1 times [2025-02-06 02:42:44,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:44,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949334554] [2025-02-06 02:42:44,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:44,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:44,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-02-06 02:42:44,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-02-06 02:42:44,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:44,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:42:45,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:45,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949334554] [2025-02-06 02:42:45,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949334554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:45,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:45,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:42:45,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942638478] [2025-02-06 02:42:45,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:45,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:42:45,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:45,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:42:45,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:42:45,680 INFO L87 Difference]: Start difference. First operand 1059 states and 1758 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:42:46,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:46,075 INFO L93 Difference]: Finished difference Result 2900 states and 4827 transitions. [2025-02-06 02:42:46,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:42:46,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 434 [2025-02-06 02:42:46,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:46,084 INFO L225 Difference]: With dead ends: 2900 [2025-02-06 02:42:46,084 INFO L226 Difference]: Without dead ends: 1844 [2025-02-06 02:42:46,086 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:42:46,086 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 354 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:46,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1244 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:42:46,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-02-06 02:42:46,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1734. [2025-02-06 02:42:46,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1480 states have (on average 1.6317567567567568) internal successors, (2415), 1482 states have internal predecessors, (2415), 247 states have call successors, (247), 6 states have call predecessors, (247), 6 states have return successors, (247), 245 states have call predecessors, (247), 247 states have call successors, (247) [2025-02-06 02:42:46,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2909 transitions. [2025-02-06 02:42:46,195 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2909 transitions. Word has length 434 [2025-02-06 02:42:46,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:46,195 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2909 transitions. [2025-02-06 02:42:46,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:42:46,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2909 transitions. [2025-02-06 02:42:46,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-02-06 02:42:46,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:46,200 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:46,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:42:46,201 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:46,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:46,201 INFO L85 PathProgramCache]: Analyzing trace with hash 480268651, now seen corresponding path program 1 times [2025-02-06 02:42:46,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:46,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878981835] [2025-02-06 02:42:46,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:46,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:46,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-02-06 02:42:46,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-02-06 02:42:46,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:46,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:46,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:42:46,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:46,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878981835] [2025-02-06 02:42:46,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878981835] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:46,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:46,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:42:46,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528624545] [2025-02-06 02:42:46,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:46,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:42:46,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:46,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:42:46,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:42:46,983 INFO L87 Difference]: Start difference. First operand 1734 states and 2909 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:42:47,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:47,419 INFO L93 Difference]: Finished difference Result 3448 states and 5770 transitions. [2025-02-06 02:42:47,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:42:47,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 435 [2025-02-06 02:42:47,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:47,428 INFO L225 Difference]: With dead ends: 3448 [2025-02-06 02:42:47,428 INFO L226 Difference]: Without dead ends: 1844 [2025-02-06 02:42:47,431 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:42:47,431 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 350 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:47,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1247 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:42:47,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-02-06 02:42:47,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1738. [2025-02-06 02:42:47,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1484 states have (on average 1.6287061994609164) internal successors, (2417), 1486 states have internal predecessors, (2417), 247 states have call successors, (247), 6 states have call predecessors, (247), 6 states have return successors, (247), 245 states have call predecessors, (247), 247 states have call successors, (247) [2025-02-06 02:42:47,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2911 transitions. [2025-02-06 02:42:47,566 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2911 transitions. Word has length 435 [2025-02-06 02:42:47,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:47,567 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2911 transitions. [2025-02-06 02:42:47,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:42:47,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2911 transitions. [2025-02-06 02:42:47,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-02-06 02:42:47,573 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:47,573 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:47,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:42:47,574 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:47,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:47,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1559591120, now seen corresponding path program 1 times [2025-02-06 02:42:47,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:47,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750780640] [2025-02-06 02:42:47,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:47,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:47,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-02-06 02:42:47,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-02-06 02:42:47,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:47,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:48,696 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:42:48,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:48,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750780640] [2025-02-06 02:42:48,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750780640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:48,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:48,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 02:42:48,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058558870] [2025-02-06 02:42:48,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:48,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:42:48,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:48,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:42:48,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:42:48,698 INFO L87 Difference]: Start difference. First operand 1738 states and 2911 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:42:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:49,388 INFO L93 Difference]: Finished difference Result 4245 states and 7126 transitions. [2025-02-06 02:42:49,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:42:49,388 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 436 [2025-02-06 02:42:49,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:49,399 INFO L225 Difference]: With dead ends: 4245 [2025-02-06 02:42:49,400 INFO L226 Difference]: Without dead ends: 2979 [2025-02-06 02:42:49,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:42:49,403 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 2055 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2055 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:49,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2055 Valid, 1331 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:42:49,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2025-02-06 02:42:49,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 2087. [2025-02-06 02:42:49,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2087 states, 1833 states have (on average 1.6175668303327877) internal successors, (2965), 1835 states have internal predecessors, (2965), 247 states have call successors, (247), 6 states have call predecessors, (247), 6 states have return successors, (247), 245 states have call predecessors, (247), 247 states have call successors, (247) [2025-02-06 02:42:49,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 3459 transitions. [2025-02-06 02:42:49,504 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 3459 transitions. Word has length 436 [2025-02-06 02:42:49,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:49,504 INFO L471 AbstractCegarLoop]: Abstraction has 2087 states and 3459 transitions. [2025-02-06 02:42:49,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:42:49,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 3459 transitions. [2025-02-06 02:42:49,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-02-06 02:42:49,509 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:49,509 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:49,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:42:49,509 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:49,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:49,510 INFO L85 PathProgramCache]: Analyzing trace with hash 2006670738, now seen corresponding path program 1 times [2025-02-06 02:42:49,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:49,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936542236] [2025-02-06 02:42:49,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:49,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:49,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-02-06 02:42:50,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-02-06 02:42:50,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:50,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:50,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:42:50,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:50,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936542236] [2025-02-06 02:42:50,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936542236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:50,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:50,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:42:50,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931988415] [2025-02-06 02:42:50,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:50,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:42:50,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:50,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:42:50,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:42:50,470 INFO L87 Difference]: Start difference. First operand 2087 states and 3459 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:42:51,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:51,064 INFO L93 Difference]: Finished difference Result 6153 states and 10228 transitions. [2025-02-06 02:42:51,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:42:51,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 436 [2025-02-06 02:42:51,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:51,082 INFO L225 Difference]: With dead ends: 6153 [2025-02-06 02:42:51,083 INFO L226 Difference]: Without dead ends: 4723 [2025-02-06 02:42:51,087 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:42:51,087 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 949 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:51,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 1345 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:42:51,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4723 states. [2025-02-06 02:42:51,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4723 to 3577. [2025-02-06 02:42:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3577 states, 3179 states have (on average 1.6404529726329034) internal successors, (5215), 3185 states have internal predecessors, (5215), 387 states have call successors, (387), 10 states have call predecessors, (387), 10 states have return successors, (387), 381 states have call predecessors, (387), 387 states have call successors, (387) [2025-02-06 02:42:51,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 5989 transitions. [2025-02-06 02:42:51,263 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 5989 transitions. Word has length 436 [2025-02-06 02:42:51,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:51,264 INFO L471 AbstractCegarLoop]: Abstraction has 3577 states and 5989 transitions. [2025-02-06 02:42:51,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:42:51,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 5989 transitions. [2025-02-06 02:42:51,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-02-06 02:42:51,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:51,269 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:51,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:42:51,269 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:51,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:51,270 INFO L85 PathProgramCache]: Analyzing trace with hash 71010451, now seen corresponding path program 1 times [2025-02-06 02:42:51,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:51,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675410736] [2025-02-06 02:42:51,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:51,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:51,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-02-06 02:42:52,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-02-06 02:42:52,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:52,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:11,703 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:43:11,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:11,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675410736] [2025-02-06 02:43:11,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675410736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:11,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:11,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-02-06 02:43:11,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311990942] [2025-02-06 02:43:11,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:11,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 02:43:11,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:11,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 02:43:11,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2025-02-06 02:43:11,709 INFO L87 Difference]: Start difference. First operand 3577 states and 5989 transitions. Second operand has 22 states, 22 states have (on average 5.181818181818182) internal successors, (114), 22 states have internal predecessors, (114), 5 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) [2025-02-06 02:43:31,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:31,047 INFO L93 Difference]: Finished difference Result 10018 states and 16513 transitions. [2025-02-06 02:43:31,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 02:43:31,048 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.181818181818182) internal successors, (114), 22 states have internal predecessors, (114), 5 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) Word has length 436 [2025-02-06 02:43:31,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:31,070 INFO L225 Difference]: With dead ends: 10018 [2025-02-06 02:43:31,070 INFO L226 Difference]: Without dead ends: 7758 [2025-02-06 02:43:31,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=395, Invalid=1585, Unknown=0, NotChecked=0, Total=1980 [2025-02-06 02:43:31,075 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 6528 mSDsluCounter, 4998 mSDsCounter, 0 mSdLazyCounter, 6948 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6528 SdHoareTripleChecker+Valid, 5562 SdHoareTripleChecker+Invalid, 7539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 6948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:31,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6528 Valid, 5562 Invalid, 7539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 6948 Invalid, 0 Unknown, 0 Unchecked, 12.9s Time] [2025-02-06 02:43:31,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7758 states. [2025-02-06 02:43:31,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7758 to 4526. [2025-02-06 02:43:31,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4526 states, 4090 states have (on average 1.6342298288508557) internal successors, (6684), 4100 states have internal predecessors, (6684), 419 states have call successors, (419), 16 states have call predecessors, (419), 16 states have return successors, (419), 409 states have call predecessors, (419), 419 states have call successors, (419) [2025-02-06 02:43:31,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4526 states to 4526 states and 7522 transitions. [2025-02-06 02:43:31,270 INFO L78 Accepts]: Start accepts. Automaton has 4526 states and 7522 transitions. Word has length 436 [2025-02-06 02:43:31,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:31,271 INFO L471 AbstractCegarLoop]: Abstraction has 4526 states and 7522 transitions. [2025-02-06 02:43:31,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.181818181818182) internal successors, (114), 22 states have internal predecessors, (114), 5 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) [2025-02-06 02:43:31,274 INFO L276 IsEmpty]: Start isEmpty. Operand 4526 states and 7522 transitions. [2025-02-06 02:43:31,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-02-06 02:43:31,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:31,280 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:31,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:43:31,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:31,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:31,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1629730028, now seen corresponding path program 1 times [2025-02-06 02:43:31,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:31,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762137655] [2025-02-06 02:43:31,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:31,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:31,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-02-06 02:43:32,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-02-06 02:43:32,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:32,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:33,170 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 24 proven. 168 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-02-06 02:43:33,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:33,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762137655] [2025-02-06 02:43:33,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762137655] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:43:33,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010027104] [2025-02-06 02:43:33,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:33,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:43:33,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:43:33,173 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:43:33,175 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:43:33,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-02-06 02:43:33,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-02-06 02:43:33,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:33,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:33,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 1106 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:43:33,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:43:33,752 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 4182 proven. 105 refuted. 0 times theorem prover too weak. 4033 trivial. 0 not checked. [2025-02-06 02:43:33,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:43:34,075 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 87 proven. 105 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-02-06 02:43:34,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010027104] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:43:34,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:43:34,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2025-02-06 02:43:34,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247594139] [2025-02-06 02:43:34,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:43:34,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 02:43:34,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:34,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 02:43:34,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 02:43:34,078 INFO L87 Difference]: Start difference. First operand 4526 states and 7522 transitions. Second operand has 12 states, 12 states have (on average 16.666666666666668) internal successors, (200), 12 states have internal predecessors, (200), 4 states have call successors, (165), 2 states have call predecessors, (165), 4 states have return successors, (166), 4 states have call predecessors, (166), 4 states have call successors, (166) [2025-02-06 02:43:35,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:35,736 INFO L93 Difference]: Finished difference Result 10471 states and 17320 transitions. [2025-02-06 02:43:35,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 02:43:35,737 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 16.666666666666668) internal successors, (200), 12 states have internal predecessors, (200), 4 states have call successors, (165), 2 states have call predecessors, (165), 4 states have return successors, (166), 4 states have call predecessors, (166), 4 states have call successors, (166) Word has length 436 [2025-02-06 02:43:35,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:35,757 INFO L225 Difference]: With dead ends: 10471 [2025-02-06 02:43:35,757 INFO L226 Difference]: Without dead ends: 6102 [2025-02-06 02:43:35,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 902 GetRequests, 871 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=767, Unknown=0, NotChecked=0, Total=992 [2025-02-06 02:43:35,766 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 1219 mSDsluCounter, 2517 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 2985 SdHoareTripleChecker+Invalid, 1780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:35,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1247 Valid, 2985 Invalid, 1780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 02:43:35,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6102 states. [2025-02-06 02:43:36,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6102 to 4954. [2025-02-06 02:43:36,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4954 states, 4476 states have (on average 1.6181858802502234) internal successors, (7243), 4490 states have internal predecessors, (7243), 451 states have call successors, (451), 26 states have call predecessors, (451), 26 states have return successors, (451), 437 states have call predecessors, (451), 451 states have call successors, (451) [2025-02-06 02:43:36,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4954 states to 4954 states and 8145 transitions. [2025-02-06 02:43:36,029 INFO L78 Accepts]: Start accepts. Automaton has 4954 states and 8145 transitions. Word has length 436 [2025-02-06 02:43:36,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:36,030 INFO L471 AbstractCegarLoop]: Abstraction has 4954 states and 8145 transitions. [2025-02-06 02:43:36,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.666666666666668) internal successors, (200), 12 states have internal predecessors, (200), 4 states have call successors, (165), 2 states have call predecessors, (165), 4 states have return successors, (166), 4 states have call predecessors, (166), 4 states have call successors, (166) [2025-02-06 02:43:36,031 INFO L276 IsEmpty]: Start isEmpty. Operand 4954 states and 8145 transitions. [2025-02-06 02:43:36,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-02-06 02:43:36,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:36,036 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:36,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 02:43:36,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:43:36,237 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:36,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:36,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1696500034, now seen corresponding path program 1 times [2025-02-06 02:43:36,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:36,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884727684] [2025-02-06 02:43:36,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:36,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:36,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-02-06 02:43:36,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-02-06 02:43:36,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:36,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:36,711 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:43:36,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:36,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884727684] [2025-02-06 02:43:36,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884727684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:36,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:36,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:43:36,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592977221] [2025-02-06 02:43:36,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:36,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:43:36,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:36,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:43:36,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:36,713 INFO L87 Difference]: Start difference. First operand 4954 states and 8145 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:43:37,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:37,168 INFO L93 Difference]: Finished difference Result 13170 states and 21674 transitions. [2025-02-06 02:43:37,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:43:37,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 437 [2025-02-06 02:43:37,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:37,185 INFO L225 Difference]: With dead ends: 13170 [2025-02-06 02:43:37,185 INFO L226 Difference]: Without dead ends: 8934 [2025-02-06 02:43:37,190 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:43:37,190 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 525 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:37,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 970 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:43:37,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8934 states. [2025-02-06 02:43:37,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8934 to 7246. [2025-02-06 02:43:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7246 states, 6759 states have (on average 1.6443260837401983) internal successors, (11114), 6773 states have internal predecessors, (11114), 451 states have call successors, (451), 35 states have call predecessors, (451), 35 states have return successors, (451), 437 states have call predecessors, (451), 451 states have call successors, (451) [2025-02-06 02:43:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7246 states to 7246 states and 12016 transitions. [2025-02-06 02:43:37,426 INFO L78 Accepts]: Start accepts. Automaton has 7246 states and 12016 transitions. Word has length 437 [2025-02-06 02:43:37,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:37,427 INFO L471 AbstractCegarLoop]: Abstraction has 7246 states and 12016 transitions. [2025-02-06 02:43:37,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:43:37,427 INFO L276 IsEmpty]: Start isEmpty. Operand 7246 states and 12016 transitions. [2025-02-06 02:43:37,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-02-06 02:43:37,435 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:37,435 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:37,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:43:37,435 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:37,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:37,436 INFO L85 PathProgramCache]: Analyzing trace with hash -442391436, now seen corresponding path program 1 times [2025-02-06 02:43:37,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:37,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953687585] [2025-02-06 02:43:37,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:37,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:37,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-02-06 02:43:38,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-02-06 02:43:38,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:38,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:47,171 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:43:47,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:47,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953687585] [2025-02-06 02:43:47,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953687585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:47,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:47,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-02-06 02:43:47,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913806767] [2025-02-06 02:43:47,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:47,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 02:43:47,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:47,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 02:43:47,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2025-02-06 02:43:47,182 INFO L87 Difference]: Start difference. First operand 7246 states and 12016 transitions. Second operand has 23 states, 23 states have (on average 5.0) internal successors, (115), 23 states have internal predecessors, (115), 4 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 4 states have call predecessors, (65), 4 states have call successors, (65) [2025-02-06 02:43:59,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:59,961 INFO L93 Difference]: Finished difference Result 25134 states and 41263 transitions. [2025-02-06 02:43:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-06 02:43:59,961 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.0) internal successors, (115), 23 states have internal predecessors, (115), 4 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 4 states have call predecessors, (65), 4 states have call successors, (65) Word has length 437 [2025-02-06 02:43:59,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:44:00,009 INFO L225 Difference]: With dead ends: 25134 [2025-02-06 02:44:00,011 INFO L226 Difference]: Without dead ends: 21514 [2025-02-06 02:44:00,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=397, Invalid=1859, Unknown=0, NotChecked=0, Total=2256 [2025-02-06 02:44:00,021 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 6268 mSDsluCounter, 6959 mSDsCounter, 0 mSdLazyCounter, 6850 mSolverCounterSat, 627 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6268 SdHoareTripleChecker+Valid, 7579 SdHoareTripleChecker+Invalid, 7477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 627 IncrementalHoareTripleChecker+Valid, 6850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:44:00,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6268 Valid, 7579 Invalid, 7477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [627 Valid, 6850 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2025-02-06 02:44:00,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21514 states. [2025-02-06 02:44:00,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21514 to 11475. [2025-02-06 02:44:00,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11475 states, 10693 states have (on average 1.6344337417001777) internal successors, (17477), 10727 states have internal predecessors, (17477), 711 states have call successors, (711), 70 states have call predecessors, (711), 70 states have return successors, (711), 677 states have call predecessors, (711), 711 states have call successors, (711) [2025-02-06 02:44:00,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11475 states to 11475 states and 18899 transitions. [2025-02-06 02:44:00,652 INFO L78 Accepts]: Start accepts. Automaton has 11475 states and 18899 transitions. Word has length 437 [2025-02-06 02:44:00,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:44:00,654 INFO L471 AbstractCegarLoop]: Abstraction has 11475 states and 18899 transitions. [2025-02-06 02:44:00,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.0) internal successors, (115), 23 states have internal predecessors, (115), 4 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 4 states have call predecessors, (65), 4 states have call successors, (65) [2025-02-06 02:44:00,655 INFO L276 IsEmpty]: Start isEmpty. Operand 11475 states and 18899 transitions. [2025-02-06 02:44:00,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-02-06 02:44:00,705 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:44:00,705 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:00,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:44:00,705 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:44:00,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:44:00,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1625738733, now seen corresponding path program 1 times [2025-02-06 02:44:00,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:44:00,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57521646] [2025-02-06 02:44:00,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:44:00,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:44:00,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes.