./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-50.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 e26bc3348a806ff5be59d4e299270ec94a7d4962bb4f1a8d7ce9c935e106e68d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:20:10,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:20:10,312 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:20:10,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:20:10,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:20:10,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:20:10,336 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:20:10,336 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:20:10,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:20:10,337 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:20:10,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:20:10,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:20:10,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:20:10,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:20:10,339 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:20:10,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:20:10,339 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:20:10,339 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:20:10,339 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:20:10,339 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:20:10,339 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:20:10,339 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:20:10,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:20:10,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:20:10,339 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:20:10,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:20:10,339 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:20:10,339 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:20:10,339 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:20:10,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:20:10,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:20:10,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:20:10,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:20:10,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:20:10,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:20:10,339 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:20:10,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:20:10,340 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:20:10,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:20:10,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:20:10,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:20:10,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:20:10,340 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:20:10,340 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 -> e26bc3348a806ff5be59d4e299270ec94a7d4962bb4f1a8d7ce9c935e106e68d [2025-03-08 11:20:10,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:20:10,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:20:10,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:20:10,576 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:20:10,577 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:20:10,578 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-50.i [2025-03-08 11:20:11,783 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f13484260/57ff594298884955b4c1b11eb0c12fea/FLAG3e5a7a080 [2025-03-08 11:20:12,030 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:20:12,031 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-50.i [2025-03-08 11:20:12,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f13484260/57ff594298884955b4c1b11eb0c12fea/FLAG3e5a7a080 [2025-03-08 11:20:12,333 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f13484260/57ff594298884955b4c1b11eb0c12fea [2025-03-08 11:20:12,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:20:12,336 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:20:12,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:20:12,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:20:12,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:20:12,341 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:20:12" (1/1) ... [2025-03-08 11:20:12,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4366b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:12, skipping insertion in model container [2025-03-08 11:20:12,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:20:12" (1/1) ... [2025-03-08 11:20:12,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:20:12,483 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-50.i[916,929] [2025-03-08 11:20:12,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:20:12,633 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:20:12,641 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-50.i[916,929] [2025-03-08 11:20:12,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:20:12,739 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:20:12,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:12 WrapperNode [2025-03-08 11:20:12,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:20:12,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:20:12,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:20:12,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:20:12,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:12" (1/1) ... [2025-03-08 11:20:12,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:12" (1/1) ... [2025-03-08 11:20:12,833 INFO L138 Inliner]: procedures = 26, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 876 [2025-03-08 11:20:12,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:20:12,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:20:12,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:20:12,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:20:12,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:12" (1/1) ... [2025-03-08 11:20:12,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:12" (1/1) ... [2025-03-08 11:20:12,857 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:12" (1/1) ... [2025-03-08 11:20:12,899 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-08 11:20:12,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:12" (1/1) ... [2025-03-08 11:20:12,899 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:12" (1/1) ... [2025-03-08 11:20:12,923 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:12" (1/1) ... [2025-03-08 11:20:12,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:12" (1/1) ... [2025-03-08 11:20:12,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:12" (1/1) ... [2025-03-08 11:20:12,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:12" (1/1) ... [2025-03-08 11:20:12,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:20:12,965 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:20:12,965 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:20:12,965 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:20:12,966 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:12" (1/1) ... [2025-03-08 11:20:12,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:20:12,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:20:12,998 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-08 11:20:13,000 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-08 11:20:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:20:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:20:13,018 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:20:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:20:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:20:13,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:20:13,138 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:20:13,140 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:20:14,214 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-08 11:20:14,215 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:20:14,247 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:20:14,247 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:20:14,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:20:14 BoogieIcfgContainer [2025-03-08 11:20:14,248 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:20:14,250 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:20:14,250 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:20:14,254 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:20:14,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:20:12" (1/3) ... [2025-03-08 11:20:14,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ccd486f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:20:14, skipping insertion in model container [2025-03-08 11:20:14,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:20:12" (2/3) ... [2025-03-08 11:20:14,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ccd486f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:20:14, skipping insertion in model container [2025-03-08 11:20:14,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:20:14" (3/3) ... [2025-03-08 11:20:14,257 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-50.i [2025-03-08 11:20:14,268 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:20:14,270 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-50.i that has 2 procedures, 362 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:20:14,331 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:20:14,342 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;@6a4b30d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:20:14,343 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:20:14,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 261 states have (on average 1.6130268199233717) internal successors, (421), 262 states have internal predecessors, (421), 98 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-08 11:20:14,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2025-03-08 11:20:14,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:14,380 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:14,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:14,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:14,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1444653108, now seen corresponding path program 1 times [2025-03-08 11:20:14,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:14,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473511935] [2025-03-08 11:20:14,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:14,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:14,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 638 statements into 1 equivalence classes. [2025-03-08 11:20:14,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 638 of 638 statements. [2025-03-08 11:20:14,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:14,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:14,958 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 194 refuted. 0 times theorem prover too weak. 18818 trivial. 0 not checked. [2025-03-08 11:20:14,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:14,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473511935] [2025-03-08 11:20:14,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473511935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:20:14,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200290544] [2025-03-08 11:20:14,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:14,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:20:14,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:20:14,962 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-08 11:20:14,965 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-08 11:20:15,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 638 statements into 1 equivalence classes. [2025-03-08 11:20:15,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 638 of 638 statements. [2025-03-08 11:20:15,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:15,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:15,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 1464 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:20:15,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:20:15,389 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 18818 trivial. 0 not checked. [2025-03-08 11:20:15,390 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:20:15,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200290544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:15,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:20:15,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:20:15,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876536595] [2025-03-08 11:20:15,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:15,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:20:15,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:15,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:20:15,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:20:15,415 INFO L87 Difference]: Start difference. First operand has 362 states, 261 states have (on average 1.6130268199233717) internal successors, (421), 262 states have internal predecessors, (421), 98 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) Second operand has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 2 states have call successors, (98) [2025-03-08 11:20:15,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:15,506 INFO L93 Difference]: Finished difference Result 713 states and 1319 transitions. [2025-03-08 11:20:15,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:20:15,508 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 2 states have call successors, (98) Word has length 638 [2025-03-08 11:20:15,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:15,518 INFO L225 Difference]: With dead ends: 713 [2025-03-08 11:20:15,518 INFO L226 Difference]: Without dead ends: 354 [2025-03-08 11:20:15,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 639 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-08 11:20:15,524 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:15,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 578 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:20:15,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-08 11:20:15,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-03-08 11:20:15,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 254 states have (on average 1.5826771653543308) internal successors, (402), 254 states have internal predecessors, (402), 98 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-08 11:20:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 598 transitions. [2025-03-08 11:20:15,587 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 598 transitions. Word has length 638 [2025-03-08 11:20:15,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:15,588 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 598 transitions. [2025-03-08 11:20:15,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 2 states have call successors, (98) [2025-03-08 11:20:15,589 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 598 transitions. [2025-03-08 11:20:15,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2025-03-08 11:20:15,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:15,600 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:15,608 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-08 11:20:15,807 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-08 11:20:15,807 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:15,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:15,808 INFO L85 PathProgramCache]: Analyzing trace with hash -859151084, now seen corresponding path program 1 times [2025-03-08 11:20:15,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:15,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828464866] [2025-03-08 11:20:15,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:15,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:15,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 639 statements into 1 equivalence classes. [2025-03-08 11:20:15,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 639 of 639 statements. [2025-03-08 11:20:15,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:15,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:16,436 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 11:20:16,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:16,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828464866] [2025-03-08 11:20:16,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828464866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:16,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:16,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:20:16,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731292933] [2025-03-08 11:20:16,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:16,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:20:16,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:16,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:20:16,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:20:16,443 INFO L87 Difference]: Start difference. First operand 354 states and 598 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, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:20:16,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:16,554 INFO L93 Difference]: Finished difference Result 855 states and 1446 transitions. [2025-03-08 11:20:16,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:20:16,555 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, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 639 [2025-03-08 11:20:16,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:16,562 INFO L225 Difference]: With dead ends: 855 [2025-03-08 11:20:16,563 INFO L226 Difference]: Without dead ends: 504 [2025-03-08 11:20:16,564 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-08 11:20:16,565 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 212 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:16,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1234 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:20:16,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-08 11:20:16,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 501. [2025-03-08 11:20:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 366 states have (on average 1.5956284153005464) internal successors, (584), 367 states have internal predecessors, (584), 132 states have call successors, (132), 2 states have call predecessors, (132), 2 states have return successors, (132), 131 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-08 11:20:16,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 848 transitions. [2025-03-08 11:20:16,631 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 848 transitions. Word has length 639 [2025-03-08 11:20:16,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:16,634 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 848 transitions. [2025-03-08 11:20:16,634 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, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:20:16,634 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 848 transitions. [2025-03-08 11:20:16,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2025-03-08 11:20:16,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:16,645 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:16,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:20:16,645 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:16,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:16,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1369685261, now seen corresponding path program 1 times [2025-03-08 11:20:16,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:16,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765531084] [2025-03-08 11:20:16,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:16,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:16,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 639 statements into 1 equivalence classes. [2025-03-08 11:20:16,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 639 of 639 statements. [2025-03-08 11:20:16,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:16,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:17,367 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 11:20:17,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:17,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765531084] [2025-03-08 11:20:17,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765531084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:17,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:17,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:20:17,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063890839] [2025-03-08 11:20:17,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:17,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:20:17,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:17,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:20:17,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:20:17,369 INFO L87 Difference]: Start difference. First operand 501 states and 848 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, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:20:17,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:17,787 INFO L93 Difference]: Finished difference Result 1498 states and 2540 transitions. [2025-03-08 11:20:17,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:20:17,788 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, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 639 [2025-03-08 11:20:17,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:17,795 INFO L225 Difference]: With dead ends: 1498 [2025-03-08 11:20:17,799 INFO L226 Difference]: Without dead ends: 1000 [2025-03-08 11:20:17,802 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-08 11:20:17,804 INFO L435 NwaCegarLoop]: 1062 mSDtfsCounter, 575 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1986 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:17,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1986 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:20:17,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2025-03-08 11:20:17,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 998. [2025-03-08 11:20:17,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 729 states have (on average 1.5967078189300412) internal successors, (1164), 731 states have internal predecessors, (1164), 264 states have call successors, (264), 4 states have call predecessors, (264), 4 states have return successors, (264), 262 states have call predecessors, (264), 264 states have call successors, (264) [2025-03-08 11:20:17,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1692 transitions. [2025-03-08 11:20:17,910 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1692 transitions. Word has length 639 [2025-03-08 11:20:17,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:17,912 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1692 transitions. [2025-03-08 11:20:17,912 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, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:20:17,912 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1692 transitions. [2025-03-08 11:20:17,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2025-03-08 11:20:17,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:17,924 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:17,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:20:17,924 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:17,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:17,925 INFO L85 PathProgramCache]: Analyzing trace with hash -931675758, now seen corresponding path program 1 times [2025-03-08 11:20:17,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:17,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143164131] [2025-03-08 11:20:17,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:17,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:17,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 639 statements into 1 equivalence classes. [2025-03-08 11:20:18,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 639 of 639 statements. [2025-03-08 11:20:18,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:18,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:18,318 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 11:20:18,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:18,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143164131] [2025-03-08 11:20:18,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143164131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:18,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:18,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:20:18,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287174381] [2025-03-08 11:20:18,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:18,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:20:18,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:18,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:20:18,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:20:18,321 INFO L87 Difference]: Start difference. First operand 998 states and 1692 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, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:20:22,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 11:20:22,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:22,550 INFO L93 Difference]: Finished difference Result 2974 states and 5048 transitions. [2025-03-08 11:20:22,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:20:22,550 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, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 639 [2025-03-08 11:20:22,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:22,566 INFO L225 Difference]: With dead ends: 2974 [2025-03-08 11:20:22,566 INFO L226 Difference]: Without dead ends: 1979 [2025-03-08 11:20:22,571 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-08 11:20:22,572 INFO L435 NwaCegarLoop]: 979 mSDtfsCounter, 545 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:22,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1529 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 11:20:22,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2025-03-08 11:20:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1977. [2025-03-08 11:20:22,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1977 states, 1440 states have (on average 1.5888888888888888) internal successors, (2288), 1444 states have internal predecessors, (2288), 528 states have call successors, (528), 8 states have call predecessors, (528), 8 states have return successors, (528), 524 states have call predecessors, (528), 528 states have call successors, (528) [2025-03-08 11:20:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 3344 transitions. [2025-03-08 11:20:22,734 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 3344 transitions. Word has length 639 [2025-03-08 11:20:22,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:22,734 INFO L471 AbstractCegarLoop]: Abstraction has 1977 states and 3344 transitions. [2025-03-08 11:20:22,735 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, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:20:22,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 3344 transitions. [2025-03-08 11:20:22,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-03-08 11:20:22,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:22,740 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:22,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:20:22,740 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:22,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:22,741 INFO L85 PathProgramCache]: Analyzing trace with hash 898434986, now seen corresponding path program 1 times [2025-03-08 11:20:22,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:22,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15108885] [2025-03-08 11:20:22,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:22,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:22,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-03-08 11:20:22,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-03-08 11:20:22,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:22,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 11:20:23,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:23,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15108885] [2025-03-08 11:20:23,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15108885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:23,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:23,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:20:23,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044719535] [2025-03-08 11:20:23,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:23,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:20:23,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:23,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:20:23,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:20:23,162 INFO L87 Difference]: Start difference. First operand 1977 states and 3344 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:20:23,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:23,675 INFO L93 Difference]: Finished difference Result 5917 states and 10010 transitions. [2025-03-08 11:20:23,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:20:23,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 641 [2025-03-08 11:20:23,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:23,708 INFO L225 Difference]: With dead ends: 5917 [2025-03-08 11:20:23,709 INFO L226 Difference]: Without dead ends: 3943 [2025-03-08 11:20:23,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-08 11:20:23,718 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 591 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:23,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 1513 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:20:23,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3943 states. [2025-03-08 11:20:23,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3943 to 2009. [2025-03-08 11:20:23,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2009 states, 1472 states have (on average 1.5815217391304348) internal successors, (2328), 1476 states have internal predecessors, (2328), 528 states have call successors, (528), 8 states have call predecessors, (528), 8 states have return successors, (528), 524 states have call predecessors, (528), 528 states have call successors, (528) [2025-03-08 11:20:23,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 3384 transitions. [2025-03-08 11:20:24,022 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 3384 transitions. Word has length 641 [2025-03-08 11:20:24,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:24,025 INFO L471 AbstractCegarLoop]: Abstraction has 2009 states and 3384 transitions. [2025-03-08 11:20:24,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:20:24,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 3384 transitions. [2025-03-08 11:20:24,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-03-08 11:20:24,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:24,030 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:24,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:20:24,031 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:24,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:24,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1785938667, now seen corresponding path program 1 times [2025-03-08 11:20:24,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:24,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897960399] [2025-03-08 11:20:24,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:24,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:24,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-03-08 11:20:24,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-03-08 11:20:24,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:24,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:24,622 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 11:20:24,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:24,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897960399] [2025-03-08 11:20:24,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897960399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:24,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:24,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:20:24,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976139645] [2025-03-08 11:20:24,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:24,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:20:24,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:24,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:20:24,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:20:24,625 INFO L87 Difference]: Start difference. First operand 2009 states and 3384 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:20:24,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:24,920 INFO L93 Difference]: Finished difference Result 6021 states and 10146 transitions. [2025-03-08 11:20:24,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:20:24,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 641 [2025-03-08 11:20:24,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:24,942 INFO L225 Difference]: With dead ends: 6021 [2025-03-08 11:20:24,943 INFO L226 Difference]: Without dead ends: 4015 [2025-03-08 11:20:24,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-08 11:20:24,952 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 431 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:24,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1416 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:20:24,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4015 states. [2025-03-08 11:20:25,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4015 to 4013. [2025-03-08 11:20:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4013 states, 2940 states have (on average 1.5755102040816327) internal successors, (4632), 2948 states have internal predecessors, (4632), 1056 states have call successors, (1056), 16 states have call predecessors, (1056), 16 states have return successors, (1056), 1048 states have call predecessors, (1056), 1056 states have call successors, (1056) [2025-03-08 11:20:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4013 states to 4013 states and 6744 transitions. [2025-03-08 11:20:25,274 INFO L78 Accepts]: Start accepts. Automaton has 4013 states and 6744 transitions. Word has length 641 [2025-03-08 11:20:25,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:25,274 INFO L471 AbstractCegarLoop]: Abstraction has 4013 states and 6744 transitions. [2025-03-08 11:20:25,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:20:25,275 INFO L276 IsEmpty]: Start isEmpty. Operand 4013 states and 6744 transitions. [2025-03-08 11:20:25,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-03-08 11:20:25,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:25,281 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:25,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:20:25,281 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:25,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:25,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1655915464, now seen corresponding path program 1 times [2025-03-08 11:20:25,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:25,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580969405] [2025-03-08 11:20:25,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:25,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:25,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-03-08 11:20:25,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-03-08 11:20:25,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:25,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:25,656 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 11:20:25,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:25,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580969405] [2025-03-08 11:20:25,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580969405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:25,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:25,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:20:25,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114191347] [2025-03-08 11:20:25,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:25,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:20:25,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:25,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:20:25,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:20:25,658 INFO L87 Difference]: Start difference. First operand 4013 states and 6744 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:20:26,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:26,014 INFO L93 Difference]: Finished difference Result 12033 states and 20226 transitions. [2025-03-08 11:20:26,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:20:26,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 642 [2025-03-08 11:20:26,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:26,056 INFO L225 Difference]: With dead ends: 12033 [2025-03-08 11:20:26,057 INFO L226 Difference]: Without dead ends: 8023 [2025-03-08 11:20:26,070 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-08 11:20:26,071 INFO L435 NwaCegarLoop]: 1100 mSDtfsCounter, 591 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:26,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 1673 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:20:26,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8023 states. [2025-03-08 11:20:26,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8023 to 4045. [2025-03-08 11:20:26,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4045 states, 2972 states have (on average 1.5720053835800807) internal successors, (4672), 2980 states have internal predecessors, (4672), 1056 states have call successors, (1056), 16 states have call predecessors, (1056), 16 states have return successors, (1056), 1048 states have call predecessors, (1056), 1056 states have call successors, (1056) [2025-03-08 11:20:26,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4045 states to 4045 states and 6784 transitions. [2025-03-08 11:20:26,614 INFO L78 Accepts]: Start accepts. Automaton has 4045 states and 6784 transitions. Word has length 642 [2025-03-08 11:20:26,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:26,615 INFO L471 AbstractCegarLoop]: Abstraction has 4045 states and 6784 transitions. [2025-03-08 11:20:26,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:20:26,616 INFO L276 IsEmpty]: Start isEmpty. Operand 4045 states and 6784 transitions. [2025-03-08 11:20:26,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-03-08 11:20:26,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:26,625 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:26,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:20:26,625 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:26,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:26,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1686935271, now seen corresponding path program 1 times [2025-03-08 11:20:26,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:26,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527670540] [2025-03-08 11:20:26,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:26,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:26,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-03-08 11:20:26,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-03-08 11:20:26,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:26,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:27,286 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 11:20:27,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:27,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527670540] [2025-03-08 11:20:27,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527670540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:27,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:27,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:20:27,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239852129] [2025-03-08 11:20:27,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:27,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:20:27,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:27,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:20:27,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:20:27,289 INFO L87 Difference]: Start difference. First operand 4045 states and 6784 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:20:28,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:28,360 INFO L93 Difference]: Finished difference Result 14099 states and 23663 transitions. [2025-03-08 11:20:28,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:20:28,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 642 [2025-03-08 11:20:28,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:28,413 INFO L225 Difference]: With dead ends: 14099 [2025-03-08 11:20:28,413 INFO L226 Difference]: Without dead ends: 10057 [2025-03-08 11:20:28,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:20:28,429 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 1043 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 2046 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:28,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 2046 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:20:28,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10057 states. [2025-03-08 11:20:28,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10057 to 7493. [2025-03-08 11:20:28,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7493 states, 5956 states have (on average 1.610476830087307) internal successors, (9592), 5980 states have internal predecessors, (9592), 1504 states have call successors, (1504), 32 states have call predecessors, (1504), 32 states have return successors, (1504), 1480 states have call predecessors, (1504), 1504 states have call successors, (1504) [2025-03-08 11:20:29,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7493 states to 7493 states and 12600 transitions. [2025-03-08 11:20:29,008 INFO L78 Accepts]: Start accepts. Automaton has 7493 states and 12600 transitions. Word has length 642 [2025-03-08 11:20:29,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:29,009 INFO L471 AbstractCegarLoop]: Abstraction has 7493 states and 12600 transitions. [2025-03-08 11:20:29,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:20:29,010 INFO L276 IsEmpty]: Start isEmpty. Operand 7493 states and 12600 transitions. [2025-03-08 11:20:29,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-03-08 11:20:29,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:29,019 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:29,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:20:29,020 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:29,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:29,020 INFO L85 PathProgramCache]: Analyzing trace with hash -120912250, now seen corresponding path program 1 times [2025-03-08 11:20:29,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:29,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589185908] [2025-03-08 11:20:29,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:29,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:29,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-03-08 11:20:29,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-03-08 11:20:29,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:29,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 11:20:29,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:29,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589185908] [2025-03-08 11:20:29,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589185908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:29,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:29,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:20:29,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601048822] [2025-03-08 11:20:29,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:29,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:20:29,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:29,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:20:29,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:20:29,404 INFO L87 Difference]: Start difference. First operand 7493 states and 12600 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:20:29,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:29,972 INFO L93 Difference]: Finished difference Result 20809 states and 34974 transitions. [2025-03-08 11:20:29,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:20:29,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 642 [2025-03-08 11:20:29,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:30,027 INFO L225 Difference]: With dead ends: 20809 [2025-03-08 11:20:30,027 INFO L226 Difference]: Without dead ends: 13319 [2025-03-08 11:20:30,056 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-08 11:20:30,058 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 330 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:30,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1100 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:20:30,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13319 states. [2025-03-08 11:20:30,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13319 to 13285. [2025-03-08 11:20:30,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13285 states, 10884 states have (on average 1.6185226019845644) internal successors, (17616), 10940 states have internal predecessors, (17616), 2336 states have call successors, (2336), 64 states have call predecessors, (2336), 64 states have return successors, (2336), 2280 states have call predecessors, (2336), 2336 states have call successors, (2336) [2025-03-08 11:20:30,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13285 states to 13285 states and 22288 transitions. [2025-03-08 11:20:30,660 INFO L78 Accepts]: Start accepts. Automaton has 13285 states and 22288 transitions. Word has length 642 [2025-03-08 11:20:30,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:30,661 INFO L471 AbstractCegarLoop]: Abstraction has 13285 states and 22288 transitions. [2025-03-08 11:20:30,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:20:30,661 INFO L276 IsEmpty]: Start isEmpty. Operand 13285 states and 22288 transitions. [2025-03-08 11:20:30,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-03-08 11:20:30,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:30,675 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:30,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:20:30,676 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:30,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:30,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1556870460, now seen corresponding path program 1 times [2025-03-08 11:20:30,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:30,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973648364] [2025-03-08 11:20:30,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:30,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:30,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-03-08 11:20:30,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-03-08 11:20:30,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:30,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:31,024 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 11:20:31,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:31,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973648364] [2025-03-08 11:20:31,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973648364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:31,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:31,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 11:20:31,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598425673] [2025-03-08 11:20:31,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:31,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 11:20:31,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:31,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 11:20:31,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:20:31,027 INFO L87 Difference]: Start difference. First operand 13285 states and 22288 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:20:34,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:34,582 INFO L93 Difference]: Finished difference Result 80451 states and 134327 transitions. [2025-03-08 11:20:34,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 11:20:34,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 643 [2025-03-08 11:20:34,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:34,806 INFO L225 Difference]: With dead ends: 80451 [2025-03-08 11:20:34,807 INFO L226 Difference]: Without dead ends: 67169 [2025-03-08 11:20:34,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-08 11:20:34,856 INFO L435 NwaCegarLoop]: 1315 mSDtfsCounter, 2354 mSDsluCounter, 3253 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2354 SdHoareTripleChecker+Valid, 4568 SdHoareTripleChecker+Invalid, 1881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:34,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2354 Valid, 4568 Invalid, 1881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 11:20:34,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67169 states. [2025-03-08 11:20:36,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67169 to 33173. [2025-03-08 11:20:36,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33173 states, 27224 states have (on average 1.622318542462533) internal successors, (44166), 27372 states have internal predecessors, (44166), 5756 states have call successors, (5756), 192 states have call predecessors, (5756), 192 states have return successors, (5756), 5608 states have call predecessors, (5756), 5756 states have call successors, (5756) [2025-03-08 11:20:36,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33173 states to 33173 states and 55678 transitions. [2025-03-08 11:20:36,895 INFO L78 Accepts]: Start accepts. Automaton has 33173 states and 55678 transitions. Word has length 643 [2025-03-08 11:20:36,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:36,897 INFO L471 AbstractCegarLoop]: Abstraction has 33173 states and 55678 transitions. [2025-03-08 11:20:36,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:20:36,897 INFO L276 IsEmpty]: Start isEmpty. Operand 33173 states and 55678 transitions. [2025-03-08 11:20:36,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-03-08 11:20:36,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:36,934 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:36,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:20:36,934 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:36,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:36,935 INFO L85 PathProgramCache]: Analyzing trace with hash 948793597, now seen corresponding path program 1 times [2025-03-08 11:20:36,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:36,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076674141] [2025-03-08 11:20:36,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:36,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:36,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-03-08 11:20:36,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-03-08 11:20:36,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:36,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 11:20:37,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:37,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076674141] [2025-03-08 11:20:37,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076674141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:37,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:37,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:20:37,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817645505] [2025-03-08 11:20:37,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:37,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:20:37,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:37,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:20:37,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:20:37,206 INFO L87 Difference]: Start difference. First operand 33173 states and 55678 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:20:38,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:38,676 INFO L93 Difference]: Finished difference Result 66415 states and 111497 transitions. [2025-03-08 11:20:38,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:20:38,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 643 [2025-03-08 11:20:38,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:38,803 INFO L225 Difference]: With dead ends: 66415 [2025-03-08 11:20:38,804 INFO L226 Difference]: Without dead ends: 33245 [2025-03-08 11:20:38,869 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-08 11:20:38,870 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 0 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:38,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1149 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:20:38,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33245 states. [2025-03-08 11:20:40,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33245 to 33197. [2025-03-08 11:20:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33197 states, 27248 states have (on average 1.6217704051673518) internal successors, (44190), 27396 states have internal predecessors, (44190), 5756 states have call successors, (5756), 192 states have call predecessors, (5756), 192 states have return successors, (5756), 5608 states have call predecessors, (5756), 5756 states have call successors, (5756) [2025-03-08 11:20:40,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33197 states to 33197 states and 55702 transitions. [2025-03-08 11:20:40,723 INFO L78 Accepts]: Start accepts. Automaton has 33197 states and 55702 transitions. Word has length 643 [2025-03-08 11:20:40,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:40,723 INFO L471 AbstractCegarLoop]: Abstraction has 33197 states and 55702 transitions. [2025-03-08 11:20:40,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:20:40,724 INFO L276 IsEmpty]: Start isEmpty. Operand 33197 states and 55702 transitions. [2025-03-08 11:20:40,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-03-08 11:20:40,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:40,752 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:40,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 11:20:40,752 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:40,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:40,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1393106114, now seen corresponding path program 1 times [2025-03-08 11:20:40,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:40,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946740242] [2025-03-08 11:20:40,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:40,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:40,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-03-08 11:20:40,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-03-08 11:20:40,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:40,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:41,451 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 11:20:41,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:41,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946740242] [2025-03-08 11:20:41,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946740242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:41,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:41,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 11:20:41,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975745305] [2025-03-08 11:20:41,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:41,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 11:20:41,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:41,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 11:20:41,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:20:41,453 INFO L87 Difference]: Start difference. First operand 33197 states and 55702 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:20:46,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:20:46,287 INFO L93 Difference]: Finished difference Result 144711 states and 242910 transitions. [2025-03-08 11:20:46,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 11:20:46,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 643 [2025-03-08 11:20:46,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:20:46,602 INFO L225 Difference]: With dead ends: 144711 [2025-03-08 11:20:46,603 INFO L226 Difference]: Without dead ends: 111517 [2025-03-08 11:20:46,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:20:46,693 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 1767 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1767 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:20:46,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1767 Valid, 2204 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 11:20:46,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111517 states. [2025-03-08 11:20:50,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111517 to 77673. [2025-03-08 11:20:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77673 states, 65804 states have (on average 1.630964682997994) internal successors, (107324), 66192 states have internal predecessors, (107324), 11356 states have call successors, (11356), 512 states have call predecessors, (11356), 512 states have return successors, (11356), 10968 states have call predecessors, (11356), 11356 states have call successors, (11356) [2025-03-08 11:20:50,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77673 states to 77673 states and 130036 transitions. [2025-03-08 11:20:50,955 INFO L78 Accepts]: Start accepts. Automaton has 77673 states and 130036 transitions. Word has length 643 [2025-03-08 11:20:50,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:20:50,956 INFO L471 AbstractCegarLoop]: Abstraction has 77673 states and 130036 transitions. [2025-03-08 11:20:50,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:20:50,957 INFO L276 IsEmpty]: Start isEmpty. Operand 77673 states and 130036 transitions. [2025-03-08 11:20:51,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2025-03-08 11:20:51,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:20:51,016 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:20:51,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 11:20:51,016 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:20:51,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:20:51,017 INFO L85 PathProgramCache]: Analyzing trace with hash -2060655275, now seen corresponding path program 1 times [2025-03-08 11:20:51,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:20:51,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550732762] [2025-03-08 11:20:51,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:51,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:20:51,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 644 statements into 1 equivalence classes. [2025-03-08 11:20:51,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 644 of 644 statements. [2025-03-08 11:20:51,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:51,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:51,542 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 11:20:51,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:51,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550732762] [2025-03-08 11:20:51,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550732762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:20:51,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:20:51,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:20:51,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46909791] [2025-03-08 11:20:51,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:20:51,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:20:51,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:51,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:20:51,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:20:51,544 INFO L87 Difference]: Start difference. First operand 77673 states and 130036 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:21:00,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:21:00,408 INFO L93 Difference]: Finished difference Result 240269 states and 400564 transitions. [2025-03-08 11:21:00,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 11:21:00,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 644 [2025-03-08 11:21:00,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:21:00,834 INFO L225 Difference]: With dead ends: 240269 [2025-03-08 11:21:00,835 INFO L226 Difference]: Without dead ends: 162599 [2025-03-08 11:21:00,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-03-08 11:21:00,980 INFO L435 NwaCegarLoop]: 1172 mSDtfsCounter, 2933 mSDsluCounter, 2768 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2933 SdHoareTripleChecker+Valid, 3940 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:21:00,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2933 Valid, 3940 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 11:21:01,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162599 states. [2025-03-08 11:21:05,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162599 to 65685. [2025-03-08 11:21:05,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65685 states, 56952 states have (on average 1.6493889591234725) internal successors, (93936), 57212 states have internal predecessors, (93936), 8284 states have call successors, (8284), 448 states have call predecessors, (8284), 448 states have return successors, (8284), 8024 states have call predecessors, (8284), 8284 states have call successors, (8284) [2025-03-08 11:21:05,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65685 states to 65685 states and 110504 transitions. [2025-03-08 11:21:05,305 INFO L78 Accepts]: Start accepts. Automaton has 65685 states and 110504 transitions. Word has length 644 [2025-03-08 11:21:05,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:21:05,305 INFO L471 AbstractCegarLoop]: Abstraction has 65685 states and 110504 transitions. [2025-03-08 11:21:05,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:21:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 65685 states and 110504 transitions. [2025-03-08 11:21:05,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2025-03-08 11:21:05,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:21:05,346 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:21:05,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 11:21:05,347 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:21:05,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:21:05,347 INFO L85 PathProgramCache]: Analyzing trace with hash 472287433, now seen corresponding path program 1 times [2025-03-08 11:21:05,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:21:05,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156159099] [2025-03-08 11:21:05,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:21:05,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:21:05,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 644 statements into 1 equivalence classes. [2025-03-08 11:21:05,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 644 of 644 statements. [2025-03-08 11:21:05,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:21:05,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:21:05,556 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 11:21:05,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:21:05,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156159099] [2025-03-08 11:21:05,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156159099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:21:05,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:21:05,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:21:05,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833431141] [2025-03-08 11:21:05,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:21:05,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:21:05,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:21:05,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:21:05,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:21:05,559 INFO L87 Difference]: Start difference. First operand 65685 states and 110504 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98)