./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-38.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-500_file-38.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 69a106a7fe4e968f8159960741f93feca1d4d684a8ecc183635291d7b7b9ab5b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:07:40,103 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:07:40,159 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:07:40,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:07:40,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:07:40,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:07:40,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:07:40,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:07:40,188 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:07:40,188 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:07:40,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:07:40,188 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:07:40,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:07:40,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:07:40,189 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:07:40,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:07:40,189 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:07:40,190 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:07:40,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:07:40,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:07:40,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:07:40,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:07:40,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:07:40,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:07:40,190 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:07:40,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:07:40,190 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:07:40,190 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:07:40,190 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:07:40,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:07:40,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:07:40,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:07:40,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:07:40,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:07:40,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:07:40,190 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:07:40,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:07:40,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:07:40,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:07:40,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:07:40,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:07:40,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:07:40,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:07:40,191 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 -> 69a106a7fe4e968f8159960741f93feca1d4d684a8ecc183635291d7b7b9ab5b [2025-03-03 20:07:40,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:07:40,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:07:40,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:07:40,421 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:07:40,421 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:07:40,422 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-500_file-38.i [2025-03-03 20:07:41,597 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30a1aee04/056b0cfc9d634bbfb626447295dcfdaa/FLAG8be5ab4e6 [2025-03-03 20:07:41,871 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:07:41,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-38.i [2025-03-03 20:07:41,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30a1aee04/056b0cfc9d634bbfb626447295dcfdaa/FLAG8be5ab4e6 [2025-03-03 20:07:42,138 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30a1aee04/056b0cfc9d634bbfb626447295dcfdaa [2025-03-03 20:07:42,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:07:42,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:07:42,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:07:42,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:07:42,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:07:42,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:07:42" (1/1) ... [2025-03-03 20:07:42,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e65fa1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:42, skipping insertion in model container [2025-03-03 20:07:42,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:07:42" (1/1) ... [2025-03-03 20:07:42,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:07:42,297 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-500_file-38.i[916,929] [2025-03-03 20:07:42,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:07:42,472 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:07:42,479 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-500_file-38.i[916,929] [2025-03-03 20:07:42,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:07:42,580 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:07:42,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:42 WrapperNode [2025-03-03 20:07:42,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:07:42,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:07:42,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:07:42,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:07:42,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:42" (1/1) ... [2025-03-03 20:07:42,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:42" (1/1) ... [2025-03-03 20:07:42,685 INFO L138 Inliner]: procedures = 26, calls = 122, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 861 [2025-03-03 20:07:42,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:07:42,686 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:07:42,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:07:42,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:07:42,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:42" (1/1) ... [2025-03-03 20:07:42,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:42" (1/1) ... [2025-03-03 20:07:42,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:42" (1/1) ... [2025-03-03 20:07:42,739 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 20:07:42,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:42" (1/1) ... [2025-03-03 20:07:42,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:42" (1/1) ... [2025-03-03 20:07:42,775 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:42" (1/1) ... [2025-03-03 20:07:42,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:42" (1/1) ... [2025-03-03 20:07:42,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:42" (1/1) ... [2025-03-03 20:07:42,800 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:42" (1/1) ... [2025-03-03 20:07:42,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:07:42,814 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:07:42,815 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:07:42,815 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:07:42,815 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:42" (1/1) ... [2025-03-03 20:07:42,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:07:42,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:07:42,841 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 20:07:42,844 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 20:07:42,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:07:42,862 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:07:42,862 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:07:42,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:07:42,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:07:42,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:07:42,994 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:07:42,997 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:07:43,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L722: havoc property_#t~bitwise85#1;havoc property_#t~short86#1; [2025-03-03 20:07:43,984 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-03 20:07:43,984 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:07:44,017 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:07:44,017 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-03 20:07:44,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:07:44 BoogieIcfgContainer [2025-03-03 20:07:44,018 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:07:44,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:07:44,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:07:44,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:07:44,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:07:42" (1/3) ... [2025-03-03 20:07:44,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1f7c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:07:44, skipping insertion in model container [2025-03-03 20:07:44,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:42" (2/3) ... [2025-03-03 20:07:44,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1f7c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:07:44, skipping insertion in model container [2025-03-03 20:07:44,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:07:44" (3/3) ... [2025-03-03 20:07:44,028 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-38.i [2025-03-03 20:07:44,038 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:07:44,042 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-38.i that has 2 procedures, 357 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:07:44,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:07:44,109 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;@568d44a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:07:44,110 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:07:44,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 357 states, 245 states have (on average 1.5714285714285714) internal successors, (385), 246 states have internal predecessors, (385), 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 20:07:44,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2025-03-03 20:07:44,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:44,144 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:44,145 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:44,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:44,149 INFO L85 PathProgramCache]: Analyzing trace with hash -2034774877, now seen corresponding path program 1 times [2025-03-03 20:07:44,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:44,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943547325] [2025-03-03 20:07:44,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:44,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:44,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 697 statements into 1 equivalence classes. [2025-03-03 20:07:44,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 697 of 697 statements. [2025-03-03 20:07:44,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:44,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:45,408 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 20:07:45,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:45,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943547325] [2025-03-03 20:07:45,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943547325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:45,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:45,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:45,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276199559] [2025-03-03 20:07:45,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:45,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:45,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:45,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:45,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:45,442 INFO L87 Difference]: Start difference. First operand has 357 states, 245 states have (on average 1.5714285714285714) internal successors, (385), 246 states have internal predecessors, (385), 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 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 20:07:45,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:45,639 INFO L93 Difference]: Finished difference Result 1058 states and 2016 transitions. [2025-03-03 20:07:45,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:45,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 697 [2025-03-03 20:07:45,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:45,658 INFO L225 Difference]: With dead ends: 1058 [2025-03-03 20:07:45,658 INFO L226 Difference]: Without dead ends: 704 [2025-03-03 20:07:45,665 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 20:07:45,670 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 546 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:45,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1139 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:07:45,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2025-03-03 20:07:45,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 702. [2025-03-03 20:07:45,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 481 states have (on average 1.5613305613305613) internal successors, (751), 481 states have internal predecessors, (751), 218 states have call successors, (218), 2 states have call predecessors, (218), 2 states have return successors, (218), 218 states have call predecessors, (218), 218 states have call successors, (218) [2025-03-03 20:07:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1187 transitions. [2025-03-03 20:07:45,850 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1187 transitions. Word has length 697 [2025-03-03 20:07:45,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:45,854 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1187 transitions. [2025-03-03 20:07:45,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 20:07:45,855 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1187 transitions. [2025-03-03 20:07:45,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2025-03-03 20:07:45,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:45,871 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:45,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 20:07:45,872 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:45,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:45,873 INFO L85 PathProgramCache]: Analyzing trace with hash -2023458750, now seen corresponding path program 1 times [2025-03-03 20:07:45,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:45,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879938948] [2025-03-03 20:07:45,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:45,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:45,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 697 statements into 1 equivalence classes. [2025-03-03 20:07:46,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 697 of 697 statements. [2025-03-03 20:07:46,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:46,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:46,962 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 20:07:46,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:46,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879938948] [2025-03-03 20:07:46,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879938948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:46,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:46,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:46,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009826733] [2025-03-03 20:07:46,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:46,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:46,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:46,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:46,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:46,967 INFO L87 Difference]: Start difference. First operand 702 states and 1187 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 20:07:47,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:47,105 INFO L93 Difference]: Finished difference Result 1861 states and 3165 transitions. [2025-03-03 20:07:47,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:47,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 697 [2025-03-03 20:07:47,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:47,119 INFO L225 Difference]: With dead ends: 1861 [2025-03-03 20:07:47,119 INFO L226 Difference]: Without dead ends: 1162 [2025-03-03 20:07:47,123 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 20:07:47,124 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 361 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:47,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1153 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:07:47,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2025-03-03 20:07:47,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1160. [2025-03-03 20:07:47,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 829 states have (on average 1.5983112183353438) internal successors, (1325), 829 states have internal predecessors, (1325), 327 states have call successors, (327), 3 states have call predecessors, (327), 3 states have return successors, (327), 327 states have call predecessors, (327), 327 states have call successors, (327) [2025-03-03 20:07:47,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1979 transitions. [2025-03-03 20:07:47,272 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1979 transitions. Word has length 697 [2025-03-03 20:07:47,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:47,274 INFO L471 AbstractCegarLoop]: Abstraction has 1160 states and 1979 transitions. [2025-03-03 20:07:47,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 20:07:47,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1979 transitions. [2025-03-03 20:07:47,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2025-03-03 20:07:47,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:47,282 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:47,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:07:47,282 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:47,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:47,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1061844733, now seen corresponding path program 1 times [2025-03-03 20:07:47,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:47,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621363808] [2025-03-03 20:07:47,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:47,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:47,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 697 statements into 1 equivalence classes. [2025-03-03 20:07:47,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 697 of 697 statements. [2025-03-03 20:07:47,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:47,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:48,051 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 20:07:48,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:48,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621363808] [2025-03-03 20:07:48,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621363808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:48,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:48,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:48,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335069167] [2025-03-03 20:07:48,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:48,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:48,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:48,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:48,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:48,054 INFO L87 Difference]: Start difference. First operand 1160 states and 1979 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 20:07:48,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:48,216 INFO L93 Difference]: Finished difference Result 3474 states and 5931 transitions. [2025-03-03 20:07:48,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:48,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 697 [2025-03-03 20:07:48,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:48,230 INFO L225 Difference]: With dead ends: 3474 [2025-03-03 20:07:48,231 INFO L226 Difference]: Without dead ends: 2317 [2025-03-03 20:07:48,235 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 20:07:48,235 INFO L435 NwaCegarLoop]: 1103 mSDtfsCounter, 590 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:48,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1675 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:07:48,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2025-03-03 20:07:48,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2315. [2025-03-03 20:07:48,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2315 states, 1654 states have (on average 1.594316807738815) internal successors, (2637), 1654 states have internal predecessors, (2637), 654 states have call successors, (654), 6 states have call predecessors, (654), 6 states have return successors, (654), 654 states have call predecessors, (654), 654 states have call successors, (654) [2025-03-03 20:07:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 3945 transitions. [2025-03-03 20:07:48,454 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 3945 transitions. Word has length 697 [2025-03-03 20:07:48,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:48,456 INFO L471 AbstractCegarLoop]: Abstraction has 2315 states and 3945 transitions. [2025-03-03 20:07:48,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 20:07:48,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3945 transitions. [2025-03-03 20:07:48,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2025-03-03 20:07:48,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:48,463 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:48,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:07:48,464 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:48,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:48,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1847566173, now seen corresponding path program 1 times [2025-03-03 20:07:48,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:48,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781999011] [2025-03-03 20:07:48,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:48,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:48,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 697 statements into 1 equivalence classes. [2025-03-03 20:07:48,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 697 of 697 statements. [2025-03-03 20:07:48,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:48,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:49,541 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 20:07:49,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:49,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781999011] [2025-03-03 20:07:49,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781999011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:49,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:49,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:07:49,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201608063] [2025-03-03 20:07:49,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:49,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:07:49,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:49,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:07:49,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:07:49,544 INFO L87 Difference]: Start difference. First operand 2315 states and 3945 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 20:07:50,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:50,337 INFO L93 Difference]: Finished difference Result 9221 states and 15717 transitions. [2025-03-03 20:07:50,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:07:50,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 697 [2025-03-03 20:07:50,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:50,378 INFO L225 Difference]: With dead ends: 9221 [2025-03-03 20:07:50,378 INFO L226 Difference]: Without dead ends: 6909 [2025-03-03 20:07:50,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:07:50,389 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 1594 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 2290 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:50,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1594 Valid, 2290 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:07:50,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6909 states. [2025-03-03 20:07:50,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6909 to 4625. [2025-03-03 20:07:50,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4625 states, 3304 states have (on average 1.5932203389830508) internal successors, (5264), 3304 states have internal predecessors, (5264), 1308 states have call successors, (1308), 12 states have call predecessors, (1308), 12 states have return successors, (1308), 1308 states have call predecessors, (1308), 1308 states have call successors, (1308) [2025-03-03 20:07:50,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 7880 transitions. [2025-03-03 20:07:50,867 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 7880 transitions. Word has length 697 [2025-03-03 20:07:50,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:50,869 INFO L471 AbstractCegarLoop]: Abstraction has 4625 states and 7880 transitions. [2025-03-03 20:07:50,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 20:07:50,870 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 7880 transitions. [2025-03-03 20:07:50,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2025-03-03 20:07:50,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:50,876 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:50,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:07:50,876 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:50,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:50,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1920951624, now seen corresponding path program 1 times [2025-03-03 20:07:50,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:50,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041477430] [2025-03-03 20:07:50,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:50,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:50,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-03-03 20:07:51,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-03-03 20:07:51,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:51,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:51,761 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 20:07:51,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:51,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041477430] [2025-03-03 20:07:51,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041477430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:51,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:51,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:07:51,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886583051] [2025-03-03 20:07:51,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:51,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:07:51,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:51,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:07:51,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:07:51,767 INFO L87 Difference]: Start difference. First operand 4625 states and 7880 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (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 20:07:52,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:52,531 INFO L93 Difference]: Finished difference Result 12313 states and 21002 transitions. [2025-03-03 20:07:52,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:07:52,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 698 [2025-03-03 20:07:52,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:52,570 INFO L225 Difference]: With dead ends: 12313 [2025-03-03 20:07:52,570 INFO L226 Difference]: Without dead ends: 7691 [2025-03-03 20:07:52,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:07:52,583 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 1015 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:52,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 1008 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:07:52,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7691 states. [2025-03-03 20:07:53,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7691 to 6117. [2025-03-03 20:07:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6117 states, 4784 states have (on average 1.6513377926421404) internal successors, (7900), 4784 states have internal predecessors, (7900), 1308 states have call successors, (1308), 24 states have call predecessors, (1308), 24 states have return successors, (1308), 1308 states have call predecessors, (1308), 1308 states have call successors, (1308) [2025-03-03 20:07:53,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6117 states to 6117 states and 10516 transitions. [2025-03-03 20:07:53,075 INFO L78 Accepts]: Start accepts. Automaton has 6117 states and 10516 transitions. Word has length 698 [2025-03-03 20:07:53,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:53,077 INFO L471 AbstractCegarLoop]: Abstraction has 6117 states and 10516 transitions. [2025-03-03 20:07:53,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (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 20:07:53,077 INFO L276 IsEmpty]: Start isEmpty. Operand 6117 states and 10516 transitions. [2025-03-03 20:07:53,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2025-03-03 20:07:53,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:53,083 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:53,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:07:53,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:53,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:53,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1936006169, now seen corresponding path program 1 times [2025-03-03 20:07:53,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:53,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745530888] [2025-03-03 20:07:53,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:53,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:53,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-03-03 20:07:53,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-03-03 20:07:53,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:53,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:53,991 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 20:07:53,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:53,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745530888] [2025-03-03 20:07:53,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745530888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:53,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:53,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:07:53,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851872372] [2025-03-03 20:07:53,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:53,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:07:53,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:53,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:07:53,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:07:53,998 INFO L87 Difference]: Start difference. First operand 6117 states and 10516 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 20:07:54,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:54,782 INFO L93 Difference]: Finished difference Result 15861 states and 27350 transitions. [2025-03-03 20:07:54,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:07:54,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 698 [2025-03-03 20:07:54,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:54,844 INFO L225 Difference]: With dead ends: 15861 [2025-03-03 20:07:54,845 INFO L226 Difference]: Without dead ends: 9747 [2025-03-03 20:07:54,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:07:54,865 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 1126 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:54,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 1264 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:07:54,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9747 states. [2025-03-03 20:07:55,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9747 to 8461. [2025-03-03 20:07:55,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8461 states, 7128 states have (on average 1.6997755331088664) internal successors, (12116), 7128 states have internal predecessors, (12116), 1308 states have call successors, (1308), 24 states have call predecessors, (1308), 24 states have return successors, (1308), 1308 states have call predecessors, (1308), 1308 states have call successors, (1308) [2025-03-03 20:07:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 14732 transitions. [2025-03-03 20:07:55,360 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 14732 transitions. Word has length 698 [2025-03-03 20:07:55,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:55,361 INFO L471 AbstractCegarLoop]: Abstraction has 8461 states and 14732 transitions. [2025-03-03 20:07:55,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 20:07:55,362 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 14732 transitions. [2025-03-03 20:07:55,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2025-03-03 20:07:55,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:55,367 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:55,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:07:55,367 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:55,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:55,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1774488135, now seen corresponding path program 1 times [2025-03-03 20:07:55,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:55,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899600959] [2025-03-03 20:07:55,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:55,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:55,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-03-03 20:07:55,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-03-03 20:07:55,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:55,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:57,776 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 20:07:57,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:57,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899600959] [2025-03-03 20:07:57,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899600959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:57,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:57,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 20:07:57,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439155568] [2025-03-03 20:07:57,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:57,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 20:07:57,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:57,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 20:07:57,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:07:57,779 INFO L87 Difference]: Start difference. First operand 8461 states and 14732 transitions. Second operand has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 20:08:02,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:02,064 INFO L93 Difference]: Finished difference Result 61731 states and 108862 transitions. [2025-03-03 20:08:02,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 20:08:02,065 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 698 [2025-03-03 20:08:02,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:02,204 INFO L225 Difference]: With dead ends: 61731 [2025-03-03 20:08:02,204 INFO L226 Difference]: Without dead ends: 53273 [2025-03-03 20:08:02,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:08:02,255 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 4667 mSDsluCounter, 3846 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 706 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4667 SdHoareTripleChecker+Valid, 4439 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 706 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:02,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4667 Valid, 4439 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [706 Valid, 1598 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-03 20:08:02,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53273 states. [2025-03-03 20:08:03,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53273 to 15517. [2025-03-03 20:08:03,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15517 states, 13872 states have (on average 1.733275663206459) internal successors, (24044), 13884 states have internal predecessors, (24044), 1608 states have call successors, (1608), 36 states have call predecessors, (1608), 36 states have return successors, (1608), 1596 states have call predecessors, (1608), 1608 states have call successors, (1608) [2025-03-03 20:08:03,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15517 states to 15517 states and 27260 transitions. [2025-03-03 20:08:03,093 INFO L78 Accepts]: Start accepts. Automaton has 15517 states and 27260 transitions. Word has length 698 [2025-03-03 20:08:03,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:03,095 INFO L471 AbstractCegarLoop]: Abstraction has 15517 states and 27260 transitions. [2025-03-03 20:08:03,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 20:08:03,095 INFO L276 IsEmpty]: Start isEmpty. Operand 15517 states and 27260 transitions. [2025-03-03 20:08:03,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2025-03-03 20:08:03,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:03,103 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:03,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:08:03,103 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:03,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:03,104 INFO L85 PathProgramCache]: Analyzing trace with hash 479320776, now seen corresponding path program 1 times [2025-03-03 20:08:03,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:03,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642602594] [2025-03-03 20:08:03,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:03,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:03,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-03-03 20:08:03,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-03-03 20:08:03,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:03,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:03,892 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 20:08:03,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:03,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642602594] [2025-03-03 20:08:03,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642602594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:03,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:03,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:08:03,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933279105] [2025-03-03 20:08:03,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:03,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:08:03,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:03,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:08:03,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:08:03,894 INFO L87 Difference]: Start difference. First operand 15517 states and 27260 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 20:08:05,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:05,077 INFO L93 Difference]: Finished difference Result 46979 states and 82459 transitions. [2025-03-03 20:08:05,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:08:05,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 698 [2025-03-03 20:08:05,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:05,161 INFO L225 Difference]: With dead ends: 46979 [2025-03-03 20:08:05,161 INFO L226 Difference]: Without dead ends: 31465 [2025-03-03 20:08:05,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:08:05,196 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 619 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 2093 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:05,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 2093 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:08:05,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31465 states. [2025-03-03 20:08:06,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31465 to 31053. [2025-03-03 20:08:06,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31053 states, 27764 states have (on average 1.732747442731595) internal successors, (48108), 27788 states have internal predecessors, (48108), 3216 states have call successors, (3216), 72 states have call predecessors, (3216), 72 states have return successors, (3216), 3192 states have call predecessors, (3216), 3216 states have call successors, (3216) [2025-03-03 20:08:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31053 states to 31053 states and 54540 transitions. [2025-03-03 20:08:06,732 INFO L78 Accepts]: Start accepts. Automaton has 31053 states and 54540 transitions. Word has length 698 [2025-03-03 20:08:06,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:06,734 INFO L471 AbstractCegarLoop]: Abstraction has 31053 states and 54540 transitions. [2025-03-03 20:08:06,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 20:08:06,735 INFO L276 IsEmpty]: Start isEmpty. Operand 31053 states and 54540 transitions. [2025-03-03 20:08:06,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2025-03-03 20:08:06,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:06,741 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:06,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:08:06,741 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:06,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:06,742 INFO L85 PathProgramCache]: Analyzing trace with hash -26237849, now seen corresponding path program 1 times [2025-03-03 20:08:06,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:06,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446092194] [2025-03-03 20:08:06,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:06,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:06,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-03-03 20:08:06,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-03-03 20:08:06,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:06,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:07,296 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 23220 trivial. 0 not checked. [2025-03-03 20:08:07,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:07,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446092194] [2025-03-03 20:08:07,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446092194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:08:07,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596199324] [2025-03-03 20:08:07,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:07,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:07,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:07,300 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 20:08:07,301 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 20:08:07,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-03-03 20:08:07,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-03-03 20:08:07,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:07,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:07,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 1582 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 20:08:07,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:08:08,315 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 11124 proven. 120 refuted. 0 times theorem prover too weak. 12300 trivial. 0 not checked. [2025-03-03 20:08:08,315 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:08:08,801 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 204 proven. 120 refuted. 0 times theorem prover too weak. 23220 trivial. 0 not checked. [2025-03-03 20:08:08,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596199324] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:08:08,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:08:08,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 10 [2025-03-03 20:08:08,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170411468] [2025-03-03 20:08:08,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:08:08,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:08:08,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:08,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:08:08,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:08:08,805 INFO L87 Difference]: Start difference. First operand 31053 states and 54540 transitions. Second operand has 10 states, 10 states have (on average 38.4) internal successors, (384), 10 states have internal predecessors, (384), 4 states have call successors, (257), 2 states have call predecessors, (257), 4 states have return successors, (259), 4 states have call predecessors, (259), 4 states have call successors, (259) [2025-03-03 20:08:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:10,581 INFO L93 Difference]: Finished difference Result 49273 states and 86346 transitions. [2025-03-03 20:08:10,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 20:08:10,582 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 38.4) internal successors, (384), 10 states have internal predecessors, (384), 4 states have call successors, (257), 2 states have call predecessors, (257), 4 states have return successors, (259), 4 states have call predecessors, (259), 4 states have call successors, (259) Word has length 698 [2025-03-03 20:08:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:10,635 INFO L225 Difference]: With dead ends: 49273 [2025-03-03 20:08:10,635 INFO L226 Difference]: Without dead ends: 18223 [2025-03-03 20:08:10,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1419 GetRequests, 1393 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=538, Unknown=0, NotChecked=0, Total=756 [2025-03-03 20:08:10,674 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 2270 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 753 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2271 SdHoareTripleChecker+Valid, 2161 SdHoareTripleChecker+Invalid, 2164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 753 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:10,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2271 Valid, 2161 Invalid, 2164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [753 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 20:08:10,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18223 states. [2025-03-03 20:08:11,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18223 to 16335. [2025-03-03 20:08:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16335 states, 14540 states have (on average 1.7020632737276478) internal successors, (24748), 14552 states have internal predecessors, (24748), 1717 states have call successors, (1717), 77 states have call predecessors, (1717), 77 states have return successors, (1717), 1705 states have call predecessors, (1717), 1717 states have call successors, (1717) [2025-03-03 20:08:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16335 states to 16335 states and 28182 transitions. [2025-03-03 20:08:11,687 INFO L78 Accepts]: Start accepts. Automaton has 16335 states and 28182 transitions. Word has length 698 [2025-03-03 20:08:11,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:11,688 INFO L471 AbstractCegarLoop]: Abstraction has 16335 states and 28182 transitions. [2025-03-03 20:08:11,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 38.4) internal successors, (384), 10 states have internal predecessors, (384), 4 states have call successors, (257), 2 states have call predecessors, (257), 4 states have return successors, (259), 4 states have call predecessors, (259), 4 states have call successors, (259) [2025-03-03 20:08:11,689 INFO L276 IsEmpty]: Start isEmpty. Operand 16335 states and 28182 transitions. [2025-03-03 20:08:11,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2025-03-03 20:08:11,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:11,695 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:11,707 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 20:08:11,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:11,901 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:11,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:11,902 INFO L85 PathProgramCache]: Analyzing trace with hash 979968141, now seen corresponding path program 1 times [2025-03-03 20:08:11,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:11,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766801767] [2025-03-03 20:08:11,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:11,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:11,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-03-03 20:08:11,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-03-03 20:08:11,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:11,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:12,268 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 20:08:12,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:12,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766801767] [2025-03-03 20:08:12,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766801767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:12,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:12,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:08:12,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796307053] [2025-03-03 20:08:12,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:12,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:08:12,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:12,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:08:12,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:08:12,271 INFO L87 Difference]: Start difference. First operand 16335 states and 28182 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 20:08:13,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:13,241 INFO L93 Difference]: Finished difference Result 26147 states and 45080 transitions. [2025-03-03 20:08:13,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:08:13,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 699 [2025-03-03 20:08:13,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:13,292 INFO L225 Difference]: With dead ends: 26147 [2025-03-03 20:08:13,292 INFO L226 Difference]: Without dead ends: 16387 [2025-03-03 20:08:13,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:08:13,313 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 377 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:13,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1175 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:08:13,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16387 states. [2025-03-03 20:08:14,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16387 to 16387. [2025-03-03 20:08:14,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16387 states, 14579 states have (on average 1.698127443583236) internal successors, (24757), 14591 states have internal predecessors, (24757), 1717 states have call successors, (1717), 90 states have call predecessors, (1717), 90 states have return successors, (1717), 1705 states have call predecessors, (1717), 1717 states have call successors, (1717) [2025-03-03 20:08:14,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16387 states to 16387 states and 28191 transitions. [2025-03-03 20:08:14,157 INFO L78 Accepts]: Start accepts. Automaton has 16387 states and 28191 transitions. Word has length 699 [2025-03-03 20:08:14,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:14,158 INFO L471 AbstractCegarLoop]: Abstraction has 16387 states and 28191 transitions. [2025-03-03 20:08:14,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 20:08:14,158 INFO L276 IsEmpty]: Start isEmpty. Operand 16387 states and 28191 transitions. [2025-03-03 20:08:14,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2025-03-03 20:08:14,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:14,165 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:14,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:08:14,165 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:14,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:14,166 INFO L85 PathProgramCache]: Analyzing trace with hash -950650964, now seen corresponding path program 1 times [2025-03-03 20:08:14,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:14,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455253404] [2025-03-03 20:08:14,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:14,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:14,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-03-03 20:08:14,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-03-03 20:08:14,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:14,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:14,628 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 20:08:14,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:14,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455253404] [2025-03-03 20:08:14,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455253404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:14,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:14,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:08:14,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173138327] [2025-03-03 20:08:14,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:14,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:08:14,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:14,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:08:14,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:08:14,631 INFO L87 Difference]: Start difference. First operand 16387 states and 28191 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 20:08:15,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:15,658 INFO L93 Difference]: Finished difference Result 26437 states and 45286 transitions. [2025-03-03 20:08:15,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:08:15,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 699 [2025-03-03 20:08:15,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:15,701 INFO L225 Difference]: With dead ends: 26437 [2025-03-03 20:08:15,702 INFO L226 Difference]: Without dead ends: 17099 [2025-03-03 20:08:15,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:08:15,721 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 810 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:15,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 1547 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:08:15,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17099 states. [2025-03-03 20:08:16,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17099 to 16451. [2025-03-03 20:08:16,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16451 states, 14639 states have (on average 1.6960857982102602) internal successors, (24829), 14651 states have internal predecessors, (24829), 1717 states have call successors, (1717), 94 states have call predecessors, (1717), 94 states have return successors, (1717), 1705 states have call predecessors, (1717), 1717 states have call successors, (1717) [2025-03-03 20:08:16,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16451 states to 16451 states and 28263 transitions. [2025-03-03 20:08:16,395 INFO L78 Accepts]: Start accepts. Automaton has 16451 states and 28263 transitions. Word has length 699 [2025-03-03 20:08:16,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:16,395 INFO L471 AbstractCegarLoop]: Abstraction has 16451 states and 28263 transitions. [2025-03-03 20:08:16,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 20:08:16,396 INFO L276 IsEmpty]: Start isEmpty. Operand 16451 states and 28263 transitions. [2025-03-03 20:08:16,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2025-03-03 20:08:16,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:16,401 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:16,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:08:16,401 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:16,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:16,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1205387509, now seen corresponding path program 1 times [2025-03-03 20:08:16,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:16,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167926687] [2025-03-03 20:08:16,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:16,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:16,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-03-03 20:08:16,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-03-03 20:08:16,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:16,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:17,208 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 36 proven. 288 refuted. 0 times theorem prover too weak. 23220 trivial. 0 not checked. [2025-03-03 20:08:17,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:17,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167926687] [2025-03-03 20:08:17,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167926687] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:08:17,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001626711] [2025-03-03 20:08:17,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:17,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:17,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:17,211 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 20:08:17,213 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 20:08:17,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-03-03 20:08:17,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-03-03 20:08:17,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:17,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:17,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 1586 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:08:17,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:08:17,695 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 23220 trivial. 0 not checked. [2025-03-03 20:08:17,696 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:08:17,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001626711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:17,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:08:17,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-03 20:08:17,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203106147] [2025-03-03 20:08:17,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:17,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:08:17,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:17,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:08:17,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:08:17,699 INFO L87 Difference]: Start difference. First operand 16451 states and 28263 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (109), 1 states have call predecessors, (109), 2 states have return successors, (109), 2 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 20:08:18,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:18,511 INFO L93 Difference]: Finished difference Result 23913 states and 40999 transitions. [2025-03-03 20:08:18,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:08:18,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (109), 1 states have call predecessors, (109), 2 states have return successors, (109), 2 states have call predecessors, (109), 1 states have call successors, (109) Word has length 699 [2025-03-03 20:08:18,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:18,538 INFO L225 Difference]: With dead ends: 23913 [2025-03-03 20:08:18,538 INFO L226 Difference]: Without dead ends: 9137 [2025-03-03 20:08:18,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 700 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-03 20:08:18,558 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 425 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:18,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1170 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:08:18,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9137 states. [2025-03-03 20:08:18,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9137 to 9067. [2025-03-03 20:08:18,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9067 states, 8098 states have (on average 1.696715238330452) internal successors, (13740), 8104 states have internal predecessors, (13740), 913 states have call successors, (913), 55 states have call predecessors, (913), 55 states have return successors, (913), 907 states have call predecessors, (913), 913 states have call successors, (913) [2025-03-03 20:08:18,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9067 states to 9067 states and 15566 transitions. [2025-03-03 20:08:18,896 INFO L78 Accepts]: Start accepts. Automaton has 9067 states and 15566 transitions. Word has length 699 [2025-03-03 20:08:18,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:18,897 INFO L471 AbstractCegarLoop]: Abstraction has 9067 states and 15566 transitions. [2025-03-03 20:08:18,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (109), 1 states have call predecessors, (109), 2 states have return successors, (109), 2 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 20:08:18,897 INFO L276 IsEmpty]: Start isEmpty. Operand 9067 states and 15566 transitions. [2025-03-03 20:08:18,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2025-03-03 20:08:18,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:18,902 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:18,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 20:08:19,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 20:08:19,103 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:19,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:19,104 INFO L85 PathProgramCache]: Analyzing trace with hash -425223922, now seen corresponding path program 1 times [2025-03-03 20:08:19,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:19,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858783847] [2025-03-03 20:08:19,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:19,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:19,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-03-03 20:08:19,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-03-03 20:08:19,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:19,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:19,765 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 36 proven. 288 refuted. 0 times theorem prover too weak. 23220 trivial. 0 not checked. [2025-03-03 20:08:19,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:19,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858783847] [2025-03-03 20:08:19,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858783847] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:08:19,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622363340] [2025-03-03 20:08:19,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:19,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:19,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:19,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:08:19,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 20:08:19,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-03-03 20:08:20,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-03-03 20:08:20,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:20,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:20,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 1583 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:08:20,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:08:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 11538 proven. 189 refuted. 0 times theorem prover too weak. 11817 trivial. 0 not checked. [2025-03-03 20:08:20,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:08:21,082 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 135 proven. 189 refuted. 0 times theorem prover too weak. 23220 trivial. 0 not checked. [2025-03-03 20:08:21,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622363340] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:08:21,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:08:21,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2025-03-03 20:08:21,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277825513] [2025-03-03 20:08:21,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:08:21,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:08:21,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:21,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:08:21,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:08:21,085 INFO L87 Difference]: Start difference. First operand 9067 states and 15566 transitions. Second operand has 10 states, 10 states have (on average 30.6) internal successors, (306), 10 states have internal predecessors, (306), 4 states have call successors, (281), 2 states have call predecessors, (281), 4 states have return successors, (282), 4 states have call predecessors, (282), 4 states have call successors, (282) [2025-03-03 20:08:22,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:22,319 INFO L93 Difference]: Finished difference Result 16864 states and 28683 transitions. [2025-03-03 20:08:22,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 20:08:22,320 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 30.6) internal successors, (306), 10 states have internal predecessors, (306), 4 states have call successors, (281), 2 states have call predecessors, (281), 4 states have return successors, (282), 4 states have call predecessors, (282), 4 states have call successors, (282) Word has length 699 [2025-03-03 20:08:22,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:22,346 INFO L225 Difference]: With dead ends: 16864 [2025-03-03 20:08:22,347 INFO L226 Difference]: Without dead ends: 8055 [2025-03-03 20:08:22,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1421 GetRequests, 1396 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2025-03-03 20:08:22,360 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 2071 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 733 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2115 SdHoareTripleChecker+Valid, 2015 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 733 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:22,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2115 Valid, 2015 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [733 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 20:08:22,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8055 states. [2025-03-03 20:08:22,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8055 to 6843. [2025-03-03 20:08:22,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6843 states, 5860 states have (on average 1.6390784982935154) internal successors, (9605), 5866 states have internal predecessors, (9605), 913 states have call successors, (913), 69 states have call predecessors, (913), 69 states have return successors, (913), 907 states have call predecessors, (913), 913 states have call successors, (913) [2025-03-03 20:08:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6843 states to 6843 states and 11431 transitions. [2025-03-03 20:08:22,739 INFO L78 Accepts]: Start accepts. Automaton has 6843 states and 11431 transitions. Word has length 699 [2025-03-03 20:08:22,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:22,739 INFO L471 AbstractCegarLoop]: Abstraction has 6843 states and 11431 transitions. [2025-03-03 20:08:22,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 30.6) internal successors, (306), 10 states have internal predecessors, (306), 4 states have call successors, (281), 2 states have call predecessors, (281), 4 states have return successors, (282), 4 states have call predecessors, (282), 4 states have call successors, (282) [2025-03-03 20:08:22,739 INFO L276 IsEmpty]: Start isEmpty. Operand 6843 states and 11431 transitions. [2025-03-03 20:08:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2025-03-03 20:08:22,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:22,744 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:22,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 20:08:22,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:22,944 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:22,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:22,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2034310420, now seen corresponding path program 1 times [2025-03-03 20:08:22,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:22,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605136243] [2025-03-03 20:08:22,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:22,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:22,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes. [2025-03-03 20:08:23,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements. [2025-03-03 20:08:23,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:23,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:23,413 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 20:08:23,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:23,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605136243] [2025-03-03 20:08:23,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605136243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:23,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:23,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:08:23,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988853935] [2025-03-03 20:08:23,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:23,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:08:23,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:23,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:08:23,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:08:23,416 INFO L87 Difference]: Start difference. First operand 6843 states and 11431 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 20:08:24,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:24,074 INFO L93 Difference]: Finished difference Result 21634 states and 36151 transitions. [2025-03-03 20:08:24,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:08:24,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 700 [2025-03-03 20:08:24,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:24,102 INFO L225 Difference]: With dead ends: 21634 [2025-03-03 20:08:24,102 INFO L226 Difference]: Without dead ends: 15962 [2025-03-03 20:08:24,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:08:24,111 INFO L435 NwaCegarLoop]: 1226 mSDtfsCounter, 910 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 2436 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:24,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 2436 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:08:24,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15962 states. [2025-03-03 20:08:24,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15962 to 12633. [2025-03-03 20:08:24,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12633 states, 10773 states have (on average 1.6290726817042607) internal successors, (17550), 10785 states have internal predecessors, (17550), 1717 states have call successors, (1717), 142 states have call predecessors, (1717), 142 states have return successors, (1717), 1705 states have call predecessors, (1717), 1717 states have call successors, (1717) [2025-03-03 20:08:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12633 states to 12633 states and 20984 transitions. [2025-03-03 20:08:24,705 INFO L78 Accepts]: Start accepts. Automaton has 12633 states and 20984 transitions. Word has length 700 [2025-03-03 20:08:24,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:24,705 INFO L471 AbstractCegarLoop]: Abstraction has 12633 states and 20984 transitions. [2025-03-03 20:08:24,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-03-03 20:08:24,706 INFO L276 IsEmpty]: Start isEmpty. Operand 12633 states and 20984 transitions. [2025-03-03 20:08:24,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2025-03-03 20:08:24,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:24,710 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:24,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 20:08:24,710 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:24,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:24,711 INFO L85 PathProgramCache]: Analyzing trace with hash -2049305963, now seen corresponding path program 1 times [2025-03-03 20:08:24,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:24,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151188976] [2025-03-03 20:08:24,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:24,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:24,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes. [2025-03-03 20:08:24,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements. [2025-03-03 20:08:24,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:24,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 114 proven. 210 refuted. 0 times theorem prover too weak. 23220 trivial. 0 not checked. [2025-03-03 20:08:25,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:25,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151188976] [2025-03-03 20:08:25,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151188976] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:08:25,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904558578] [2025-03-03 20:08:25,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:25,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:25,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:25,321 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:08:25,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 20:08:25,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes. [2025-03-03 20:08:25,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements. [2025-03-03 20:08:25,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:25,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:25,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 1581 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:08:25,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:08:26,146 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 11374 proven. 195 refuted. 0 times theorem prover too weak. 11975 trivial. 0 not checked. [2025-03-03 20:08:26,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:08:26,591 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 129 proven. 195 refuted. 0 times theorem prover too weak. 23220 trivial. 0 not checked. [2025-03-03 20:08:26,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904558578] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:08:26,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:08:26,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-03 20:08:26,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708676070] [2025-03-03 20:08:26,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:08:26,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 20:08:26,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:26,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 20:08:26,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:08:26,593 INFO L87 Difference]: Start difference. First operand 12633 states and 20984 transitions. Second operand has 9 states, 9 states have (on average 31.88888888888889) internal successors, (287), 9 states have internal predecessors, (287), 4 states have call successors, (283), 2 states have call predecessors, (283), 4 states have return successors, (284), 4 states have call predecessors, (284), 4 states have call successors, (284) [2025-03-03 20:08:29,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:29,015 INFO L93 Difference]: Finished difference Result 36926 states and 61022 transitions. [2025-03-03 20:08:29,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 20:08:29,016 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 31.88888888888889) internal successors, (287), 9 states have internal predecessors, (287), 4 states have call successors, (283), 2 states have call predecessors, (283), 4 states have return successors, (284), 4 states have call predecessors, (284), 4 states have call successors, (284) Word has length 700 [2025-03-03 20:08:29,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:29,075 INFO L225 Difference]: With dead ends: 36926 [2025-03-03 20:08:29,075 INFO L226 Difference]: Without dead ends: 24608 [2025-03-03 20:08:29,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1419 GetRequests, 1397 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2025-03-03 20:08:29,104 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 981 mSDsluCounter, 1901 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 2540 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:29,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 2540 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 20:08:29,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24608 states. [2025-03-03 20:08:30,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24608 to 17289. [2025-03-03 20:08:30,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17289 states, 13676 states have (on average 1.5424831822170226) internal successors, (21095), 13700 states have internal predecessors, (21095), 3325 states have call successors, (3325), 287 states have call predecessors, (3325), 287 states have return successors, (3325), 3301 states have call predecessors, (3325), 3325 states have call successors, (3325) [2025-03-03 20:08:30,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17289 states to 17289 states and 27745 transitions. [2025-03-03 20:08:30,381 INFO L78 Accepts]: Start accepts. Automaton has 17289 states and 27745 transitions. Word has length 700 [2025-03-03 20:08:30,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:30,382 INFO L471 AbstractCegarLoop]: Abstraction has 17289 states and 27745 transitions. [2025-03-03 20:08:30,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 31.88888888888889) internal successors, (287), 9 states have internal predecessors, (287), 4 states have call successors, (283), 2 states have call predecessors, (283), 4 states have return successors, (284), 4 states have call predecessors, (284), 4 states have call successors, (284) [2025-03-03 20:08:30,382 INFO L276 IsEmpty]: Start isEmpty. Operand 17289 states and 27745 transitions. [2025-03-03 20:08:30,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-03-03 20:08:30,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:30,387 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:30,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 20:08:30,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 20:08:30,588 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:30,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:30,588 INFO L85 PathProgramCache]: Analyzing trace with hash 785773080, now seen corresponding path program 1 times [2025-03-03 20:08:30,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:30,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707586886] [2025-03-03 20:08:30,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:30,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:30,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-03-03 20:08:30,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-03-03 20:08:30,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:30,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:30,748 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 20:08:30,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:30,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707586886] [2025-03-03 20:08:30,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707586886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:30,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:30,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:30,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034790781] [2025-03-03 20:08:30,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:30,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:30,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:30,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:30,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:30,751 INFO L87 Difference]: Start difference. First operand 17289 states and 27745 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 20:08:32,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:32,733 INFO L93 Difference]: Finished difference Result 50057 states and 80309 transitions. [2025-03-03 20:08:32,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:32,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 702 [2025-03-03 20:08:32,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:32,824 INFO L225 Difference]: With dead ends: 50057 [2025-03-03 20:08:32,824 INFO L226 Difference]: Without dead ends: 33639 [2025-03-03 20:08:32,852 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 20:08:32,852 INFO L435 NwaCegarLoop]: 955 mSDtfsCounter, 529 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:32,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 1495 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:08:32,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33639 states. [2025-03-03 20:08:35,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33639 to 33637. [2025-03-03 20:08:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33637 states, 26532 states have (on average 1.5356927483793155) internal successors, (40745), 26580 states have internal predecessors, (40745), 6541 states have call successors, (6541), 563 states have call predecessors, (6541), 563 states have return successors, (6541), 6493 states have call predecessors, (6541), 6541 states have call successors, (6541) [2025-03-03 20:08:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33637 states to 33637 states and 53827 transitions. [2025-03-03 20:08:35,683 INFO L78 Accepts]: Start accepts. Automaton has 33637 states and 53827 transitions. Word has length 702 [2025-03-03 20:08:35,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:35,684 INFO L471 AbstractCegarLoop]: Abstraction has 33637 states and 53827 transitions. [2025-03-03 20:08:35,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 20:08:35,684 INFO L276 IsEmpty]: Start isEmpty. Operand 33637 states and 53827 transitions. [2025-03-03 20:08:35,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2025-03-03 20:08:35,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:35,694 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:35,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 20:08:35,694 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:35,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:35,695 INFO L85 PathProgramCache]: Analyzing trace with hash 332006201, now seen corresponding path program 1 times [2025-03-03 20:08:35,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:35,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475786981] [2025-03-03 20:08:35,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:35,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:35,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 703 statements into 1 equivalence classes. [2025-03-03 20:08:35,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 703 of 703 statements. [2025-03-03 20:08:35,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:35,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:35,961 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 20:08:35,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:35,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475786981] [2025-03-03 20:08:35,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475786981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:35,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:35,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:08:35,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262540044] [2025-03-03 20:08:35,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:35,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:08:35,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:35,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:08:35,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:08:35,965 INFO L87 Difference]: Start difference. First operand 33637 states and 53827 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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 20:08:38,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:38,221 INFO L93 Difference]: Finished difference Result 74055 states and 119332 transitions. [2025-03-03 20:08:38,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:08:38,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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 703 [2025-03-03 20:08:38,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:38,354 INFO L225 Difference]: With dead ends: 74055 [2025-03-03 20:08:38,354 INFO L226 Difference]: Without dead ends: 33637 [2025-03-03 20:08:38,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:08:38,429 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 158 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:38,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1118 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:08:38,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33637 states. [2025-03-03 20:08:40,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33637 to 33637. [2025-03-03 20:08:40,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33637 states, 26532 states have (on average 1.5292100105532942) internal successors, (40573), 26580 states have internal predecessors, (40573), 6541 states have call successors, (6541), 563 states have call predecessors, (6541), 563 states have return successors, (6541), 6493 states have call predecessors, (6541), 6541 states have call successors, (6541) [2025-03-03 20:08:41,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33637 states to 33637 states and 53655 transitions. [2025-03-03 20:08:41,043 INFO L78 Accepts]: Start accepts. Automaton has 33637 states and 53655 transitions. Word has length 703 [2025-03-03 20:08:41,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:41,044 INFO L471 AbstractCegarLoop]: Abstraction has 33637 states and 53655 transitions. [2025-03-03 20:08:41,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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 20:08:41,044 INFO L276 IsEmpty]: Start isEmpty. Operand 33637 states and 53655 transitions. [2025-03-03 20:08:41,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2025-03-03 20:08:41,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:41,050 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:41,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 20:08:41,050 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:41,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:41,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1636399930, now seen corresponding path program 1 times [2025-03-03 20:08:41,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:41,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994273620] [2025-03-03 20:08:41,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:41,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:41,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 703 statements into 1 equivalence classes. [2025-03-03 20:08:41,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 703 of 703 statements. [2025-03-03 20:08:41,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:41,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:41,332 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 20:08:41,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:41,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994273620] [2025-03-03 20:08:41,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994273620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:41,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:41,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:08:41,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284815299] [2025-03-03 20:08:41,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:41,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:08:41,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:41,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:08:41,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:08:41,336 INFO L87 Difference]: Start difference. First operand 33637 states and 53655 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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 20:08:44,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:44,600 INFO L93 Difference]: Finished difference Result 66087 states and 105408 transitions. [2025-03-03 20:08:44,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:08:44,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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 703 [2025-03-03 20:08:44,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:44,704 INFO L225 Difference]: With dead ends: 66087 [2025-03-03 20:08:44,704 INFO L226 Difference]: Without dead ends: 33637 [2025-03-03 20:08:44,753 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 20:08:44,753 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 361 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:44,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1292 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:08:44,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33637 states. [2025-03-03 20:08:47,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33637 to 33637. [2025-03-03 20:08:47,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33637 states, 26532 states have (on average 1.5264963063470527) internal successors, (40501), 26580 states have internal predecessors, (40501), 6541 states have call successors, (6541), 563 states have call predecessors, (6541), 563 states have return successors, (6541), 6493 states have call predecessors, (6541), 6541 states have call successors, (6541) [2025-03-03 20:08:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33637 states to 33637 states and 53583 transitions. [2025-03-03 20:08:47,339 INFO L78 Accepts]: Start accepts. Automaton has 33637 states and 53583 transitions. Word has length 703 [2025-03-03 20:08:47,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:47,340 INFO L471 AbstractCegarLoop]: Abstraction has 33637 states and 53583 transitions. [2025-03-03 20:08:47,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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 20:08:47,340 INFO L276 IsEmpty]: Start isEmpty. Operand 33637 states and 53583 transitions. [2025-03-03 20:08:47,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2025-03-03 20:08:47,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:47,346 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:47,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 20:08:47,347 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:47,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:47,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1737311897, now seen corresponding path program 1 times [2025-03-03 20:08:47,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:47,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711446152] [2025-03-03 20:08:47,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:47,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:47,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 703 statements into 1 equivalence classes. [2025-03-03 20:08:47,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 703 of 703 statements. [2025-03-03 20:08:47,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:47,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 201 proven. 123 refuted. 0 times theorem prover too weak. 23220 trivial. 0 not checked. [2025-03-03 20:08:47,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:47,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711446152] [2025-03-03 20:08:47,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711446152] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:08:47,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817030223] [2025-03-03 20:08:47,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:47,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:47,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:48,002 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:08:48,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 20:08:48,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 703 statements into 1 equivalence classes. [2025-03-03 20:08:48,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 703 of 703 statements. [2025-03-03 20:08:48,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:48,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:48,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 1584 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 20:08:48,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:08:48,507 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 9228 proven. 84 refuted. 0 times theorem prover too weak. 14232 trivial. 0 not checked. [2025-03-03 20:08:48,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:08:48,863 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 240 proven. 84 refuted. 0 times theorem prover too weak. 23220 trivial. 0 not checked. [2025-03-03 20:08:48,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817030223] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:08:48,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:08:48,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-03-03 20:08:48,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396426675] [2025-03-03 20:08:48,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:08:48,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 20:08:48,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:48,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 20:08:48,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-03 20:08:48,866 INFO L87 Difference]: Start difference. First operand 33637 states and 53583 transitions. Second operand has 13 states, 13 states have (on average 25.846153846153847) internal successors, (336), 13 states have internal predecessors, (336), 4 states have call successors, (178), 2 states have call predecessors, (178), 4 states have return successors, (180), 4 states have call predecessors, (180), 4 states have call successors, (180)