./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-12.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-12.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 0195a79ad7eda7ad8a0c6adcb8066ff123870f81fcea1f23c209e71678638ac8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:24:09,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:24:10,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:24:10,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:24:10,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:24:10,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:24:10,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:24:10,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:24:10,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:24:10,038 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:24:10,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:24:10,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:24:10,038 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:24:10,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:24:10,038 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:24:10,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:24:10,039 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:24:10,039 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:24:10,040 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:24:10,040 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:24:10,040 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:24:10,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:24:10,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:24:10,041 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:24:10,041 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:24:10,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:24:10,041 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:24:10,041 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:24:10,041 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:24:10,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:24:10,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:24:10,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:24:10,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:24:10,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:24:10,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:24:10,042 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:24:10,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:24:10,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:24:10,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:24:10,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:24:10,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:24:10,042 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:24:10,042 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:24:10,043 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 -> 0195a79ad7eda7ad8a0c6adcb8066ff123870f81fcea1f23c209e71678638ac8 [2025-03-17 00:24:10,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:24:10,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:24:10,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:24:10,268 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:24:10,269 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:24:10,270 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-12.i [2025-03-17 00:24:11,419 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9871a2aba/391eced1552f42ebbc062220f6dd337c/FLAGd5db12795 [2025-03-17 00:24:11,736 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:24:11,737 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-12.i [2025-03-17 00:24:11,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9871a2aba/391eced1552f42ebbc062220f6dd337c/FLAGd5db12795 [2025-03-17 00:24:11,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9871a2aba/391eced1552f42ebbc062220f6dd337c [2025-03-17 00:24:11,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:24:11,772 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:24:11,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:24:11,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:24:11,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:24:11,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:24:11" (1/1) ... [2025-03-17 00:24:11,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2606e589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:11, skipping insertion in model container [2025-03-17 00:24:11,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:24:11" (1/1) ... [2025-03-17 00:24:11,807 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:24:11,916 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-12.i[916,929] [2025-03-17 00:24:12,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:24:12,128 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:24:12,137 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-12.i[916,929] [2025-03-17 00:24:12,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:24:12,241 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:24:12,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:12 WrapperNode [2025-03-17 00:24:12,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:24:12,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:24:12,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:24:12,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:24:12,248 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:24:12" (1/1) ... [2025-03-17 00:24:12,262 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:24:12" (1/1) ... [2025-03-17 00:24:12,322 INFO L138 Inliner]: procedures = 26, calls = 121, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 820 [2025-03-17 00:24:12,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:24:12,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:24:12,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:24:12,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:24:12,329 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:12" (1/1) ... [2025-03-17 00:24:12,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:12" (1/1) ... [2025-03-17 00:24:12,339 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:12" (1/1) ... [2025-03-17 00:24:12,374 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:24:12,375 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:12" (1/1) ... [2025-03-17 00:24:12,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:12" (1/1) ... [2025-03-17 00:24:12,402 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:12" (1/1) ... [2025-03-17 00:24:12,411 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:12" (1/1) ... [2025-03-17 00:24:12,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:12" (1/1) ... [2025-03-17 00:24:12,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:12" (1/1) ... [2025-03-17 00:24:12,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:24:12,437 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:24:12,438 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:24:12,438 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:24:12,439 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:12" (1/1) ... [2025-03-17 00:24:12,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:24:12,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:24:12,465 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:24:12,471 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:24:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:24:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:24:12,485 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:24:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:24:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:24:12,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:24:12,584 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:24:12,586 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:24:13,482 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-17 00:24:13,482 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:24:13,515 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:24:13,515 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:24:13,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:24:13 BoogieIcfgContainer [2025-03-17 00:24:13,516 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:24:13,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:24:13,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:24:13,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:24:13,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:24:11" (1/3) ... [2025-03-17 00:24:13,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e524f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:24:13, skipping insertion in model container [2025-03-17 00:24:13,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:12" (2/3) ... [2025-03-17 00:24:13,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e524f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:24:13, skipping insertion in model container [2025-03-17 00:24:13,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:24:13" (3/3) ... [2025-03-17 00:24:13,526 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-12.i [2025-03-17 00:24:13,537 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:24:13,542 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-12.i that has 2 procedures, 334 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:24:13,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:24:13,608 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;@15855fdf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:24:13,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:24:13,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 334 states, 223 states have (on average 1.5919282511210762) internal successors, (355), 224 states have internal predecessors, (355), 108 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-17 00:24:13,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 687 [2025-03-17 00:24:13,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:13,639 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:13,639 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:13,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:13,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1118098719, now seen corresponding path program 1 times [2025-03-17 00:24:13,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:13,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632558485] [2025-03-17 00:24:13,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:13,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:13,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 686 statements into 1 equivalence classes. [2025-03-17 00:24:13,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 686 of 686 statements. [2025-03-17 00:24:13,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:13,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:14,204 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 214 refuted. 0 times theorem prover too weak. 22898 trivial. 0 not checked. [2025-03-17 00:24:14,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:14,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632558485] [2025-03-17 00:24:14,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632558485] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:24:14,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153378054] [2025-03-17 00:24:14,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:14,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:24:14,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:24:14,210 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:24:14,211 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:24:14,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 686 statements into 1 equivalence classes. [2025-03-17 00:24:14,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 686 of 686 statements. [2025-03-17 00:24:14,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:14,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:14,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:24:14,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:24:14,643 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 22898 trivial. 0 not checked. [2025-03-17 00:24:14,644 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:24:14,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153378054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:14,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:24:14,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:24:14,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909860241] [2025-03-17 00:24:14,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:14,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:24:14,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:14,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:24:14,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:24:14,670 INFO L87 Difference]: Start difference. First operand has 334 states, 223 states have (on average 1.5919282511210762) internal successors, (355), 224 states have internal predecessors, (355), 108 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) 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, (108), 2 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 2 states have call successors, (108) [2025-03-17 00:24:14,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:14,742 INFO L93 Difference]: Finished difference Result 665 states and 1248 transitions. [2025-03-17 00:24:14,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:24:14,747 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, (108), 2 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 2 states have call successors, (108) Word has length 686 [2025-03-17 00:24:14,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:14,757 INFO L225 Difference]: With dead ends: 665 [2025-03-17 00:24:14,757 INFO L226 Difference]: Without dead ends: 332 [2025-03-17 00:24:14,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 687 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:24:14,765 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:14,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 554 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:24:14,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-17 00:24:14,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-03-17 00:24:14,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 222 states have (on average 1.5765765765765767) internal successors, (350), 222 states have internal predecessors, (350), 108 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-17 00:24:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 566 transitions. [2025-03-17 00:24:14,846 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 566 transitions. Word has length 686 [2025-03-17 00:24:14,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:14,847 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 566 transitions. [2025-03-17 00:24:14,848 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, (108), 2 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 2 states have call successors, (108) [2025-03-17 00:24:14,848 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 566 transitions. [2025-03-17 00:24:14,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2025-03-17 00:24:14,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:14,858 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:14,866 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:24:15,062 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:24:15,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:15,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:15,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1773871442, now seen corresponding path program 1 times [2025-03-17 00:24:15,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:15,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236746360] [2025-03-17 00:24:15,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:15,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:15,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-03-17 00:24:15,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-03-17 00:24:15,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:15,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:16,012 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-17 00:24:16,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:16,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236746360] [2025-03-17 00:24:16,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236746360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:16,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:16,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:24:16,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710714226] [2025-03-17 00:24:16,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:16,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:24:16,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:16,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:24:16,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:16,020 INFO L87 Difference]: Start difference. First operand 332 states and 566 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:16,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:16,130 INFO L93 Difference]: Finished difference Result 993 states and 1694 transitions. [2025-03-17 00:24:16,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:24:16,130 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 687 [2025-03-17 00:24:16,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:16,140 INFO L225 Difference]: With dead ends: 993 [2025-03-17 00:24:16,140 INFO L226 Difference]: Without dead ends: 662 [2025-03-17 00:24:16,142 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:24:16,143 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 348 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:16,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1084 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:24:16,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-17 00:24:16,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 660. [2025-03-17 00:24:16,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 441 states have (on average 1.5736961451247165) internal successors, (694), 441 states have internal predecessors, (694), 216 states have call successors, (216), 2 states have call predecessors, (216), 2 states have return successors, (216), 216 states have call predecessors, (216), 216 states have call successors, (216) [2025-03-17 00:24:16,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1126 transitions. [2025-03-17 00:24:16,224 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1126 transitions. Word has length 687 [2025-03-17 00:24:16,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:16,226 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 1126 transitions. [2025-03-17 00:24:16,226 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:16,227 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1126 transitions. [2025-03-17 00:24:16,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-17 00:24:16,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:16,233 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:16,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:24:16,233 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:16,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:16,234 INFO L85 PathProgramCache]: Analyzing trace with hash 926511396, now seen corresponding path program 1 times [2025-03-17 00:24:16,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:16,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664845566] [2025-03-17 00:24:16,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:16,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:16,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-17 00:24:16,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-17 00:24:16,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:16,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-17 00:24:16,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:16,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664845566] [2025-03-17 00:24:16,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664845566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:16,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:16,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:24:16,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066448887] [2025-03-17 00:24:16,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:16,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:24:16,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:16,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:24:16,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:16,550 INFO L87 Difference]: Start difference. First operand 660 states and 1126 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:16,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:16,665 INFO L93 Difference]: Finished difference Result 1700 states and 2914 transitions. [2025-03-17 00:24:16,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:24:16,666 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 688 [2025-03-17 00:24:16,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:16,680 INFO L225 Difference]: With dead ends: 1700 [2025-03-17 00:24:16,681 INFO L226 Difference]: Without dead ends: 1041 [2025-03-17 00:24:16,683 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:24:16,684 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 329 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:16,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1268 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:24:16,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2025-03-17 00:24:16,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1037. [2025-03-17 00:24:16,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 758 states have (on average 1.6279683377308707) internal successors, (1234), 760 states have internal predecessors, (1234), 274 states have call successors, (274), 4 states have call predecessors, (274), 4 states have return successors, (274), 272 states have call predecessors, (274), 274 states have call successors, (274) [2025-03-17 00:24:16,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1782 transitions. [2025-03-17 00:24:16,792 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1782 transitions. Word has length 688 [2025-03-17 00:24:16,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:16,794 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1782 transitions. [2025-03-17 00:24:16,794 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:16,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1782 transitions. [2025-03-17 00:24:16,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-17 00:24:16,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:16,800 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:16,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:24:16,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:16,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:16,801 INFO L85 PathProgramCache]: Analyzing trace with hash 622540740, now seen corresponding path program 1 times [2025-03-17 00:24:16,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:16,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911779543] [2025-03-17 00:24:16,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:16,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:16,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-17 00:24:16,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-17 00:24:16,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:16,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:17,092 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-17 00:24:17,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:17,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911779543] [2025-03-17 00:24:17,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911779543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:17,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:17,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:24:17,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012451690] [2025-03-17 00:24:17,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:17,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:24:17,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:17,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:24:17,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:17,095 INFO L87 Difference]: Start difference. First operand 1037 states and 1782 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:17,221 INFO L93 Difference]: Finished difference Result 2831 states and 4878 transitions. [2025-03-17 00:24:17,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:24:17,221 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 688 [2025-03-17 00:24:17,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:17,236 INFO L225 Difference]: With dead ends: 2831 [2025-03-17 00:24:17,236 INFO L226 Difference]: Without dead ends: 1795 [2025-03-17 00:24:17,240 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:24:17,242 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 325 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:17,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 1239 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:24:17,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2025-03-17 00:24:17,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1791. [2025-03-17 00:24:17,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1376 states have (on average 1.6468023255813953) internal successors, (2266), 1382 states have internal predecessors, (2266), 406 states have call successors, (406), 8 states have call predecessors, (406), 8 states have return successors, (406), 400 states have call predecessors, (406), 406 states have call successors, (406) [2025-03-17 00:24:17,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 3078 transitions. [2025-03-17 00:24:17,383 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 3078 transitions. Word has length 688 [2025-03-17 00:24:17,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:17,384 INFO L471 AbstractCegarLoop]: Abstraction has 1791 states and 3078 transitions. [2025-03-17 00:24:17,385 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:17,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 3078 transitions. [2025-03-17 00:24:17,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-17 00:24:17,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:17,392 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:17,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:24:17,392 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:17,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:17,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1800298468, now seen corresponding path program 1 times [2025-03-17 00:24:17,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:17,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106254944] [2025-03-17 00:24:17,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:17,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:17,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-17 00:24:17,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-17 00:24:17,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:17,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:17,663 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-17 00:24:17,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:17,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106254944] [2025-03-17 00:24:17,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106254944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:17,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:17,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:24:17,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341422040] [2025-03-17 00:24:17,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:17,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:24:17,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:17,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:24:17,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:17,666 INFO L87 Difference]: Start difference. First operand 1791 states and 3078 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:17,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:17,850 INFO L93 Difference]: Finished difference Result 5371 states and 9232 transitions. [2025-03-17 00:24:17,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:24:17,851 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 688 [2025-03-17 00:24:17,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:17,873 INFO L225 Difference]: With dead ends: 5371 [2025-03-17 00:24:17,873 INFO L226 Difference]: Without dead ends: 3581 [2025-03-17 00:24:17,878 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:24:17,880 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 558 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:17,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1198 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:24:17,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3581 states. [2025-03-17 00:24:18,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3581 to 3579. [2025-03-17 00:24:18,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3579 states, 2750 states have (on average 1.6385454545454545) internal successors, (4506), 2762 states have internal predecessors, (4506), 812 states have call successors, (812), 16 states have call predecessors, (812), 16 states have return successors, (812), 800 states have call predecessors, (812), 812 states have call successors, (812) [2025-03-17 00:24:18,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3579 states to 3579 states and 6130 transitions. [2025-03-17 00:24:18,118 INFO L78 Accepts]: Start accepts. Automaton has 3579 states and 6130 transitions. Word has length 688 [2025-03-17 00:24:18,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:18,119 INFO L471 AbstractCegarLoop]: Abstraction has 3579 states and 6130 transitions. [2025-03-17 00:24:18,123 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:18,123 INFO L276 IsEmpty]: Start isEmpty. Operand 3579 states and 6130 transitions. [2025-03-17 00:24:18,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-17 00:24:18,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:18,131 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:18,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:24:18,131 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:18,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:18,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1650196957, now seen corresponding path program 1 times [2025-03-17 00:24:18,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:18,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657189700] [2025-03-17 00:24:18,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:18,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:18,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-17 00:24:18,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-17 00:24:18,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:18,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:18,688 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-17 00:24:18,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:18,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657189700] [2025-03-17 00:24:18,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657189700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:18,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:18,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:24:18,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542781501] [2025-03-17 00:24:18,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:18,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:24:18,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:18,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:24:18,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:18,691 INFO L87 Difference]: Start difference. First operand 3579 states and 6130 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:19,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:19,044 INFO L93 Difference]: Finished difference Result 9135 states and 15540 transitions. [2025-03-17 00:24:19,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:24:19,045 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 688 [2025-03-17 00:24:19,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:19,073 INFO L225 Difference]: With dead ends: 9135 [2025-03-17 00:24:19,073 INFO L226 Difference]: Without dead ends: 5557 [2025-03-17 00:24:19,082 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:24:19,083 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 186 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:19,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1101 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:24:19,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5557 states. [2025-03-17 00:24:19,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5557 to 5547. [2025-03-17 00:24:19,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5547 states, 4190 states have (on average 1.6081145584725538) internal successors, (6738), 4218 states have internal predecessors, (6738), 1324 states have call successors, (1324), 32 states have call predecessors, (1324), 32 states have return successors, (1324), 1296 states have call predecessors, (1324), 1324 states have call successors, (1324) [2025-03-17 00:24:19,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5547 states to 5547 states and 9386 transitions. [2025-03-17 00:24:19,497 INFO L78 Accepts]: Start accepts. Automaton has 5547 states and 9386 transitions. Word has length 688 [2025-03-17 00:24:19,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:19,498 INFO L471 AbstractCegarLoop]: Abstraction has 5547 states and 9386 transitions. [2025-03-17 00:24:19,498 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:19,498 INFO L276 IsEmpty]: Start isEmpty. Operand 5547 states and 9386 transitions. [2025-03-17 00:24:19,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-17 00:24:19,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:19,507 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:19,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:24:19,507 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:19,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:19,508 INFO L85 PathProgramCache]: Analyzing trace with hash -2037390238, now seen corresponding path program 1 times [2025-03-17 00:24:19,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:19,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769955067] [2025-03-17 00:24:19,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:19,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:19,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-17 00:24:19,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-17 00:24:19,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:19,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:19,997 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-17 00:24:19,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:19,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769955067] [2025-03-17 00:24:19,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769955067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:19,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:19,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:24:19,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359125953] [2025-03-17 00:24:19,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:19,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:24:19,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:19,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:24:19,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:24:20,000 INFO L87 Difference]: Start difference. First operand 5547 states and 9386 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:21,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:21,005 INFO L93 Difference]: Finished difference Result 16291 states and 27516 transitions. [2025-03-17 00:24:21,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:24:21,006 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 688 [2025-03-17 00:24:21,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:21,076 INFO L225 Difference]: With dead ends: 16291 [2025-03-17 00:24:21,076 INFO L226 Difference]: Without dead ends: 10745 [2025-03-17 00:24:21,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:24:21,098 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 775 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:21,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 1379 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:24:21,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10745 states. [2025-03-17 00:24:21,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10745 to 6139. [2025-03-17 00:24:21,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6139 states, 4782 states have (on average 1.629861982434128) internal successors, (7794), 4810 states have internal predecessors, (7794), 1324 states have call successors, (1324), 32 states have call predecessors, (1324), 32 states have return successors, (1324), 1296 states have call predecessors, (1324), 1324 states have call successors, (1324) [2025-03-17 00:24:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6139 states to 6139 states and 10442 transitions. [2025-03-17 00:24:21,679 INFO L78 Accepts]: Start accepts. Automaton has 6139 states and 10442 transitions. Word has length 688 [2025-03-17 00:24:21,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:21,682 INFO L471 AbstractCegarLoop]: Abstraction has 6139 states and 10442 transitions. [2025-03-17 00:24:21,682 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:21,683 INFO L276 IsEmpty]: Start isEmpty. Operand 6139 states and 10442 transitions. [2025-03-17 00:24:21,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-17 00:24:21,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:21,692 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:21,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:24:21,692 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:21,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:21,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1366256863, now seen corresponding path program 1 times [2025-03-17 00:24:21,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:21,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442801060] [2025-03-17 00:24:21,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:21,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:21,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-17 00:24:21,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-17 00:24:21,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:21,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-17 00:24:22,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:22,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442801060] [2025-03-17 00:24:22,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442801060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:22,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:22,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:24:22,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747846555] [2025-03-17 00:24:22,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:22,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:24:22,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:22,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:24:22,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:22,580 INFO L87 Difference]: Start difference. First operand 6139 states and 10442 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:23,217 INFO L93 Difference]: Finished difference Result 17767 states and 30176 transitions. [2025-03-17 00:24:23,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:24:23,219 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 688 [2025-03-17 00:24:23,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:23,270 INFO L225 Difference]: With dead ends: 17767 [2025-03-17 00:24:23,271 INFO L226 Difference]: Without dead ends: 11629 [2025-03-17 00:24:23,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:23,289 INFO L435 NwaCegarLoop]: 722 mSDtfsCounter, 373 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:23,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1243 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:24:23,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11629 states. [2025-03-17 00:24:24,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11629 to 11623. [2025-03-17 00:24:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11623 states, 9046 states have (on average 1.622153437983639) internal successors, (14674), 9106 states have internal predecessors, (14674), 2512 states have call successors, (2512), 64 states have call predecessors, (2512), 64 states have return successors, (2512), 2452 states have call predecessors, (2512), 2512 states have call successors, (2512) [2025-03-17 00:24:24,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11623 states to 11623 states and 19698 transitions. [2025-03-17 00:24:24,114 INFO L78 Accepts]: Start accepts. Automaton has 11623 states and 19698 transitions. Word has length 688 [2025-03-17 00:24:24,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:24,115 INFO L471 AbstractCegarLoop]: Abstraction has 11623 states and 19698 transitions. [2025-03-17 00:24:24,116 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:24,116 INFO L276 IsEmpty]: Start isEmpty. Operand 11623 states and 19698 transitions. [2025-03-17 00:24:24,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-17 00:24:24,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:24,130 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:24,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:24:24,131 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:24,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:24,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1242183616, now seen corresponding path program 1 times [2025-03-17 00:24:24,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:24,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714124169] [2025-03-17 00:24:24,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:24,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:24,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-17 00:24:24,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-17 00:24:24,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:24,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:24,828 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-17 00:24:24,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:24,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714124169] [2025-03-17 00:24:24,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714124169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:24,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:24,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:24:24,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308482265] [2025-03-17 00:24:24,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:24,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:24:24,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:24,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:24:24,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:24:24,831 INFO L87 Difference]: Start difference. First operand 11623 states and 19698 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:25,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:25,712 INFO L93 Difference]: Finished difference Result 23283 states and 39464 transitions. [2025-03-17 00:24:25,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:24:25,713 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 688 [2025-03-17 00:24:25,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:25,766 INFO L225 Difference]: With dead ends: 23283 [2025-03-17 00:24:25,767 INFO L226 Difference]: Without dead ends: 11661 [2025-03-17 00:24:25,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:24:25,801 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 394 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:25,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1804 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:24:25,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11661 states. [2025-03-17 00:24:26,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11661 to 11655. [2025-03-17 00:24:26,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11655 states, 9078 states have (on average 1.619960343688037) internal successors, (14706), 9138 states have internal predecessors, (14706), 2512 states have call successors, (2512), 64 states have call predecessors, (2512), 64 states have return successors, (2512), 2452 states have call predecessors, (2512), 2512 states have call successors, (2512) [2025-03-17 00:24:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11655 states to 11655 states and 19730 transitions. [2025-03-17 00:24:26,478 INFO L78 Accepts]: Start accepts. Automaton has 11655 states and 19730 transitions. Word has length 688 [2025-03-17 00:24:26,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:26,479 INFO L471 AbstractCegarLoop]: Abstraction has 11655 states and 19730 transitions. [2025-03-17 00:24:26,479 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, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:26,479 INFO L276 IsEmpty]: Start isEmpty. Operand 11655 states and 19730 transitions. [2025-03-17 00:24:26,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-17 00:24:26,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:26,493 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:26,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:24:26,493 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:26,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:26,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1244936159, now seen corresponding path program 1 times [2025-03-17 00:24:26,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:26,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558472458] [2025-03-17 00:24:26,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:26,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:26,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-17 00:24:26,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-17 00:24:26,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:26,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-17 00:24:27,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:27,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558472458] [2025-03-17 00:24:27,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558472458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:27,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:27,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 00:24:27,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324831082] [2025-03-17 00:24:27,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:27,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 00:24:27,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:27,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 00:24:27,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:24:27,688 INFO L87 Difference]: Start difference. First operand 11655 states and 19730 transitions. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:30,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:30,201 INFO L93 Difference]: Finished difference Result 33451 states and 56454 transitions. [2025-03-17 00:24:30,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 00:24:30,201 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 688 [2025-03-17 00:24:30,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:30,292 INFO L225 Difference]: With dead ends: 33451 [2025-03-17 00:24:30,293 INFO L226 Difference]: Without dead ends: 21781 [2025-03-17 00:24:30,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:24:30,335 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 1221 mSDsluCounter, 2224 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 2878 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:30,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 2878 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 00:24:30,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21781 states. [2025-03-17 00:24:31,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21781 to 17263. [2025-03-17 00:24:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17263 states, 13490 states have (on average 1.6176426982950334) internal successors, (21822), 13582 states have internal predecessors, (21822), 3676 states have call successors, (3676), 96 states have call predecessors, (3676), 96 states have return successors, (3676), 3584 states have call predecessors, (3676), 3676 states have call successors, (3676) [2025-03-17 00:24:31,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17263 states to 17263 states and 29174 transitions. [2025-03-17 00:24:31,550 INFO L78 Accepts]: Start accepts. Automaton has 17263 states and 29174 transitions. Word has length 688 [2025-03-17 00:24:31,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:31,551 INFO L471 AbstractCegarLoop]: Abstraction has 17263 states and 29174 transitions. [2025-03-17 00:24:31,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:31,552 INFO L276 IsEmpty]: Start isEmpty. Operand 17263 states and 29174 transitions. [2025-03-17 00:24:31,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2025-03-17 00:24:31,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:31,570 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:31,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:24:31,570 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:31,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:31,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1397409210, now seen corresponding path program 1 times [2025-03-17 00:24:31,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:31,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184360288] [2025-03-17 00:24:31,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:31,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:31,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 689 statements into 1 equivalence classes. [2025-03-17 00:24:31,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 689 of 689 statements. [2025-03-17 00:24:31,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:31,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:32,273 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-17 00:24:32,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:32,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184360288] [2025-03-17 00:24:32,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184360288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:32,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:32,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:24:32,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425966206] [2025-03-17 00:24:32,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:32,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:24:32,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:32,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:24:32,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:24:32,275 INFO L87 Difference]: Start difference. First operand 17263 states and 29174 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:34,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:34,908 INFO L93 Difference]: Finished difference Result 43867 states and 73341 transitions. [2025-03-17 00:24:34,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:24:34,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 689 [2025-03-17 00:24:34,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:35,020 INFO L225 Difference]: With dead ends: 43867 [2025-03-17 00:24:35,021 INFO L226 Difference]: Without dead ends: 26605 [2025-03-17 00:24:35,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:24:35,058 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 463 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:35,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1734 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 00:24:35,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26605 states. [2025-03-17 00:24:36,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26605 to 17614. [2025-03-17 00:24:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17614 states, 13762 states have (on average 1.6089231216392965) internal successors, (22142), 13855 states have internal predecessors, (22142), 3740 states have call successors, (3740), 111 states have call predecessors, (3740), 111 states have return successors, (3740), 3647 states have call predecessors, (3740), 3740 states have call successors, (3740) [2025-03-17 00:24:36,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17614 states to 17614 states and 29622 transitions. [2025-03-17 00:24:36,242 INFO L78 Accepts]: Start accepts. Automaton has 17614 states and 29622 transitions. Word has length 689 [2025-03-17 00:24:36,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:36,243 INFO L471 AbstractCegarLoop]: Abstraction has 17614 states and 29622 transitions. [2025-03-17 00:24:36,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:36,243 INFO L276 IsEmpty]: Start isEmpty. Operand 17614 states and 29622 transitions. [2025-03-17 00:24:36,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2025-03-17 00:24:36,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:36,260 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:36,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 00:24:36,260 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:36,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:36,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1142672665, now seen corresponding path program 1 times [2025-03-17 00:24:36,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:36,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867509664] [2025-03-17 00:24:36,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:36,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:36,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 689 statements into 1 equivalence classes. [2025-03-17 00:24:36,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 689 of 689 statements. [2025-03-17 00:24:36,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:36,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:37,171 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-17 00:24:37,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:37,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867509664] [2025-03-17 00:24:37,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867509664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:37,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:37,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 00:24:37,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409016407] [2025-03-17 00:24:37,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:37,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 00:24:37,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:37,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 00:24:37,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:24:37,174 INFO L87 Difference]: Start difference. First operand 17614 states and 29622 transitions. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:41,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:41,301 INFO L93 Difference]: Finished difference Result 63058 states and 105403 transitions. [2025-03-17 00:24:41,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 00:24:41,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 689 [2025-03-17 00:24:41,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:41,471 INFO L225 Difference]: With dead ends: 63058 [2025-03-17 00:24:41,472 INFO L226 Difference]: Without dead ends: 45556 [2025-03-17 00:24:41,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:24:41,522 INFO L435 NwaCegarLoop]: 906 mSDtfsCounter, 2112 mSDsluCounter, 2146 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2112 SdHoareTripleChecker+Valid, 3052 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 474 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:41,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2112 Valid, 3052 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [474 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 00:24:41,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45556 states. [2025-03-17 00:24:44,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45556 to 35860. [2025-03-17 00:24:44,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35860 states, 27308 states have (on average 1.5794638933645817) internal successors, (43132), 27537 states have internal predecessors, (43132), 8295 states have call successors, (8295), 256 states have call predecessors, (8295), 256 states have return successors, (8295), 8066 states have call predecessors, (8295), 8295 states have call successors, (8295) [2025-03-17 00:24:44,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35860 states to 35860 states and 59722 transitions. [2025-03-17 00:24:44,657 INFO L78 Accepts]: Start accepts. Automaton has 35860 states and 59722 transitions. Word has length 689 [2025-03-17 00:24:44,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:44,658 INFO L471 AbstractCegarLoop]: Abstraction has 35860 states and 59722 transitions. [2025-03-17 00:24:44,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:44,658 INFO L276 IsEmpty]: Start isEmpty. Operand 35860 states and 59722 transitions. [2025-03-17 00:24:44,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2025-03-17 00:24:44,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:44,687 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:44,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 00:24:44,687 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:44,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:44,688 INFO L85 PathProgramCache]: Analyzing trace with hash -117978744, now seen corresponding path program 1 times [2025-03-17 00:24:44,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:44,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809745552] [2025-03-17 00:24:44,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:44,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:44,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 689 statements into 1 equivalence classes. [2025-03-17 00:24:44,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 689 of 689 statements. [2025-03-17 00:24:44,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:44,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-17 00:24:45,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:45,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809745552] [2025-03-17 00:24:45,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809745552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:45,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:45,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:24:45,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177440715] [2025-03-17 00:24:45,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:45,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:24:45,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:45,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:24:45,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:45,323 INFO L87 Difference]: Start difference. First operand 35860 states and 59722 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:49,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:49,060 INFO L93 Difference]: Finished difference Result 86934 states and 144658 transitions. [2025-03-17 00:24:49,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:24:49,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 689 [2025-03-17 00:24:49,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:49,265 INFO L225 Difference]: With dead ends: 86934 [2025-03-17 00:24:49,266 INFO L226 Difference]: Without dead ends: 51186 [2025-03-17 00:24:49,355 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:24:49,356 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 200 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:49,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1097 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:24:49,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51186 states. [2025-03-17 00:24:52,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51186 to 36884. [2025-03-17 00:24:52,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36884 states, 28332 states have (on average 1.590568967951433) internal successors, (45064), 28561 states have internal predecessors, (45064), 8295 states have call successors, (8295), 256 states have call predecessors, (8295), 256 states have return successors, (8295), 8066 states have call predecessors, (8295), 8295 states have call successors, (8295) [2025-03-17 00:24:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36884 states to 36884 states and 61654 transitions. [2025-03-17 00:24:52,687 INFO L78 Accepts]: Start accepts. Automaton has 36884 states and 61654 transitions. Word has length 689 [2025-03-17 00:24:52,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:52,688 INFO L471 AbstractCegarLoop]: Abstraction has 36884 states and 61654 transitions. [2025-03-17 00:24:52,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:52,688 INFO L276 IsEmpty]: Start isEmpty. Operand 36884 states and 61654 transitions. [2025-03-17 00:24:52,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2025-03-17 00:24:52,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:52,717 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:52,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 00:24:52,717 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:52,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:52,718 INFO L85 PathProgramCache]: Analyzing trace with hash 162371145, now seen corresponding path program 1 times [2025-03-17 00:24:52,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:52,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32661000] [2025-03-17 00:24:52,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:52,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:52,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 689 statements into 1 equivalence classes. [2025-03-17 00:24:52,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 689 of 689 statements. [2025-03-17 00:24:52,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:52,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:53,671 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-17 00:24:53,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:53,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32661000] [2025-03-17 00:24:53,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32661000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:53,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:53,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:24:53,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881008214] [2025-03-17 00:24:53,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:53,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:24:53,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:53,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:24:53,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:24:53,675 INFO L87 Difference]: Start difference. First operand 36884 states and 61654 transitions. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:24:57,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:57,012 INFO L93 Difference]: Finished difference Result 94872 states and 159467 transitions. [2025-03-17 00:24:57,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:24:57,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 689 [2025-03-17 00:24:57,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:57,169 INFO L225 Difference]: With dead ends: 94872 [2025-03-17 00:24:57,170 INFO L226 Difference]: Without dead ends: 58100 [2025-03-17 00:24:57,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:24:57,261 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 537 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:57,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 1965 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:24:57,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58100 states. [2025-03-17 00:25:00,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58100 to 52004. [2025-03-17 00:25:00,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52004 states, 43706 states have (on average 1.634947146844827) internal successors, (71457), 43926 states have internal predecessors, (71457), 8048 states have call successors, (8048), 249 states have call predecessors, (8048), 249 states have return successors, (8048), 7828 states have call predecessors, (8048), 8048 states have call successors, (8048) [2025-03-17 00:25:00,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52004 states to 52004 states and 87553 transitions. [2025-03-17 00:25:00,994 INFO L78 Accepts]: Start accepts. Automaton has 52004 states and 87553 transitions. Word has length 689 [2025-03-17 00:25:00,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:25:00,995 INFO L471 AbstractCegarLoop]: Abstraction has 52004 states and 87553 transitions. [2025-03-17 00:25:00,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-17 00:25:00,996 INFO L276 IsEmpty]: Start isEmpty. Operand 52004 states and 87553 transitions. [2025-03-17 00:25:01,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2025-03-17 00:25:01,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:25:01,026 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 00:25:01,027 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:25:01,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:25:01,027 INFO L85 PathProgramCache]: Analyzing trace with hash -948925994, now seen corresponding path program 1 times [2025-03-17 00:25:01,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:25:01,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433845414] [2025-03-17 00:25:01,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:25:01,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:25:01,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 690 statements into 1 equivalence classes. [2025-03-17 00:25:01,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 690 of 690 statements. [2025-03-17 00:25:01,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:25:01,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:25:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 129 proven. 192 refuted. 0 times theorem prover too weak. 22791 trivial. 0 not checked. [2025-03-17 00:25:01,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:25:01,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433845414] [2025-03-17 00:25:01,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433845414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:25:01,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675059981] [2025-03-17 00:25:01,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:25:01,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:25:01,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:25:01,655 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:01,657 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:01,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 690 statements into 1 equivalence classes. [2025-03-17 00:25:01,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 690 of 690 statements. [2025-03-17 00:25:01,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:25:01,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:25:01,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 1560 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 00:25:01,978 INFO L279 TraceCheckSpWp]: Computing forward predicates...