./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-84.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6ec6051bf33a15e9801346cc4ecd6a0b29081514a3565e91db18e7f838fe18c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:51:55,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:51:55,440 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:51:55,446 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:51:55,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:51:55,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:51:55,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:51:55,471 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:51:55,472 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:51:55,472 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:51:55,473 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:51:55,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:51:55,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:51:55,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:51:55,474 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:51:55,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:51:55,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:51:55,474 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:51:55,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:51:55,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:51:55,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:51:55,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:51:55,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:51:55,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:51:55,475 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:51:55,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:51:55,475 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:51:55,475 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:51:55,475 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:51:55,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:51:55,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:51:55,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:51:55,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:51:55,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:51:55,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:51:55,475 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:51:55,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:51:55,475 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:51:55,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:51:55,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:51:55,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:51:55,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:51:55,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:51:55,476 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6ec6051bf33a15e9801346cc4ecd6a0b29081514a3565e91db18e7f838fe18c5 [2025-03-03 19:51:55,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:51:55,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:51:55,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:51:55,711 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:51:55,712 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:51:55,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-84.i [2025-03-03 19:51:56,844 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06cf9b4aa/18c05bbb90f042cdbeef7ce522201d00/FLAGf8015d321 [2025-03-03 19:51:57,129 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:51:57,130 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-84.i [2025-03-03 19:51:57,143 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06cf9b4aa/18c05bbb90f042cdbeef7ce522201d00/FLAGf8015d321 [2025-03-03 19:51:57,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06cf9b4aa/18c05bbb90f042cdbeef7ce522201d00 [2025-03-03 19:51:57,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:51:57,413 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:51:57,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:51:57,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:51:57,417 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:51:57,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:51:57" (1/1) ... [2025-03-03 19:51:57,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a3954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:57, skipping insertion in model container [2025-03-03 19:51:57,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:51:57" (1/1) ... [2025-03-03 19:51:57,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:51:57,547 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-84.i[916,929] [2025-03-03 19:51:57,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:51:57,711 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:51:57,721 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-84.i[916,929] [2025-03-03 19:51:57,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:51:57,799 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:51:57,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:57 WrapperNode [2025-03-03 19:51:57,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:51:57,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:51:57,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:51:57,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:51:57,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:57" (1/1) ... [2025-03-03 19:51:57,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:57" (1/1) ... [2025-03-03 19:51:57,880 INFO L138 Inliner]: procedures = 26, calls = 122, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 686 [2025-03-03 19:51:57,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:51:57,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:51:57,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:51:57,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:51:57,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:57" (1/1) ... [2025-03-03 19:51:57,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:57" (1/1) ... [2025-03-03 19:51:57,903 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:57" (1/1) ... [2025-03-03 19:51:57,926 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:51:57,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:57" (1/1) ... [2025-03-03 19:51:57,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:57" (1/1) ... [2025-03-03 19:51:57,941 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:57" (1/1) ... [2025-03-03 19:51:57,946 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:57" (1/1) ... [2025-03-03 19:51:57,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:57" (1/1) ... [2025-03-03 19:51:57,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:57" (1/1) ... [2025-03-03 19:51:57,965 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:51:57,966 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:51:57,966 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:51:57,966 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:51:57,967 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:57" (1/1) ... [2025-03-03 19:51:57,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:51:57,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:51:57,991 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:51:57,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:51:58,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:51:58,009 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:51:58,009 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:51:58,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:51:58,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:51:58,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:51:58,104 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:51:58,105 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:51:58,815 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L490: havoc property_#t~bitwise73#1;havoc property_#t~short74#1;havoc property_#t~bitwise75#1;havoc property_#t~short76#1; [2025-03-03 19:51:58,935 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-03 19:51:58,936 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:51:58,963 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:51:58,963 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:51:58,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:51:58 BoogieIcfgContainer [2025-03-03 19:51:58,963 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:51:58,965 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:51:58,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:51:58,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:51:58,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:51:57" (1/3) ... [2025-03-03 19:51:58,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9a99a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:51:58, skipping insertion in model container [2025-03-03 19:51:58,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:57" (2/3) ... [2025-03-03 19:51:58,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9a99a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:51:58, skipping insertion in model container [2025-03-03 19:51:58,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:51:58" (3/3) ... [2025-03-03 19:51:58,971 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-84.i [2025-03-03 19:51:58,982 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:51:58,985 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-84.i that has 2 procedures, 287 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:51:59,066 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:51:59,076 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;@69427201, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:51:59,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:51:59,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 287 states, 175 states have (on average 1.4742857142857142) internal successors, (258), 176 states have internal predecessors, (258), 109 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 109 states have call predecessors, (109), 109 states have call successors, (109) [2025-03-03 19:51:59,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-03-03 19:51:59,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:51:59,109 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:51:59,109 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:51:59,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:51:59,116 INFO L85 PathProgramCache]: Analyzing trace with hash 554480286, now seen corresponding path program 1 times [2025-03-03 19:51:59,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:51:59,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654466207] [2025-03-03 19:51:59,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:51:59,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:51:59,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-03-03 19:51:59,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-03-03 19:51:59,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:51:59,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:51:59,694 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 23328 trivial. 0 not checked. [2025-03-03 19:51:59,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:51:59,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654466207] [2025-03-03 19:51:59,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654466207] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:51:59,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452869617] [2025-03-03 19:51:59,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:51:59,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:51:59,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:51:59,700 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:51:59,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 19:51:59,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-03-03 19:52:00,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-03-03 19:52:00,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:00,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:00,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 1440 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:52:00,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:52:00,121 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 23328 trivial. 0 not checked. [2025-03-03 19:52:00,122 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:52:00,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452869617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:00,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:52:00,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:52:00,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984122420] [2025-03-03 19:52:00,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:00,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:52:00,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:00,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:52:00,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:52:00,145 INFO L87 Difference]: Start difference. First operand has 287 states, 175 states have (on average 1.4742857142857142) internal successors, (258), 176 states have internal predecessors, (258), 109 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 109 states have call predecessors, (109), 109 states have call successors, (109) Second operand has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 2 states have call successors, (109), 2 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 2 states have call successors, (109) [2025-03-03 19:52:00,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:00,219 INFO L93 Difference]: Finished difference Result 568 states and 1056 transitions. [2025-03-03 19:52:00,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:52:00,222 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 2 states have call successors, (109), 2 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 2 states have call successors, (109) Word has length 661 [2025-03-03 19:52:00,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:00,228 INFO L225 Difference]: With dead ends: 568 [2025-03-03 19:52:00,228 INFO L226 Difference]: Without dead ends: 284 [2025-03-03 19:52:00,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 662 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:52:00,237 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:00,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 456 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:52:00,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-03 19:52:00,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2025-03-03 19:52:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 173 states have (on average 1.4624277456647399) internal successors, (253), 173 states have internal predecessors, (253), 109 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 109 states have call predecessors, (109), 109 states have call successors, (109) [2025-03-03 19:52:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 471 transitions. [2025-03-03 19:52:00,312 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 471 transitions. Word has length 661 [2025-03-03 19:52:00,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:00,314 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 471 transitions. [2025-03-03 19:52:00,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 2 states have call successors, (109), 2 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 2 states have call successors, (109) [2025-03-03 19:52:00,315 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 471 transitions. [2025-03-03 19:52:00,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-03-03 19:52:00,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:00,327 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:52:00,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 19:52:00,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 19:52:00,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:00,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:00,532 INFO L85 PathProgramCache]: Analyzing trace with hash 68513887, now seen corresponding path program 1 times [2025-03-03 19:52:00,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:00,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206463007] [2025-03-03 19:52:00,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:00,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:00,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-03-03 19:52:00,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-03-03 19:52:00,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:00,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-03-03 19:52:01,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:01,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206463007] [2025-03-03 19:52:01,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206463007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:01,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:52:01,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:52:01,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583246384] [2025-03-03 19:52:01,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:01,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:52:01,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:01,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:52:01,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:52:01,202 INFO L87 Difference]: Start difference. First operand 284 states and 471 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:01,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:01,288 INFO L93 Difference]: Finished difference Result 754 states and 1246 transitions. [2025-03-03 19:52:01,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:52:01,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 661 [2025-03-03 19:52:01,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:01,294 INFO L225 Difference]: With dead ends: 754 [2025-03-03 19:52:01,296 INFO L226 Difference]: Without dead ends: 473 [2025-03-03 19:52:01,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:52:01,298 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 305 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:01,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 890 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:52:01,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-03-03 19:52:01,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 470. [2025-03-03 19:52:01,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 281 states have (on average 1.4306049822064058) internal successors, (402), 282 states have internal predecessors, (402), 186 states have call successors, (186), 2 states have call predecessors, (186), 2 states have return successors, (186), 185 states have call predecessors, (186), 186 states have call successors, (186) [2025-03-03 19:52:01,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 774 transitions. [2025-03-03 19:52:01,375 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 774 transitions. Word has length 661 [2025-03-03 19:52:01,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:01,376 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 774 transitions. [2025-03-03 19:52:01,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:01,376 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 774 transitions. [2025-03-03 19:52:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-03-03 19:52:01,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:01,382 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:52:01,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:52:01,382 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:01,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:01,383 INFO L85 PathProgramCache]: Analyzing trace with hash 599396248, now seen corresponding path program 1 times [2025-03-03 19:52:01,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:01,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152388485] [2025-03-03 19:52:01,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:01,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:01,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-03-03 19:52:01,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-03-03 19:52:01,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:01,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:02,061 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-03-03 19:52:02,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:02,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152388485] [2025-03-03 19:52:02,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152388485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:02,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:52:02,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:52:02,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793228682] [2025-03-03 19:52:02,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:02,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:52:02,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:02,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:52:02,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:52:02,068 INFO L87 Difference]: Start difference. First operand 470 states and 774 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:02,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:02,139 INFO L93 Difference]: Finished difference Result 937 states and 1545 transitions. [2025-03-03 19:52:02,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:52:02,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 663 [2025-03-03 19:52:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:02,148 INFO L225 Difference]: With dead ends: 937 [2025-03-03 19:52:02,149 INFO L226 Difference]: Without dead ends: 470 [2025-03-03 19:52:02,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:52:02,154 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 468 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:02,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 452 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:52:02,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-03 19:52:02,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2025-03-03 19:52:02,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 281 states have (on average 1.4234875444839858) internal successors, (400), 282 states have internal predecessors, (400), 186 states have call successors, (186), 2 states have call predecessors, (186), 2 states have return successors, (186), 185 states have call predecessors, (186), 186 states have call successors, (186) [2025-03-03 19:52:02,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 772 transitions. [2025-03-03 19:52:02,203 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 772 transitions. Word has length 663 [2025-03-03 19:52:02,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:02,206 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 772 transitions. [2025-03-03 19:52:02,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:02,207 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 772 transitions. [2025-03-03 19:52:02,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-03-03 19:52:02,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:02,213 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:52:02,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:52:02,213 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:02,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:02,214 INFO L85 PathProgramCache]: Analyzing trace with hash 728478967, now seen corresponding path program 1 times [2025-03-03 19:52:02,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:02,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975984353] [2025-03-03 19:52:02,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:02,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:02,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-03-03 19:52:02,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-03-03 19:52:02,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:02,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:05,305 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-03-03 19:52:05,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:05,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975984353] [2025-03-03 19:52:05,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975984353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:05,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:52:05,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 19:52:05,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245359920] [2025-03-03 19:52:05,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:05,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 19:52:05,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:05,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 19:52:05,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:52:05,309 INFO L87 Difference]: Start difference. First operand 470 states and 772 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:06,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:06,543 INFO L93 Difference]: Finished difference Result 1005 states and 1632 transitions. [2025-03-03 19:52:06,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:52:06,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 663 [2025-03-03 19:52:06,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:06,549 INFO L225 Difference]: With dead ends: 1005 [2025-03-03 19:52:06,549 INFO L226 Difference]: Without dead ends: 538 [2025-03-03 19:52:06,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:52:06,553 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 41 mSDsluCounter, 1707 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:06,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2155 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 19:52:06,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-03 19:52:06,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 534. [2025-03-03 19:52:06,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 335 states have (on average 1.4029850746268657) internal successors, (470), 338 states have internal predecessors, (470), 194 states have call successors, (194), 4 states have call predecessors, (194), 4 states have return successors, (194), 191 states have call predecessors, (194), 194 states have call successors, (194) [2025-03-03 19:52:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 858 transitions. [2025-03-03 19:52:06,629 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 858 transitions. Word has length 663 [2025-03-03 19:52:06,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:06,631 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 858 transitions. [2025-03-03 19:52:06,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 858 transitions. [2025-03-03 19:52:06,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2025-03-03 19:52:06,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:06,640 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:52:06,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:52:06,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:06,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:06,641 INFO L85 PathProgramCache]: Analyzing trace with hash 663721721, now seen corresponding path program 1 times [2025-03-03 19:52:06,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:06,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179591993] [2025-03-03 19:52:06,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:06,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:06,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 664 statements into 1 equivalence classes. [2025-03-03 19:52:06,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 664 of 664 statements. [2025-03-03 19:52:06,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:06,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:07,255 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-03-03 19:52:07,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:07,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179591993] [2025-03-03 19:52:07,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179591993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:07,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:52:07,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:52:07,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041691702] [2025-03-03 19:52:07,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:07,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:52:07,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:07,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:52:07,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:52:07,258 INFO L87 Difference]: Start difference. First operand 534 states and 858 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:07,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:07,660 INFO L93 Difference]: Finished difference Result 1530 states and 2464 transitions. [2025-03-03 19:52:07,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:52:07,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 664 [2025-03-03 19:52:07,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:07,668 INFO L225 Difference]: With dead ends: 1530 [2025-03-03 19:52:07,668 INFO L226 Difference]: Without dead ends: 999 [2025-03-03 19:52:07,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:52:07,671 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 906 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 2148 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:07,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 2148 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:52:07,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2025-03-03 19:52:07,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 660. [2025-03-03 19:52:07,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 382 states have (on average 1.350785340314136) internal successors, (516), 386 states have internal predecessors, (516), 271 states have call successors, (271), 6 states have call predecessors, (271), 6 states have return successors, (271), 267 states have call predecessors, (271), 271 states have call successors, (271) [2025-03-03 19:52:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1058 transitions. [2025-03-03 19:52:07,756 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1058 transitions. Word has length 664 [2025-03-03 19:52:07,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:07,758 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 1058 transitions. [2025-03-03 19:52:07,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:07,758 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1058 transitions. [2025-03-03 19:52:07,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2025-03-03 19:52:07,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:07,763 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:52:07,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:52:07,766 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:07,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:07,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1908486202, now seen corresponding path program 1 times [2025-03-03 19:52:07,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:07,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134249708] [2025-03-03 19:52:07,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:07,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:07,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 664 statements into 1 equivalence classes. [2025-03-03 19:52:07,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 664 of 664 statements. [2025-03-03 19:52:07,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:07,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-03-03 19:52:10,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:10,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134249708] [2025-03-03 19:52:10,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134249708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:10,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:52:10,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 19:52:10,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339392106] [2025-03-03 19:52:10,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:10,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:52:10,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:10,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:52:10,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:52:10,886 INFO L87 Difference]: Start difference. First operand 660 states and 1058 transitions. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:11,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:11,785 INFO L93 Difference]: Finished difference Result 1253 states and 1993 transitions. [2025-03-03 19:52:11,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 19:52:11,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 664 [2025-03-03 19:52:11,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:11,792 INFO L225 Difference]: With dead ends: 1253 [2025-03-03 19:52:11,792 INFO L226 Difference]: Without dead ends: 722 [2025-03-03 19:52:11,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:52:11,795 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 60 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 2248 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:11,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 2248 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:52:11,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-03-03 19:52:11,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 718. [2025-03-03 19:52:11,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 434 states have (on average 1.3456221198156681) internal successors, (584), 440 states have internal predecessors, (584), 275 states have call successors, (275), 8 states have call predecessors, (275), 8 states have return successors, (275), 269 states have call predecessors, (275), 275 states have call successors, (275) [2025-03-03 19:52:11,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1134 transitions. [2025-03-03 19:52:11,862 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1134 transitions. Word has length 664 [2025-03-03 19:52:11,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:11,864 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1134 transitions. [2025-03-03 19:52:11,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:11,864 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1134 transitions. [2025-03-03 19:52:11,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2025-03-03 19:52:11,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:11,869 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:52:11,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:52:11,869 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:11,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:11,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1402927577, now seen corresponding path program 1 times [2025-03-03 19:52:11,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:11,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762461165] [2025-03-03 19:52:11,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:11,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:11,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 664 statements into 1 equivalence classes. [2025-03-03 19:52:11,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 664 of 664 statements. [2025-03-03 19:52:11,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:11,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:16,505 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-03-03 19:52:16,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:16,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762461165] [2025-03-03 19:52:16,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762461165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:16,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:52:16,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 19:52:16,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843375818] [2025-03-03 19:52:16,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:16,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 19:52:16,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:16,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 19:52:16,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:52:16,508 INFO L87 Difference]: Start difference. First operand 718 states and 1134 transitions. Second operand has 8 states, 8 states have (on average 15.25) internal successors, (122), 8 states have internal predecessors, (122), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:16,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:16,981 INFO L93 Difference]: Finished difference Result 1321 states and 2074 transitions. [2025-03-03 19:52:16,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 19:52:16,982 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 8 states have internal predecessors, (122), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 664 [2025-03-03 19:52:16,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:16,988 INFO L225 Difference]: With dead ends: 1321 [2025-03-03 19:52:16,988 INFO L226 Difference]: Without dead ends: 732 [2025-03-03 19:52:16,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:52:16,991 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 139 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:16,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1711 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:52:16,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-03-03 19:52:17,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 672. [2025-03-03 19:52:17,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 391 states have (on average 1.3375959079283888) internal successors, (523), 395 states have internal predecessors, (523), 271 states have call successors, (271), 9 states have call predecessors, (271), 9 states have return successors, (271), 267 states have call predecessors, (271), 271 states have call successors, (271) [2025-03-03 19:52:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1065 transitions. [2025-03-03 19:52:17,057 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1065 transitions. Word has length 664 [2025-03-03 19:52:17,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:17,059 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 1065 transitions. [2025-03-03 19:52:17,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 8 states have internal predecessors, (122), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:17,059 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1065 transitions. [2025-03-03 19:52:17,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2025-03-03 19:52:17,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:17,063 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:52:17,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:52:17,063 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:17,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:17,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1302714988, now seen corresponding path program 1 times [2025-03-03 19:52:17,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:17,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189298843] [2025-03-03 19:52:17,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:17,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:17,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-03-03 19:52:17,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-03-03 19:52:17,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:17,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:21,800 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-03-03 19:52:21,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:21,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189298843] [2025-03-03 19:52:21,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189298843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:21,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:52:21,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 19:52:21,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130202815] [2025-03-03 19:52:21,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:21,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:52:21,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:21,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:52:21,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:52:21,802 INFO L87 Difference]: Start difference. First operand 672 states and 1065 transitions. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:22,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:22,703 INFO L93 Difference]: Finished difference Result 1401 states and 2183 transitions. [2025-03-03 19:52:22,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:52:22,706 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 665 [2025-03-03 19:52:22,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:22,713 INFO L225 Difference]: With dead ends: 1401 [2025-03-03 19:52:22,714 INFO L226 Difference]: Without dead ends: 862 [2025-03-03 19:52:22,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-03 19:52:22,716 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 97 mSDsluCounter, 2131 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:22,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 2568 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:52:22,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2025-03-03 19:52:22,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 734. [2025-03-03 19:52:22,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 453 states have (on average 1.3443708609271523) internal successors, (609), 457 states have internal predecessors, (609), 271 states have call successors, (271), 9 states have call predecessors, (271), 9 states have return successors, (271), 267 states have call predecessors, (271), 271 states have call successors, (271) [2025-03-03 19:52:22,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1151 transitions. [2025-03-03 19:52:22,790 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1151 transitions. Word has length 665 [2025-03-03 19:52:22,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:22,791 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 1151 transitions. [2025-03-03 19:52:22,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1151 transitions. [2025-03-03 19:52:22,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2025-03-03 19:52:22,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:22,795 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:52:22,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 19:52:22,795 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:22,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:22,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1195300949, now seen corresponding path program 1 times [2025-03-03 19:52:22,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:22,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151226201] [2025-03-03 19:52:22,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:22,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:22,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-03-03 19:52:22,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-03-03 19:52:22,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:22,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-03-03 19:52:25,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:25,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151226201] [2025-03-03 19:52:25,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151226201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:25,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:52:25,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 19:52:25,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365034582] [2025-03-03 19:52:25,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:25,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 19:52:25,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:25,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 19:52:25,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:52:25,253 INFO L87 Difference]: Start difference. First operand 734 states and 1151 transitions. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:25,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:25,748 INFO L93 Difference]: Finished difference Result 1417 states and 2204 transitions. [2025-03-03 19:52:25,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 19:52:25,749 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 665 [2025-03-03 19:52:25,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:25,757 INFO L225 Difference]: With dead ends: 1417 [2025-03-03 19:52:25,757 INFO L226 Difference]: Without dead ends: 816 [2025-03-03 19:52:25,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-03 19:52:25,762 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 57 mSDsluCounter, 2103 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 2538 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:25,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 2538 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:52:25,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-03-03 19:52:25,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 734. [2025-03-03 19:52:25,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 453 states have (on average 1.3443708609271523) internal successors, (609), 457 states have internal predecessors, (609), 271 states have call successors, (271), 9 states have call predecessors, (271), 9 states have return successors, (271), 267 states have call predecessors, (271), 271 states have call successors, (271) [2025-03-03 19:52:25,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1151 transitions. [2025-03-03 19:52:25,851 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1151 transitions. Word has length 665 [2025-03-03 19:52:25,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:25,852 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 1151 transitions. [2025-03-03 19:52:25,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:25,852 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1151 transitions. [2025-03-03 19:52:25,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2025-03-03 19:52:25,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:25,859 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:52:25,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 19:52:25,859 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:25,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:25,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1009923043, now seen corresponding path program 1 times [2025-03-03 19:52:25,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:25,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879518040] [2025-03-03 19:52:25,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:25,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:25,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 666 statements into 1 equivalence classes. [2025-03-03 19:52:25,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 666 of 666 statements. [2025-03-03 19:52:25,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:25,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-03-03 19:52:26,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:26,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879518040] [2025-03-03 19:52:26,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879518040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:26,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:52:26,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:52:26,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687423728] [2025-03-03 19:52:26,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:26,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:52:26,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:26,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:52:26,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:52:26,035 INFO L87 Difference]: Start difference. First operand 734 states and 1151 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:26,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:26,148 INFO L93 Difference]: Finished difference Result 1467 states and 2270 transitions. [2025-03-03 19:52:26,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:52:26,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 666 [2025-03-03 19:52:26,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:26,154 INFO L225 Difference]: With dead ends: 1467 [2025-03-03 19:52:26,154 INFO L226 Difference]: Without dead ends: 866 [2025-03-03 19:52:26,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:52:26,157 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 45 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:26,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 884 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:52:26,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2025-03-03 19:52:26,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 822. [2025-03-03 19:52:26,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 535 states have (on average 1.3439252336448597) internal successors, (719), 541 states have internal predecessors, (719), 275 states have call successors, (275), 11 states have call predecessors, (275), 11 states have return successors, (275), 269 states have call predecessors, (275), 275 states have call successors, (275) [2025-03-03 19:52:26,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1269 transitions. [2025-03-03 19:52:26,218 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1269 transitions. Word has length 666 [2025-03-03 19:52:26,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:26,219 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1269 transitions. [2025-03-03 19:52:26,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1269 transitions. [2025-03-03 19:52:26,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2025-03-03 19:52:26,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:26,223 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:52:26,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 19:52:26,223 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:26,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:26,224 INFO L85 PathProgramCache]: Analyzing trace with hash 266216766, now seen corresponding path program 1 times [2025-03-03 19:52:26,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:26,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667083221] [2025-03-03 19:52:26,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:26,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:26,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 666 statements into 1 equivalence classes. [2025-03-03 19:52:26,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 666 of 666 statements. [2025-03-03 19:52:26,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:26,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-03-03 19:52:26,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:26,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667083221] [2025-03-03 19:52:26,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667083221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:26,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:52:26,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:52:26,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658594603] [2025-03-03 19:52:26,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:26,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:52:26,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:26,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:52:26,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:52:26,581 INFO L87 Difference]: Start difference. First operand 822 states and 1269 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:27,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:27,058 INFO L93 Difference]: Finished difference Result 1864 states and 2872 transitions. [2025-03-03 19:52:27,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:52:27,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 666 [2025-03-03 19:52:27,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:27,066 INFO L225 Difference]: With dead ends: 1864 [2025-03-03 19:52:27,067 INFO L226 Difference]: Without dead ends: 1175 [2025-03-03 19:52:27,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:52:27,071 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 367 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:27,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1570 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:52:27,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2025-03-03 19:52:27,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 983. [2025-03-03 19:52:27,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 663 states have (on average 1.4042232277526394) internal successors, (931), 668 states have internal predecessors, (931), 307 states have call successors, (307), 12 states have call predecessors, (307), 12 states have return successors, (307), 302 states have call predecessors, (307), 307 states have call successors, (307) [2025-03-03 19:52:27,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1545 transitions. [2025-03-03 19:52:27,142 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1545 transitions. Word has length 666 [2025-03-03 19:52:27,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:27,143 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1545 transitions. [2025-03-03 19:52:27,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:27,143 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1545 transitions. [2025-03-03 19:52:27,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2025-03-03 19:52:27,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:27,147 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:52:27,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 19:52:27,147 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:27,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:27,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2061607460, now seen corresponding path program 1 times [2025-03-03 19:52:27,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:27,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710441002] [2025-03-03 19:52:27,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:27,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:27,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 666 statements into 1 equivalence classes. [2025-03-03 19:52:27,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 666 of 666 statements. [2025-03-03 19:52:27,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:27,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:27,289 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-03-03 19:52:27,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:27,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710441002] [2025-03-03 19:52:27,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710441002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:27,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:52:27,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:52:27,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422427493] [2025-03-03 19:52:27,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:27,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:52:27,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:27,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:52:27,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:52:27,291 INFO L87 Difference]: Start difference. First operand 983 states and 1545 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:27,393 INFO L93 Difference]: Finished difference Result 1724 states and 2666 transitions. [2025-03-03 19:52:27,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:52:27,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 666 [2025-03-03 19:52:27,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:27,403 INFO L225 Difference]: With dead ends: 1724 [2025-03-03 19:52:27,403 INFO L226 Difference]: Without dead ends: 1035 [2025-03-03 19:52:27,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:52:27,405 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 39 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:27,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 869 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:52:27,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2025-03-03 19:52:27,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 953. [2025-03-03 19:52:27,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 637 states have (on average 1.3956043956043955) internal successors, (889), 640 states have internal predecessors, (889), 303 states have call successors, (303), 12 states have call predecessors, (303), 12 states have return successors, (303), 300 states have call predecessors, (303), 303 states have call successors, (303) [2025-03-03 19:52:27,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1495 transitions. [2025-03-03 19:52:27,465 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1495 transitions. Word has length 666 [2025-03-03 19:52:27,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:27,466 INFO L471 AbstractCegarLoop]: Abstraction has 953 states and 1495 transitions. [2025-03-03 19:52:27,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:27,466 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1495 transitions. [2025-03-03 19:52:27,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2025-03-03 19:52:27,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:27,471 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:52:27,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 19:52:27,471 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:27,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:27,471 INFO L85 PathProgramCache]: Analyzing trace with hash 910694765, now seen corresponding path program 1 times [2025-03-03 19:52:27,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:27,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777428929] [2025-03-03 19:52:27,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:27,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:27,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-03-03 19:52:27,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-03-03 19:52:27,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:27,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-03-03 19:52:30,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:30,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777428929] [2025-03-03 19:52:30,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777428929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:30,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:52:30,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 19:52:30,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175013757] [2025-03-03 19:52:30,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:30,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:52:30,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:30,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:52:30,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:52:30,613 INFO L87 Difference]: Start difference. First operand 953 states and 1495 transitions. Second operand has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:31,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:31,972 INFO L93 Difference]: Finished difference Result 1802 states and 2759 transitions. [2025-03-03 19:52:31,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:52:31,973 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 667 [2025-03-03 19:52:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:31,978 INFO L225 Difference]: With dead ends: 1802 [2025-03-03 19:52:31,978 INFO L226 Difference]: Without dead ends: 1143 [2025-03-03 19:52:31,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-03 19:52:31,980 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 55 mSDsluCounter, 2969 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 3435 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:31,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 3435 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 19:52:31,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2025-03-03 19:52:32,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1007. [2025-03-03 19:52:32,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 691 states have (on average 1.3994211287988423) internal successors, (967), 694 states have internal predecessors, (967), 303 states have call successors, (303), 12 states have call predecessors, (303), 12 states have return successors, (303), 300 states have call predecessors, (303), 303 states have call successors, (303) [2025-03-03 19:52:32,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1573 transitions. [2025-03-03 19:52:32,044 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1573 transitions. Word has length 667 [2025-03-03 19:52:32,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:32,045 INFO L471 AbstractCegarLoop]: Abstraction has 1007 states and 1573 transitions. [2025-03-03 19:52:32,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:32,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1573 transitions. [2025-03-03 19:52:32,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2025-03-03 19:52:32,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:32,048 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:52:32,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 19:52:32,049 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:32,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:32,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1039777484, now seen corresponding path program 1 times [2025-03-03 19:52:32,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:32,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155653969] [2025-03-03 19:52:32,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:32,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:32,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-03-03 19:52:32,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-03-03 19:52:32,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:32,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:34,668 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-03-03 19:52:34,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:34,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155653969] [2025-03-03 19:52:34,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155653969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:34,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:52:34,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 19:52:34,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108808072] [2025-03-03 19:52:34,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:34,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 19:52:34,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:34,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 19:52:34,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-03 19:52:34,672 INFO L87 Difference]: Start difference. First operand 1007 states and 1573 transitions. Second operand has 13 states, 13 states have (on average 9.615384615384615) internal successors, (125), 13 states have internal predecessors, (125), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:36,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:36,674 INFO L93 Difference]: Finished difference Result 1892 states and 2881 transitions. [2025-03-03 19:52:36,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 19:52:36,675 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.615384615384615) internal successors, (125), 13 states have internal predecessors, (125), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 667 [2025-03-03 19:52:36,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:36,685 INFO L225 Difference]: With dead ends: 1892 [2025-03-03 19:52:36,685 INFO L226 Difference]: Without dead ends: 1179 [2025-03-03 19:52:36,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2025-03-03 19:52:36,688 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 534 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1938 SdHoareTripleChecker+Invalid, 2004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:36,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1938 Invalid, 2004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 19:52:36,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2025-03-03 19:52:36,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1015. [2025-03-03 19:52:36,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 699 states have (on average 1.4005722460658083) internal successors, (979), 702 states have internal predecessors, (979), 303 states have call successors, (303), 12 states have call predecessors, (303), 12 states have return successors, (303), 300 states have call predecessors, (303), 303 states have call successors, (303) [2025-03-03 19:52:36,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1585 transitions. [2025-03-03 19:52:36,795 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1585 transitions. Word has length 667 [2025-03-03 19:52:36,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:36,796 INFO L471 AbstractCegarLoop]: Abstraction has 1015 states and 1585 transitions. [2025-03-03 19:52:36,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.615384615384615) internal successors, (125), 13 states have internal predecessors, (125), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:36,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1585 transitions. [2025-03-03 19:52:36,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2025-03-03 19:52:36,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:36,802 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:52:36,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 19:52:36,802 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:36,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:36,803 INFO L85 PathProgramCache]: Analyzing trace with hash 534218859, now seen corresponding path program 1 times [2025-03-03 19:52:36,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:36,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714032618] [2025-03-03 19:52:36,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:36,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:36,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-03-03 19:52:36,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-03-03 19:52:36,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:36,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-03-03 19:52:39,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:39,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714032618] [2025-03-03 19:52:39,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714032618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:39,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:52:39,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 19:52:39,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460414227] [2025-03-03 19:52:39,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:39,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 19:52:39,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:39,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 19:52:39,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:52:39,473 INFO L87 Difference]: Start difference. First operand 1015 states and 1585 transitions. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:40,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:40,547 INFO L93 Difference]: Finished difference Result 1884 states and 2873 transitions. [2025-03-03 19:52:40,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 19:52:40,548 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 667 [2025-03-03 19:52:40,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:40,553 INFO L225 Difference]: With dead ends: 1884 [2025-03-03 19:52:40,553 INFO L226 Difference]: Without dead ends: 1163 [2025-03-03 19:52:40,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-03-03 19:52:40,555 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 116 mSDsluCounter, 3410 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 3882 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:40,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 3882 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 19:52:40,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2025-03-03 19:52:40,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1007. [2025-03-03 19:52:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 691 states have (on average 1.3994211287988423) internal successors, (967), 694 states have internal predecessors, (967), 303 states have call successors, (303), 12 states have call predecessors, (303), 12 states have return successors, (303), 300 states have call predecessors, (303), 303 states have call successors, (303) [2025-03-03 19:52:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1573 transitions. [2025-03-03 19:52:40,634 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1573 transitions. Word has length 667 [2025-03-03 19:52:40,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:40,635 INFO L471 AbstractCegarLoop]: Abstraction has 1007 states and 1573 transitions. [2025-03-03 19:52:40,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 19:52:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1573 transitions. [2025-03-03 19:52:40,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2025-03-03 19:52:40,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:40,639 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:52:40,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 19:52:40,639 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:40,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:40,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1394947730, now seen corresponding path program 1 times [2025-03-03 19:52:40,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:40,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564237353] [2025-03-03 19:52:40,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:40,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:40,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-03-03 19:52:40,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-03-03 19:52:40,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:40,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:52:40,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [978973337] [2025-03-03 19:52:40,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:40,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:52:40,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:52:40,811 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:52:40,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 19:52:40,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-03-03 19:52:41,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-03-03 19:52:41,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:41,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:41,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 19:52:41,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:52:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 14159 proven. 297 refuted. 0 times theorem prover too weak. 9088 trivial. 0 not checked. [2025-03-03 19:52:42,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:52:51,463 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 345 proven. 300 refuted. 0 times theorem prover too weak. 22899 trivial. 0 not checked. [2025-03-03 19:52:51,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:51,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564237353] [2025-03-03 19:52:51,464 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 19:52:51,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978973337] [2025-03-03 19:52:51,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978973337] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:52:51,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 19:52:51,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2025-03-03 19:52:51,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701359158] [2025-03-03 19:52:51,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 19:52:51,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 19:52:51,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:51,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 19:52:51,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=275, Unknown=1, NotChecked=0, Total=380 [2025-03-03 19:52:51,468 INFO L87 Difference]: Start difference. First operand 1007 states and 1573 transitions. Second operand has 20 states, 20 states have (on average 9.25) internal successors, (185), 20 states have internal predecessors, (185), 5 states have call successors, (166), 3 states have call predecessors, (166), 7 states have return successors, (167), 5 states have call predecessors, (167), 5 states have call successors, (167) [2025-03-03 19:52:54,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-03 19:52:58,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-03 19:53:06,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-03 19:53:10,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-03 19:53:12,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-03 19:53:14,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-03 19:53:18,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1]