./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-20.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 e52028dff064941f52812f4c384cad43fb3c0fbe30b1bc69a5d4e18acf0ee5a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:25:15,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:25:15,113 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:25:15,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:25:15,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:25:15,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:25:15,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:25:15,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:25:15,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:25:15,137 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:25:15,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:25:15,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:25:15,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:25:15,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:25:15,138 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:25:15,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:25:15,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:25:15,138 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:25:15,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:25:15,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:25:15,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:25:15,139 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:25:15,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:25:15,139 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:25:15,139 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:25:15,139 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:25:15,139 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:25:15,139 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:25:15,139 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:25:15,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:25:15,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:25:15,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:25:15,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:25:15,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:25:15,140 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:25:15,140 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:25:15,140 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:25:15,140 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:25:15,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:25:15,140 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:25:15,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:25:15,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:25:15,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:25:15,141 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 -> e52028dff064941f52812f4c384cad43fb3c0fbe30b1bc69a5d4e18acf0ee5a5 [2025-03-17 00:25:15,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:25:15,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:25:15,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:25:15,380 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:25:15,380 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:25:15,381 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-20.i [2025-03-17 00:25:16,571 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cb5af1cf/dbaf77f24b52409d865d78b039bfaef5/FLAGea95a6ac6 [2025-03-17 00:25:16,883 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:25:16,883 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-20.i [2025-03-17 00:25:16,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cb5af1cf/dbaf77f24b52409d865d78b039bfaef5/FLAGea95a6ac6 [2025-03-17 00:25:17,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cb5af1cf/dbaf77f24b52409d865d78b039bfaef5 [2025-03-17 00:25:17,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:25:17,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:25:17,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:25:17,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:25:17,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:25:17,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:25:17" (1/1) ... [2025-03-17 00:25:17,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@781d8a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:25:17, skipping insertion in model container [2025-03-17 00:25:17,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:25:17" (1/1) ... [2025-03-17 00:25:17,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:25:17,266 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-20.i[916,929] [2025-03-17 00:25:17,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:25:17,425 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:25:17,433 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-20.i[916,929] [2025-03-17 00:25:17,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:25:17,527 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:25:17,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:25:17 WrapperNode [2025-03-17 00:25:17,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:25:17,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:25:17,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:25:17,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:25:17,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:25:17" (1/1) ... [2025-03-17 00:25:17,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:25:17" (1/1) ... [2025-03-17 00:25:17,617 INFO L138 Inliner]: procedures = 26, calls = 122, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 794 [2025-03-17 00:25:17,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:25:17,618 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:25:17,618 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:25:17,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:25:17,625 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:25:17" (1/1) ... [2025-03-17 00:25:17,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:25:17" (1/1) ... [2025-03-17 00:25:17,641 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:25:17" (1/1) ... [2025-03-17 00:25:17,671 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-17 00:25:17,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:25:17" (1/1) ... [2025-03-17 00:25:17,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:25:17" (1/1) ... [2025-03-17 00:25:17,687 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:25:17" (1/1) ... [2025-03-17 00:25:17,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:25:17" (1/1) ... [2025-03-17 00:25:17,695 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:25:17" (1/1) ... [2025-03-17 00:25:17,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:25:17" (1/1) ... [2025-03-17 00:25:17,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:25:17,710 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:25:17,710 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:25:17,710 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:25:17,711 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:25:17" (1/1) ... [2025-03-17 00:25:17,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:25:17,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:25:17,740 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-17 00:25:17,742 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-17 00:25:17,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:25:17,758 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:25:17,758 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:25:17,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:25:17,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:25:17,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:25:17,855 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:25:17,857 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:25:18,628 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L724: havoc property_#t~ite73#1;havoc property_#t~bitwise72#1;havoc property_#t~short74#1; [2025-03-17 00:25:18,816 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-17 00:25:18,816 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:25:18,851 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:25:18,851 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:25:18,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:25:18 BoogieIcfgContainer [2025-03-17 00:25:18,852 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:25:18,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:25:18,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:25:18,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:25:18,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:25:17" (1/3) ... [2025-03-17 00:25:18,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6cac35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:25:18, skipping insertion in model container [2025-03-17 00:25:18,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:25:17" (2/3) ... [2025-03-17 00:25:18,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6cac35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:25:18, skipping insertion in model container [2025-03-17 00:25:18,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:25:18" (3/3) ... [2025-03-17 00:25:18,862 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-20.i [2025-03-17 00:25:18,875 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:25:18,879 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-20.i that has 2 procedures, 332 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:25:18,936 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:25:18,947 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;@1bae1f25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:25:18,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:25:18,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 332 states, 220 states have (on average 1.5909090909090908) internal successors, (350), 221 states have internal predecessors, (350), 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-17 00:25:18,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2025-03-17 00:25:18,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:25:18,987 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] [2025-03-17 00:25:18,987 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:25:18,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:25:18,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1901470994, now seen corresponding path program 1 times [2025-03-17 00:25:19,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:25:19,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165541710] [2025-03-17 00:25:19,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:25:19,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:25:19,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 691 statements into 1 equivalence classes. [2025-03-17 00:25:19,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 691 of 691 statements. [2025-03-17 00:25:19,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:25:19,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:25:19,621 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 23328 trivial. 0 not checked. [2025-03-17 00:25:19,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:25:19,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165541710] [2025-03-17 00:25:19,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165541710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:25:19,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102947812] [2025-03-17 00:25:19,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:25:19,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:25:19,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:25:19,627 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-17 00:25:19,628 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-17 00:25:19,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 691 statements into 1 equivalence classes. [2025-03-17 00:25:19,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 691 of 691 statements. [2025-03-17 00:25:19,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:25:19,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:25:19,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 1569 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:25:19,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:25:20,045 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 23328 trivial. 0 not checked. [2025-03-17 00:25:20,046 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:25:20,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102947812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:25:20,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:25:20,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:25:20,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046558803] [2025-03-17 00:25:20,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:25:20,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:25:20,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:25:20,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:25:20,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:25:20,072 INFO L87 Difference]: Start difference. First operand has 332 states, 220 states have (on average 1.5909090909090908) internal successors, (350), 221 states have internal predecessors, (350), 109 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 109 states have call predecessors, (109), 109 states have call successors, (109) Second operand has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 2 states have call successors, (109), 2 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 2 states have call successors, (109) [2025-03-17 00:25:20,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:25:20,133 INFO L93 Difference]: Finished difference Result 661 states and 1243 transitions. [2025-03-17 00:25:20,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:25:20,135 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 2 states have call successors, (109), 2 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 2 states have call successors, (109) Word has length 691 [2025-03-17 00:25:20,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:25:20,143 INFO L225 Difference]: With dead ends: 661 [2025-03-17 00:25:20,143 INFO L226 Difference]: Without dead ends: 330 [2025-03-17 00:25:20,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 692 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:25:20,153 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:25:20,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 553 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:25:20,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-17 00:25:20,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-03-17 00:25:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 219 states have (on average 1.5707762557077625) internal successors, (344), 219 states have internal predecessors, (344), 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-17 00:25:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 562 transitions. [2025-03-17 00:25:20,230 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 562 transitions. Word has length 691 [2025-03-17 00:25:20,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:25:20,231 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 562 transitions. [2025-03-17 00:25:20,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 2 states have call successors, (109), 2 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 2 states have call successors, (109) [2025-03-17 00:25:20,232 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 562 transitions. [2025-03-17 00:25:20,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2025-03-17 00:25:20,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:25:20,244 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] [2025-03-17 00:25:20,258 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-17 00:25:20,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 00:25:20,445 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:25:20,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:25:20,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1530520493, now seen corresponding path program 1 times [2025-03-17 00:25:20,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:25:20,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553664651] [2025-03-17 00:25:20,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:25:20,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:25:20,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 691 statements into 1 equivalence classes. [2025-03-17 00:25:20,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 691 of 691 statements. [2025-03-17 00:25:20,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:25:20,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:25:21,092 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-17 00:25:21,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:25:21,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553664651] [2025-03-17 00:25:21,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553664651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:25:21,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:25:21,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:25:21,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96276953] [2025-03-17 00:25:21,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:25:21,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:25:21,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:25:21,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:25:21,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:25:21,101 INFO L87 Difference]: Start difference. First operand 330 states and 562 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-17 00:25:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:25:21,223 INFO L93 Difference]: Finished difference Result 882 states and 1502 transitions. [2025-03-17 00:25:21,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:25:21,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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 691 [2025-03-17 00:25:21,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:25:21,232 INFO L225 Difference]: With dead ends: 882 [2025-03-17 00:25:21,234 INFO L226 Difference]: Without dead ends: 553 [2025-03-17 00:25:21,236 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-17 00:25:21,237 INFO L435 NwaCegarLoop]: 903 mSDtfsCounter, 371 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:25:21,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1438 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:25:21,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-17 00:25:21,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 550. [2025-03-17 00:25:21,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 374 states have (on average 1.5775401069518717) internal successors, (590), 375 states have internal predecessors, (590), 173 states have call successors, (173), 2 states have call predecessors, (173), 2 states have return successors, (173), 172 states have call predecessors, (173), 173 states have call successors, (173) [2025-03-17 00:25:21,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 936 transitions. [2025-03-17 00:25:21,323 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 936 transitions. Word has length 691 [2025-03-17 00:25:21,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:25:21,326 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 936 transitions. [2025-03-17 00:25:21,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-17 00:25:21,327 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 936 transitions. [2025-03-17 00:25:21,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-03-17 00:25:21,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:25:21,341 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] [2025-03-17 00:25:21,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:25:21,341 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:25:21,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:25:21,343 INFO L85 PathProgramCache]: Analyzing trace with hash 2060805546, now seen corresponding path program 1 times [2025-03-17 00:25:21,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:25:21,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785200364] [2025-03-17 00:25:21,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:25:21,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:25:21,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-03-17 00:25:21,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-03-17 00:25:21,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:25:21,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:25:21,666 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-17 00:25:21,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:25:21,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785200364] [2025-03-17 00:25:21,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785200364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:25:21,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:25:21,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:25:21,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007633409] [2025-03-17 00:25:21,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:25:21,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:25:21,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:25:21,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:25:21,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:25:21,671 INFO L87 Difference]: Start difference. First operand 550 states and 936 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-17 00:25:21,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:25:21,752 INFO L93 Difference]: Finished difference Result 1346 states and 2286 transitions. [2025-03-17 00:25:21,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:25:21,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 692 [2025-03-17 00:25:21,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:25:21,761 INFO L225 Difference]: With dead ends: 1346 [2025-03-17 00:25:21,761 INFO L226 Difference]: Without dead ends: 797 [2025-03-17 00:25:21,763 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-17 00:25:21,764 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 207 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:25:21,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1095 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:25:21,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2025-03-17 00:25:21,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 793. [2025-03-17 00:25:21,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 575 states have (on average 1.5965217391304347) internal successors, (918), 578 states have internal predecessors, (918), 213 states have call successors, (213), 4 states have call predecessors, (213), 4 states have return successors, (213), 210 states have call predecessors, (213), 213 states have call successors, (213) [2025-03-17 00:25:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1344 transitions. [2025-03-17 00:25:21,860 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1344 transitions. Word has length 692 [2025-03-17 00:25:21,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:25:21,862 INFO L471 AbstractCegarLoop]: Abstraction has 793 states and 1344 transitions. [2025-03-17 00:25:21,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-17 00:25:21,862 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1344 transitions. [2025-03-17 00:25:21,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-03-17 00:25:21,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:25:21,868 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] [2025-03-17 00:25:21,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:25:21,869 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:25:21,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:25:21,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1796152247, now seen corresponding path program 1 times [2025-03-17 00:25:21,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:25:21,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696938139] [2025-03-17 00:25:21,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:25:21,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:25:21,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-03-17 00:25:21,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-03-17 00:25:21,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:25:21,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:25:22,354 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-17 00:25:22,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:25:22,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696938139] [2025-03-17 00:25:22,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696938139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:25:22,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:25:22,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:25:22,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987603237] [2025-03-17 00:25:22,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:25:22,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:25:22,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:25:22,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:25:22,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:25:22,356 INFO L87 Difference]: Start difference. First operand 793 states and 1344 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-17 00:25:22,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:25:22,457 INFO L93 Difference]: Finished difference Result 2377 states and 4030 transitions. [2025-03-17 00:25:22,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:25:22,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 692 [2025-03-17 00:25:22,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:25:22,467 INFO L225 Difference]: With dead ends: 2377 [2025-03-17 00:25:22,468 INFO L226 Difference]: Without dead ends: 1585 [2025-03-17 00:25:22,470 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-17 00:25:22,471 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 342 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:25:22,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 1082 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:25:22,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2025-03-17 00:25:22,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1583. [2025-03-17 00:25:22,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1148 states have (on average 1.5940766550522647) internal successors, (1830), 1154 states have internal predecessors, (1830), 426 states have call successors, (426), 8 states have call predecessors, (426), 8 states have return successors, (426), 420 states have call predecessors, (426), 426 states have call successors, (426) [2025-03-17 00:25:22,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2682 transitions. [2025-03-17 00:25:22,662 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2682 transitions. Word has length 692 [2025-03-17 00:25:22,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:25:22,663 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2682 transitions. [2025-03-17 00:25:22,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-17 00:25:22,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2682 transitions. [2025-03-17 00:25:22,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-03-17 00:25:22,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:25:22,673 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] [2025-03-17 00:25:22,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:25:22,674 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:25:22,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:25:22,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1576131466, now seen corresponding path program 1 times [2025-03-17 00:25:22,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:25:22,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749765065] [2025-03-17 00:25:22,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:25:22,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:25:22,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-03-17 00:25:22,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-03-17 00:25:22,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:25:22,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:25:23,081 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-17 00:25:23,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:25:23,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749765065] [2025-03-17 00:25:23,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749765065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:25:23,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:25:23,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:25:23,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376987740] [2025-03-17 00:25:23,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:25:23,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:25:23,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:25:23,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:25:23,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:25:23,083 INFO L87 Difference]: Start difference. First operand 1583 states and 2682 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-17 00:25:23,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:25:23,220 INFO L93 Difference]: Finished difference Result 4747 states and 8044 transitions. [2025-03-17 00:25:23,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:25:23,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 692 [2025-03-17 00:25:23,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:25:23,239 INFO L225 Difference]: With dead ends: 4747 [2025-03-17 00:25:23,239 INFO L226 Difference]: Without dead ends: 3165 [2025-03-17 00:25:23,245 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-17 00:25:23,246 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 330 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:25:23,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1148 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:25:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3165 states. [2025-03-17 00:25:23,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3165 to 3163. [2025-03-17 00:25:23,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3163 states, 2294 states have (on average 1.5911072362685266) internal successors, (3650), 2306 states have internal predecessors, (3650), 852 states have call successors, (852), 16 states have call predecessors, (852), 16 states have return successors, (852), 840 states have call predecessors, (852), 852 states have call successors, (852) [2025-03-17 00:25:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3163 states to 3163 states and 5354 transitions. [2025-03-17 00:25:23,492 INFO L78 Accepts]: Start accepts. Automaton has 3163 states and 5354 transitions. Word has length 692 [2025-03-17 00:25:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:25:23,493 INFO L471 AbstractCegarLoop]: Abstraction has 3163 states and 5354 transitions. [2025-03-17 00:25:23,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-17 00:25:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3163 states and 5354 transitions. [2025-03-17 00:25:23,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-03-17 00:25:23,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:25:23,499 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] [2025-03-17 00:25:23,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:25:23,499 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:25:23,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:25:23,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1080850879, now seen corresponding path program 1 times [2025-03-17 00:25:23,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:25:23,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400739550] [2025-03-17 00:25:23,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:25:23,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:25:23,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-03-17 00:25:23,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-03-17 00:25:23,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:25:23,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:25:23,907 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-17 00:25:23,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:25:23,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400739550] [2025-03-17 00:25:23,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400739550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:25:23,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:25:23,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:25:23,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688643769] [2025-03-17 00:25:23,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:25:23,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:25:23,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:25:23,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:25:23,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:25:23,909 INFO L87 Difference]: Start difference. First operand 3163 states and 5354 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (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-17 00:25:28,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 00:25:28,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:25:28,565 INFO L93 Difference]: Finished difference Result 12069 states and 20433 transitions. [2025-03-17 00:25:28,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:25:28,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (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 693 [2025-03-17 00:25:28,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:25:28,619 INFO L225 Difference]: With dead ends: 12069 [2025-03-17 00:25:28,619 INFO L226 Difference]: Without dead ends: 8907 [2025-03-17 00:25:28,634 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-17 00:25:28,635 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 984 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 189 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:25:28,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 1714 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 105 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-17 00:25:28,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8907 states. [2025-03-17 00:25:29,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8907 to 8895. [2025-03-17 00:25:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8895 states, 6614 states have (on average 1.602358633202298) internal successors, (10598), 6654 states have internal predecessors, (10598), 2232 states have call successors, (2232), 48 states have call predecessors, (2232), 48 states have return successors, (2232), 2192 states have call predecessors, (2232), 2232 states have call successors, (2232) [2025-03-17 00:25:29,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8895 states to 8895 states and 15062 transitions. [2025-03-17 00:25:29,257 INFO L78 Accepts]: Start accepts. Automaton has 8895 states and 15062 transitions. Word has length 693 [2025-03-17 00:25:29,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:25:29,258 INFO L471 AbstractCegarLoop]: Abstraction has 8895 states and 15062 transitions. [2025-03-17 00:25:29,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (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-17 00:25:29,260 INFO L276 IsEmpty]: Start isEmpty. Operand 8895 states and 15062 transitions. [2025-03-17 00:25:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-03-17 00:25:29,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:25:29,269 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] [2025-03-17 00:25:29,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:25:29,269 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:25:29,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:25:29,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1652102112, now seen corresponding path program 1 times [2025-03-17 00:25:29,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:25:29,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028518881] [2025-03-17 00:25:29,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:25:29,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:25:29,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-03-17 00:25:29,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-03-17 00:25:29,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:25:29,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:25:29,551 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-17 00:25:29,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:25:29,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028518881] [2025-03-17 00:25:29,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028518881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:25:29,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:25:29,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:25:29,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754996637] [2025-03-17 00:25:29,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:25:29,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:25:29,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:25:29,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:25:29,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:25:29,557 INFO L87 Difference]: Start difference. First operand 8895 states and 15062 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (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-17 00:25:30,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:25:30,072 INFO L93 Difference]: Finished difference Result 22931 states and 38788 transitions. [2025-03-17 00:25:30,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:25:30,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (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 693 [2025-03-17 00:25:30,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:25:30,152 INFO L225 Difference]: With dead ends: 22931 [2025-03-17 00:25:30,152 INFO L226 Difference]: Without dead ends: 14037 [2025-03-17 00:25:30,177 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-17 00:25:30,178 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 331 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:25:30,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1242 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:25:30,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14037 states. [2025-03-17 00:25:30,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14037 to 9595. [2025-03-17 00:25:30,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9595 states, 7306 states have (on average 1.6159321105940323) internal successors, (11806), 7346 states have internal predecessors, (11806), 2232 states have call successors, (2232), 56 states have call predecessors, (2232), 56 states have return successors, (2232), 2192 states have call predecessors, (2232), 2232 states have call successors, (2232) [2025-03-17 00:25:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9595 states to 9595 states and 16270 transitions. [2025-03-17 00:25:30,870 INFO L78 Accepts]: Start accepts. Automaton has 9595 states and 16270 transitions. Word has length 693 [2025-03-17 00:25:30,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:25:30,871 INFO L471 AbstractCegarLoop]: Abstraction has 9595 states and 16270 transitions. [2025-03-17 00:25:30,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (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-17 00:25:30,872 INFO L276 IsEmpty]: Start isEmpty. Operand 9595 states and 16270 transitions. [2025-03-17 00:25:30,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-03-17 00:25:30,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:25:30,885 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] [2025-03-17 00:25:30,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:25:30,885 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:25:30,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:25:30,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1107263137, now seen corresponding path program 1 times [2025-03-17 00:25:30,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:25:30,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365544873] [2025-03-17 00:25:30,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:25:30,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:25:30,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-03-17 00:25:30,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-03-17 00:25:30,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:25:30,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:25:31,428 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-17 00:25:31,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:25:31,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365544873] [2025-03-17 00:25:31,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365544873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:25:31,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:25:31,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:25:31,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758556713] [2025-03-17 00:25:31,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:25:31,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:25:31,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:25:31,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:25:31,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:25:31,430 INFO L87 Difference]: Start difference. First operand 9595 states and 16270 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (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-17 00:25:31,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:25:31,664 INFO L93 Difference]: Finished difference Result 19189 states and 32539 transitions. [2025-03-17 00:25:31,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:25:31,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (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 693 [2025-03-17 00:25:31,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:25:31,703 INFO L225 Difference]: With dead ends: 19189 [2025-03-17 00:25:31,703 INFO L226 Difference]: Without dead ends: 9595 [2025-03-17 00:25:31,733 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-17 00:25:31,734 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 517 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:25:31,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 551 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:25:31,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9595 states. [2025-03-17 00:25:32,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9595 to 9595. [2025-03-17 00:25:32,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9595 states, 7306 states have (on average 1.6093621680810293) internal successors, (11758), 7346 states have internal predecessors, (11758), 2232 states have call successors, (2232), 56 states have call predecessors, (2232), 56 states have return successors, (2232), 2192 states have call predecessors, (2232), 2232 states have call successors, (2232) [2025-03-17 00:25:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9595 states to 9595 states and 16222 transitions. [2025-03-17 00:25:32,309 INFO L78 Accepts]: Start accepts. Automaton has 9595 states and 16222 transitions. Word has length 693 [2025-03-17 00:25:32,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:25:32,310 INFO L471 AbstractCegarLoop]: Abstraction has 9595 states and 16222 transitions. [2025-03-17 00:25:32,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (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-17 00:25:32,310 INFO L276 IsEmpty]: Start isEmpty. Operand 9595 states and 16222 transitions. [2025-03-17 00:25:32,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-03-17 00:25:32,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:25:32,319 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] [2025-03-17 00:25:32,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:25:32,319 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:25:32,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:25:32,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2104335490, now seen corresponding path program 1 times [2025-03-17 00:25:32,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:25:32,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396148326] [2025-03-17 00:25:32,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:25:32,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:25:32,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-03-17 00:25:32,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-03-17 00:25:32,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:25:32,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:25:32,799 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-17 00:25:32,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:25:32,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396148326] [2025-03-17 00:25:32,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396148326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:25:32,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:25:32,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:25:32,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811625859] [2025-03-17 00:25:32,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:25:32,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:25:32,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:25:32,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:25:32,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:25:32,801 INFO L87 Difference]: Start difference. First operand 9595 states and 16222 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-17 00:25:34,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:25:34,208 INFO L93 Difference]: Finished difference Result 36473 states and 61521 transitions. [2025-03-17 00:25:34,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:25:34,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 693 [2025-03-17 00:25:34,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:25:34,329 INFO L225 Difference]: With dead ends: 36473 [2025-03-17 00:25:34,329 INFO L226 Difference]: Without dead ends: 26879 [2025-03-17 00:25:34,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:25:34,378 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 709 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 2315 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:25:34,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 2315 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 00:25:34,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26879 states. [2025-03-17 00:25:35,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26879 to 26859. [2025-03-17 00:25:35,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26859 states, 20482 states have (on average 1.5975978908309736) internal successors, (32722), 20610 states have internal predecessors, (32722), 6208 states have call successors, (6208), 168 states have call predecessors, (6208), 168 states have return successors, (6208), 6080 states have call predecessors, (6208), 6208 states have call successors, (6208) [2025-03-17 00:25:35,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26859 states to 26859 states and 45138 transitions. [2025-03-17 00:25:35,829 INFO L78 Accepts]: Start accepts. Automaton has 26859 states and 45138 transitions. Word has length 693 [2025-03-17 00:25:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:25:35,830 INFO L471 AbstractCegarLoop]: Abstraction has 26859 states and 45138 transitions. [2025-03-17 00:25:35,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-17 00:25:35,831 INFO L276 IsEmpty]: Start isEmpty. Operand 26859 states and 45138 transitions. [2025-03-17 00:25:35,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2025-03-17 00:25:35,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:25:35,849 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] [2025-03-17 00:25:35,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:25:35,850 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:25:35,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:25:35,850 INFO L85 PathProgramCache]: Analyzing trace with hash -245288094, now seen corresponding path program 1 times [2025-03-17 00:25:35,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:25:35,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980253541] [2025-03-17 00:25:35,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:25:35,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:25:35,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-03-17 00:25:36,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-03-17 00:25:36,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:25:36,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:25:36,652 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-17 00:25:36,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:25:36,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980253541] [2025-03-17 00:25:36,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980253541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:25:36,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:25:36,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 00:25:36,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078046507] [2025-03-17 00:25:36,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:25:36,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:25:36,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:25:36,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:25:36,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:25:36,655 INFO L87 Difference]: Start difference. First operand 26859 states and 45138 transitions. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 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-17 00:25:44,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:25:44,582 INFO L93 Difference]: Finished difference Result 184483 states and 306534 transitions. [2025-03-17 00:25:44,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 00:25:44,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 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 694 [2025-03-17 00:25:44,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:25:45,485 INFO L225 Difference]: With dead ends: 184483 [2025-03-17 00:25:45,485 INFO L226 Difference]: Without dead ends: 157625 [2025-03-17 00:25:45,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2025-03-17 00:25:45,594 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 3089 mSDsluCounter, 1972 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 1483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3089 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1483 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:25:45,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3089 Valid, 2626 Invalid, 2424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1483 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 00:25:45,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157625 states. [2025-03-17 00:25:51,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157625 to 93041. [2025-03-17 00:25:51,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93041 states, 70988 states have (on average 1.5790837888093763) internal successors, (112096), 71551 states have internal predecessors, (112096), 21256 states have call successors, (21256), 796 states have call predecessors, (21256), 796 states have return successors, (21256), 20693 states have call predecessors, (21256), 21256 states have call successors, (21256) [2025-03-17 00:25:51,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93041 states to 93041 states and 154608 transitions. [2025-03-17 00:25:51,664 INFO L78 Accepts]: Start accepts. Automaton has 93041 states and 154608 transitions. Word has length 694 [2025-03-17 00:25:51,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:25:51,665 INFO L471 AbstractCegarLoop]: Abstraction has 93041 states and 154608 transitions. [2025-03-17 00:25:51,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 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-17 00:25:51,665 INFO L276 IsEmpty]: Start isEmpty. Operand 93041 states and 154608 transitions. [2025-03-17 00:25:51,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2025-03-17 00:25:51,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:25:51,728 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] [2025-03-17 00:25:51,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:25:51,728 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:25:51,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:25:51,729 INFO L85 PathProgramCache]: Analyzing trace with hash 890164400, now seen corresponding path program 1 times [2025-03-17 00:25:51,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:25:51,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519831431] [2025-03-17 00:25:51,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:25:51,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:25:51,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 695 statements into 1 equivalence classes. [2025-03-17 00:25:52,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 695 of 695 statements. [2025-03-17 00:25:52,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:25:52,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:25:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 132 proven. 192 refuted. 0 times theorem prover too weak. 23220 trivial. 0 not checked. [2025-03-17 00:25:53,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:25:53,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519831431] [2025-03-17 00:25:53,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519831431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:25:53,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41367828] [2025-03-17 00:25:53,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:25:53,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:25:53,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:25:53,113 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-17 00:25:53,116 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-17 00:25:53,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 695 statements into 1 equivalence classes. [2025-03-17 00:25:53,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 695 of 695 statements. [2025-03-17 00:25:53,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:25:53,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:25:53,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 1578 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 00:25:53,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:25:53,862 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 11868 proven. 156 refuted. 0 times theorem prover too weak. 11520 trivial. 0 not checked. [2025-03-17 00:25:53,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:25:54,430 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 168 proven. 156 refuted. 0 times theorem prover too weak. 23220 trivial. 0 not checked. [2025-03-17 00:25:54,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41367828] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:25:54,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:25:54,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2025-03-17 00:25:54,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327132988] [2025-03-17 00:25:54,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:25:54,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 00:25:54,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:25:54,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 00:25:54,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:25:54,433 INFO L87 Difference]: Start difference. First operand 93041 states and 154608 transitions. Second operand has 11 states, 11 states have (on average 29.818181818181817) internal successors, (328), 11 states have internal predecessors, (328), 4 states have call successors, (225), 2 states have call predecessors, (225), 4 states have return successors, (227), 4 states have call predecessors, (227), 4 states have call successors, (227) [2025-03-17 00:25:59,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:25:59,045 INFO L93 Difference]: Finished difference Result 160626 states and 265426 transitions. [2025-03-17 00:25:59,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 00:25:59,046 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 29.818181818181817) internal successors, (328), 11 states have internal predecessors, (328), 4 states have call successors, (225), 2 states have call predecessors, (225), 4 states have return successors, (227), 4 states have call predecessors, (227), 4 states have call successors, (227) Word has length 695 [2025-03-17 00:25:59,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:25:59,387 INFO L225 Difference]: With dead ends: 160626 [2025-03-17 00:25:59,388 INFO L226 Difference]: Without dead ends: 67625 [2025-03-17 00:25:59,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1404 GetRequests, 1386 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2025-03-17 00:25:59,619 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 517 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:25:59,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 1350 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 00:25:59,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67625 states. [2025-03-17 00:26:03,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67625 to 66465. [2025-03-17 00:26:03,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66465 states, 50627 states have (on average 1.5592272897860826) internal successors, (78939), 50998 states have internal predecessors, (78939), 15016 states have call successors, (15016), 821 states have call predecessors, (15016), 821 states have return successors, (15016), 14645 states have call predecessors, (15016), 15016 states have call successors, (15016) [2025-03-17 00:26:04,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66465 states to 66465 states and 108971 transitions. [2025-03-17 00:26:04,100 INFO L78 Accepts]: Start accepts. Automaton has 66465 states and 108971 transitions. Word has length 695 [2025-03-17 00:26:04,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:26:04,101 INFO L471 AbstractCegarLoop]: Abstraction has 66465 states and 108971 transitions. [2025-03-17 00:26:04,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 29.818181818181817) internal successors, (328), 11 states have internal predecessors, (328), 4 states have call successors, (225), 2 states have call predecessors, (225), 4 states have return successors, (227), 4 states have call predecessors, (227), 4 states have call successors, (227) [2025-03-17 00:26:04,102 INFO L276 IsEmpty]: Start isEmpty. Operand 66465 states and 108971 transitions. [2025-03-17 00:26:04,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2025-03-17 00:26:04,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:26:04,141 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-17 00:26:04,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 00:26:04,345 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,SelfDestructingSolverStorable10 [2025-03-17 00:26:04,345 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:26:04,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:26:04,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1061247440, now seen corresponding path program 1 times [2025-03-17 00:26:04,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:26:04,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487077481] [2025-03-17 00:26:04,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:26:04,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:26:04,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-03-17 00:26:04,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-03-17 00:26:04,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:26:04,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:26:04,975 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-17 00:26:04,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:26:04,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487077481] [2025-03-17 00:26:04,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487077481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:26:04,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:26:04,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 00:26:04,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677566238] [2025-03-17 00:26:04,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:26:04,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 00:26:04,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:26:04,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 00:26:04,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:26:04,978 INFO L87 Difference]: Start difference. First operand 66465 states and 108971 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (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-17 00:26:15,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:26:15,219 INFO L93 Difference]: Finished difference Result 237426 states and 387640 transitions. [2025-03-17 00:26:15,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 00:26:15,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (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-17 00:26:15,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:26:15,862 INFO L225 Difference]: With dead ends: 237426 [2025-03-17 00:26:15,862 INFO L226 Difference]: Without dead ends: 204497 [2025-03-17 00:26:15,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:26:15,999 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 812 mSDsluCounter, 2292 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 2928 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:26:15,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 2928 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:26:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204497 states. [2025-03-17 00:26:23,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204497 to 121837. [2025-03-17 00:26:23,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121837 states, 96320 states have (on average 1.5793604651162791) internal successors, (152124), 97075 states have internal predecessors, (152124), 24216 states have call successors, (24216), 1300 states have call predecessors, (24216), 1300 states have return successors, (24216), 23461 states have call predecessors, (24216), 24216 states have call successors, (24216) [2025-03-17 00:26:24,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121837 states to 121837 states and 200556 transitions. [2025-03-17 00:26:24,198 INFO L78 Accepts]: Start accepts. Automaton has 121837 states and 200556 transitions. Word has length 698 [2025-03-17 00:26:24,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:26:24,199 INFO L471 AbstractCegarLoop]: Abstraction has 121837 states and 200556 transitions. [2025-03-17 00:26:24,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (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-17 00:26:24,199 INFO L276 IsEmpty]: Start isEmpty. Operand 121837 states and 200556 transitions. [2025-03-17 00:26:24,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2025-03-17 00:26:24,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:26:24,267 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-17 00:26:24,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 00:26:24,268 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:26:24,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:26:24,269 INFO L85 PathProgramCache]: Analyzing trace with hash -2025582059, now seen corresponding path program 1 times [2025-03-17 00:26:24,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:26:24,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522042731] [2025-03-17 00:26:24,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:26:24,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:26:24,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-03-17 00:26:24,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-03-17 00:26:24,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:26:24,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:26:26,052 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 138 proven. 186 refuted. 0 times theorem prover too weak. 23220 trivial. 0 not checked. [2025-03-17 00:26:26,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:26:26,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522042731] [2025-03-17 00:26:26,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522042731] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:26:26,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392746701] [2025-03-17 00:26:26,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:26:26,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:26:26,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:26:26,059 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-17 00:26:26,060 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-17 00:26:26,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-03-17 00:26:26,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-03-17 00:26:26,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:26:26,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:26:26,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 1588 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 00:26:26,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:26:27,158 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 750 proven. 3 refuted. 0 times theorem prover too weak. 22791 trivial. 0 not checked. [2025-03-17 00:26:27,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:26:28,029 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 321 proven. 3 refuted. 0 times theorem prover too weak. 23220 trivial. 0 not checked. [2025-03-17 00:26:28,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392746701] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:26:28,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:26:28,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 9] total 14 [2025-03-17 00:26:28,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692535535] [2025-03-17 00:26:28,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:26:28,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 00:26:28,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:26:28,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 00:26:28,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-17 00:26:28,034 INFO L87 Difference]: Start difference. First operand 121837 states and 200556 transitions. Second operand has 14 states, 14 states have (on average 22.928571428571427) internal successors, (321), 14 states have internal predecessors, (321), 3 states have call successors, (172), 2 states have call predecessors, (172), 4 states have return successors, (174), 3 states have call predecessors, (174), 3 states have call successors, (174)